Sciweavers

273 search results - page 13 / 55
» Genetic local search for multi-objective combinatorial optim...
Sort
View
GECCO
2008
Springer
104views Optimization» more  GECCO 2008»
14 years 11 months ago
Understanding elementary landscapes
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...
Darrell Whitley, Andrew M. Sutton, Adele E. Howe
TSMC
2002
142views more  TSMC 2002»
14 years 10 months ago
Dynamics of local search heuristics for the traveling salesman problem
This paper experimentally investigates the dynamical behavior of a search process in a local heuristic search system for a combinatorial optimization problem. Or-opt heuristic algo...
Weiqi Li, Bahram Alidaee
ANOR
2010
102views more  ANOR 2010»
14 years 11 months ago
Ejection chain and filter-and-fan methods in combinatorial optimization
The design of effective neighborhood structures is fundamentally important for creating better local search and metaheuristic algorithms for combinatorial optimization. Significant...
César Rego, Fred Glover
CEC
2007
IEEE
15 years 5 months ago
SAT-decoding in evolutionary algorithms for discrete constrained optimization problems
— For complex optimization problems, several population-based heuristics like Multi-Objective Evolutionary Algorithms have been developed. These algorithms are aiming to deliver ...
Martin Lukasiewycz, Michael Glaß, Christian ...
EUROGP
2010
Springer
172views Optimization» more  EUROGP 2010»
15 years 2 months ago
Geometric Differential Evolution on the Space of Genetic Programs
Abstract. Geometric Differential Evolution (GDE) is a very recently introduced formal generalization of traditional Differential Evolution (DE) that can be used to derive specific ...
Alberto Moraglio, Sara Silva