EuroGP2001 18-20 April 2001
Lake Como (Milan), Italy
home | post conference information | papers | EvoWorkshops | committees   





EvoCOP2001 - Call for papers

First European Workshop on Evolutionary Computation in Combinatorial Optimization

Evolutionary algorithms have often been shown to be effective for difficult combinatorial optimization problems appearing in various industrial, economical, and scientific domains. Prominent examples of such problems are transportation problems, traveling salesperson, satisfiability, packing, network design, or general mixed integer programming. EvoCOP is the first European event specifically dedicated to the application of evolutionary computation to combinatorial optimization problems and gives researchers in those fields an opportunity to present their latest research and to discuss current developments and applications, besides stimulating closer future interaction between members of this scientific community.

The workshop is sponsored by EvoNet, the Network of Excellence in Evolutionary Computing, and will be held in conjunction with EuroGP2001, the European Conference on Genetic Programming (April 18-20), as part of EvoWorkshops2001. EvoCOP will tak place on the 18th and 19th of April.

Topics of interest include, but are not limited to:

  • Applications of evolutionary algorithms and related heuristics such as simulated annealing or ant systems to combinatorial optimization problems
  • Representation techniques
  • Evolutionary operators
  • Constraint-handling techniques
  • Hybrid methods
  • Parallelization
  • Theoretical developments, search space analyses
  • Comparisons between different (also non-evolutionary) techniques

Accepted papers

Abstracts for accepted EvoCOP papers are available

Authors Title
Session: Graph Problems
T. Gaube, F. Rothlauf The Link and Node Biased Encoding Revisited: Bias and Adjustment of Parameters
Y. Li An Effective Implementation of a Direct Spanning Tree Representation in GAs
I. Ljubic, G. R. Raidl An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation Problem
Session: Knapsack Problems
P. Chardaire, G. P. McKeown, J. A. Maki Application of GRASP to the Multiconstraint Knapsack Problem
J. Levenhagen, A. Bortfeldt, H. Gehring Path Tracing in Genetic Algorithms Applied to the Multiconstrained Knapsack Problem
J. Gottlieb On the Feasibility Problem of Penalty-Based Evolutionary Algorithms for Knapsack Problems
Session: Ant Algorithms
R. Cordone, F. Maffioli Coloured Ant System and Local Search to Design Local Telecommunication Networks
K. Doerner, R. F. Hartl, M. Reimann Cooperative Ant Colonies for Optimizing Resource Allocation in Transportation
V. Maniezzo, A.Carbonaro, M.Golfarelli, S.Rizzi An ANTS Algorithm for Optimizing the Materialization of Fragmented Views in Data Warehouses: Preliminary Results
Session: Miscellaneous Applications
I. Meents A Genetic Algorithm for the Group-Technology Problem
S. Gregori, R. Rossi, G. Torelli, V. Liberali Generation of Optimal Unit Distance Codes for Rotary Encoders through Simulated Evolution
J. Poland, K. Knodler, A. Zell On the Efficient Construction of Rectangular Grids from Given Data Points
Session: Assignment Problems
D. A. Fotakis, S. D. Likothanassis, S. K. Stefanakos An Evolutionary Annealing Approach to Graph Coloring
G. Filho, L. Lorena A Constructive Evolutionary Approach to School Timetabling
B. Weinberg, V. Bachelet, E.-G. Talbi A Co-Evolutionist Meta-Heuristic for the Assignment of the Frequencies in Cellular Networks
D.-R. Din, S.-S. Tseng A Simulated Annealing Algorithm for Extended Cell Assignment Problem in a Wireless ATM Network
Session: Analysis of Evolutionary Algorithms
P. A. Borisovsky, A. V. Eremeev On Performance Estimates for Two Evolutionary Algorithms
R. Lehn, P. Kuntz A Contribution to the Study of the Fitness Landscape for a Graph Drawing Problem
M. Pelillo Evolutionary Game Dynamics in Combinatorial Optimization: An Overview
Session: Permutation Problems
R. Baraglia, J. I. Hidalgo, R. Perego A Parallel Hybrid Heuristic for the TSP
E. K. Burke, P. I. Cowling, R. Keuthen Effective Local and Guided Variable Neighbourhood Search Methods for the Asymmetric Travelling Salesman Problem
M. Guntsch, M. Middendorf Pheromone Modification Strategies for Ant Algorithms applied to Dynamic TSP
S. Esquivel, C. Gatica, R. Gallard Conventional and Multirecombinative Evolutionary Algorithms for the Parallel Task Scheduling Problem

Organizing Commitee

EvoCOP chairs

Programme committee

  • Edmund Burke
  • Jie Cheng
  • David Corne
  • Carlos Cotta-Porras
  • Peter Cowling
  • David Fogel
  • Jin-Kao Hao
  • Michiel de Jong
  • Bryant Julstrom
  • Dimitri Knjazew
  • Joshua Knowles
  • Gabriele Kodydek
  • Jozef Kratica
  • Yu Li
  • Ivana Ljubic
  • Elena Marchiori
  • Dirk Mattfeld
  • Zbigniew Michalewicz
  • Georgios Papadimitriou
  • Colin Reeves
  • Claudio Rossi
  • Franz Rothlauf
  • Thomas Stützle
  • Christine Valenzuela

EvoWorkshops chair

Local chairs


To submit, send your manuscript (max length 10 A4 pages, Postscript or PDF format) to the programme co-chair by email to no later than November 16, 2000. The papers will be peer reviewed by at least two members of the program committee. Authors will be notified via email on the results of the review by December 20, 2000.

The authors of accepted papers will be asked to improve their paper on the basis of the reviewers' comments and will be asked to send a camera ready version of their manuscripts by January 25, 2001.

Papers will appear in the EvoWorkshops2001 proceedings to be published by Springer-Verlag in the LNCS series, formatting instructions for which can be found at As with previous years the proceedings will be published both in book form and electronically. Therefore accepted camera ready papers must be accompanied by electronic (machine readable) source documents.

By submitting a camera-ready paper, the author(s) agree that at least one author will attend and present each accepted paper at the workshop.

Web site designed and maintained by Chris Osborne at EvoNet.