Evolutionary Computation in Combinatorial Optimization 2007 (EvoCOP 2007)

Venue: Campus of the Universidad Politécnica de Valencia

Location: Valencia, Spain

Event Date/Time: Apr 11, 2007 End Date/Time: Apr 13, 2007
Registration Date: Apr 01, 2007
Early Registration Date: Mar 01, 2007
Paper Submission Date: Nov 01, 2006
Report as Spam


EvoCOP 2007 - Seventh European Conference on Evolutionary Computation in Combinatorial Optimisation

Metaheuristics have often been shown to be effective for difficult combinatorial optimization problems appearing in various industrial, economical, and scientific domains. Prominent examples of metaheuristics are evolutionary algorithms, simulated annealing, tabu search, scatter search, memetic algorithms, variable neighborhood search, iterated local search, greedy randomized adaptive search procedures, estimation of distribution algorithms and ant colony optimization. Successfully solved problems include scheduling, timetabling, network design, transportation and distribution problems, vehicle routing, traveling salesperson, graph problems, satisfiability, packing problems, planning problems, and general mixed integer programming.

The EvoCOP series, started in 2001 and held annually since then, was the first event specifically dedicated to the application of evolutionary computation and related methods to combinatorial optimization problems. Following the general trend of hybrid metaheuristics and diminishing boundaries between the different classes of metaheuristics, EvoCOP has broadened its scope and now explicitly invites submissions on any kind of metaheuristic for combinatorial optimization.

The past events gave researchers a good opportunity to present their latest research and to discuss current developments and applications, besides stimulating closer future interaction between members of this scientific community.

EvoCOP 2007 wants to bring researchers in the field of metaheuristics together once again. Each accepted papers will be presented orally at the conference and printed in the proceedings published by Springer in the LNCS series (see LNCS volumes 2037, 2279, 2611, 3004, 3448 and 3906 for the previous proceedings).

Topics include

  • Applications of metaheuristics to combinatorial optimization problems
  • Representation techniques
  • Neighborhoods and efficient algorithms for searching them
  • Variation operators for stochastic search methods
  • Constraint-handling techniques
  • Hybrid methods and hybridization techniques

  • Parallelization
  • Theoretical developments
  • Search space analyses
  • Comparisons between different (also exact) techniques