Sciweavers

3367 search results - page 20 / 674
» Incremental assignment problem
Sort
View
GECCO
2006
Springer
287views Optimization» more  GECCO 2006»
15 years 1 months ago
A GA-ACO-local search hybrid algorithm for solving quadratic assignment problem
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
Yiliang Xu, Meng-Hiot Lim, Yew-Soon Ong, Jing Tang
89
Voted
CEC
2007
IEEE
15 years 4 months ago
An efficient Genetic Algorithm with uniform crossover for the multi-objective Airport Gate Assignment Problem
—Genetic Algorithms (GAs) have a good potential of solving the Gate Assignment Problem (GAP) at airport terminals, and the design of feasible and efficient evolutionary operators...
Xiao-Bing Hu, Ezequiel A. Di Paolo
ISAAC
2001
Springer
112views Algorithms» more  ISAAC 2001»
15 years 2 months ago
On the Complexity of Train Assignment Problems
We consider a problem faced by train companies: How can trains be assigned to satisfy scheduled routes in a cost efficient way? Currently, many railway companies create solutions b...
Thomas Erlebach, Martin Gantenbein, Daniel Hü...
91
Voted
GECCO
2005
Springer
127views Optimization» more  GECCO 2005»
15 years 3 months ago
The enhanced evolutionary tabu search and its application to the quadratic assignment problem
We describe the Enhanced Evolutionary Tabu Search (EE-TS) local search technique. The EE-TS metaheuristic technique combines Reactive Tabu Search with evolutionary computing eleme...
John F. McLoughlin III, Walter Cedeño
CEC
2010
IEEE
14 years 10 months ago
Local Optima Networks of the Quadratic Assignment Problem
Using a recently proposed model for combinatorial landscapes, Local Optima Networks (LON), we conduct a thorough analysis of two types of instances of the Quadratic Assignment Prob...
Fabio Daolio, Sébastien Vérel, Gabri...