Loading ...
Sorry, an error occurred while loading the content.
 

CFP: Evolutionary Combinatorial Optimization and Metaheuristics (ECOM) Track at GECCO 2014

Expand Messages
  • Thomas Stützle
    ** Apologies for multiple postings ** *****************************************************************************
    Message 1 of 1 , Dec 5, 2013
      ** Apologies for multiple postings **


      *****************************************************************************
      ***                            CALL FOR PAPERS                           
      ***   2014 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO-2014)  
      *   Evolutionary Combinatorial Optimization and Metaheuristics (ECOM) Track
      ***                  July 12-16, 2014, Vancouver, Canada             
      ***                       Organized by ACM SIGEVO                        
      ***                   http://www.sigevo.org/gecco-2014%c2%a0%c2%a0%c2%a0%c2%a0%c2%a0%c2%a0%c2%a0%c2%a0%c2%a0%c2%a0%c2%a0%c2%a0%c2%a0%c2%a0%c2%a0%c2%a0%c2%a0%c2%a0%c2%a0
      *****************************************************************************

      ** Track 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 wide 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.

      ** Scope **

      The Evolutionary Combinatorial Optimization and Metaheuristics (ECOM)
      Track welcomes submissions of original and unpublished work concerning
      applications or the theory of all kinds of metaheuristics for
      combinatorial optimization problems. Topics include (but are not
      limited to):


         * Applications of metaheuristics to combinatorial optimization problems
           including multi-objective, stochastic and dynamic problems.
         * In-depth experimental analysis and comparisons of metaheuristics or exact methods
         * Theoretical developments in combinatorial optimization and metaheuristics
         * Engineering of metaheuristic algorithms and automatic configuration
         * 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

      Each paper will be rigorously evaluated in a double-blind review process.
      All accepted papers will appear in the proceedings of GECCO 2014,
      which will be published by ACM (Association for Computing Machinery).

      ** Important Dates **

        January 15, 2014  - Abstract submission
        January 29, 2014  - Submission of full papers (strict, non-extensible deadline)
        March 12, 2014    - Notification of paper acceptance
        April 14, 2014    - Camera ready submission
        July 12-16, 2014  - GECCO 2014 Conference in Vancouver, Canada

      ** Track Chairs **

      Guenther Raidl    (ADS, TU Vienna, Austria) https://www.ads.tuwien.ac.at/raidl/
      Thomas Stuetzle   (IRIDIA, ULB, Belgium) http://iridia.ulb.ac.be/~stuetzle/
    Your message has been successfully submitted and would be delivered to recipients shortly.