Dear Fellow Colleagues,
Your are cordially invited to contribute to the Evolutionary Combinatorial Optimization and Metaheuristics (ECOM) Track at the forthcoming Genetic and Evolutionary Computation Conference (GECCO 2011) to take place in Dublin, Ireland during July 12-16, 2011.
-------------------------------------------------------------------------------------------------------------------
Call for Papers: Evolutionary Combinatorial Optimization and Metaheuristics (ECOM)
Track at GECCO 2011, July 12-16, Dublin, Ireland
-------------------------------------------------------------------------------------------------------------------
Please Visit: http://www.sigevo.org/gecco-2011/organizers-tracks.html#ecom for more information on GECCO 2011.
Description
The aim of this track is to provide a forum for high quality research on metaheuristics for combinatorial optimization problems. Plenty of hard problems in a huge variety of areas, including logistics, network design, bioinformatics, engineering, business, etc., have been tackled successfully with metaheuristic approaches. For many problems the resulting algorithms are considered to be state-of-the-art. Apart from evolutionary algorithms, the class of metaheuristics includes prominent members such as tabu search, iterated local search, variable neighborhood search, memetic algorithms, simulated annealing, GRASP, ant colony optimization and others.
The ECOM track at GECCO invites original and unpublished contributions in any topic concerning applications or the theory of all kinds of Metaheuristics for combinatorial optimization problems. See the list of suggested (but not limited to) topics at:
1. Applications of metaheuristics to combinatorial optimization problems
2. Theoretical developments in combinatorial optimization and metaheuristics
3. Representation techniques
4. Neighborhoods and efficient algorithms for searching them
5. Variation operators for stochastic search methods
6. Search space analysis
7. Comparisons between different (also exact) techniques
8. Constraint-handling techniques
9. Hybrid methods, Adaptive hybridization techniques and Memetic Computing Methodologies
10. Insight into problem characteristics of problem classes
Keywords
local search, variable neighborhood search, iterated local search, tabu search, simulated annealing, very large scale neighborhood search, search space analysis, hybrid metaheuristic, matheuristic, memetic algorithm, ant colony optimization, particle swarm optimization, scatter search, path relinking, GRASP, vehicle routing, cutting and packing, scheduling, timetabling, bioinformatics, transport optimization, routing, network design, representations.
Sincerely,
Dr. Yew-Soon Ong, [log in to unmask], Nanyang Technological University
Dr. Günther Raidl, [log in to unmask], Vienna University of Technology
Track Chairs
