Dear Fellow Colleagues,
Your are cordially invited to submit papers to the Evolutionary
Combinatorial Optimization and Metaheuristics (ECOM) Track at the
forthcoming Genetic and Evolutionary Computation Conference (GECCO 2012)
to take place in Philadelphia (USA), during July 7-11, 2012.
-------------------------------------------------------------------------------------------------------------------
Call for Papers: Evolutionary Combinatorial Optimization and
Metaheuristics (ECOM)
Track at GECCO 2012, July 7-11, Philadelphia, USA
Submission deadline: ** January 13, 2012 **
Please visit http://www.sigevo.org/gecco-2012/ for more information on
GECCO 2012.
-------------------------------------------------------------------------------------------------------------------
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. Possible topics
include (but not limited to):
* Applications of metaheuristics to combinatorial optimization problems
* Theoretical developments in combinatorial optimization and metaheuristics
* Representation techniques
* Neighborhoods and efficient algorithms for searching them
* Variation operators for stochastic search methods
* Search space analysis
* Comparisons between different (also exact) techniques
* Constraint-handling techniques
* Hybrid methods, Adaptive hybridization techniques and Memetic
Computing Methodologies
* Insight into problem characteristics of problem classes
Sincerely,
Track Organizers
Dr. Christian Blum, cblum@lsi.upc.edu, Universitat Politecnica de Catalunya
Dr. Yew-Soon Ong, asysong@ntu.edu.sg, Nanyang Technological University
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
