Call for Papers
***** SUBMISSION DEADLINE EXTENDED TO March 23, 2007 *****
Workshop Announcement and Call for Participation
Workshop on
EVOLUTIONARY ALGORITHMS
FOR
DYNAMIC OPTIMIZATION PROBLEMS
(EvoDOP-2007)
http://homepages.cwi.nl/~bosman/evodop2007/
to be held as part of the
2007 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE (GECCO-2007)
July 07-11, 2007 (Saturday-Wednesday)
University College London
London, England
Organized by ACM SIG-EVO
www.sigevo.org/gecco-2007
PAPER SUBMISSION DEADLINE FOR WORKSHOP: March 23, 2007
TOPIC
=====
Many real-world optimization problems are dynamic. New jobs are to be
added to a schedule, the quality of the raw material may be changing, new
orders have to be included into the routing of a fleet of vehicles, etc.
In such cases, when the problem changes over the course of the optimization,
the purpose of the optimization algorithm changes from finding an optimal
solution to being able to continuously track the movement of the optimum
through time. Since in a sense natural evolution is a process of continuous
adaptation, it seems straightforward to consider evolutionary algorithms as
appropriate candidates for dynamic optimization problems.
And indeed, several attempts have been made to modify evolutionary
algorithms, to tune them for optimization in a changing environment. It was
observed in all these studies, that the dynamic environment requires the
evolutionary algorithm to maintain sufficient diversity for a continuous
adaptation to the changes of the landscape. The following basic strategies
for modifying the evolutionary algorithm can be identified:
- identify the occurrence of a change in the environment and then
deliberately increase diversity in the population e.g. by means
of increased mutation
- try to avoid convergence all the time, e.g. by including new random
individuals in the population in every generation
- supply the EA with a memory, e.g. by using diploidy or an explicit
memory, so that the EA can recall useful information from past
generations.
More recent developments in the area include the use of anticipation, the
role of flexibility, and multi-criteria aspects.
The goal of this workshop is to foster interest in the important subject
of evolutionary algorithms for dynamic optimization problems, get together
the researchers working on this topic, and to discuss recent trends in the
area.
SUBMITTING TO EvoDOP-2007
========================
The workshop will feature a series of selected presentations. To submit
your contribution, send your ACM-formatted paper in Postscript or PDF
by e-mail to Peter A.N. Bosman at Peter.Bosman@cwi.nl. Papers should not
exceed the limit of 8 pages and must meet with deadline of the workshop
(see important dates for details). In case you can not submit your paper
electronically, please contact one of the workshop chairs.
Please note that all contributions must abide ACM formatting rules because
all contributions will be on the conference CD as well as in the ACM digital
library. Failing to comply with the ACM formatting rules will result in
exclusion from the proceedings. For formatting details, visit
http://www.sigevo.org/gecco-2007/papers.html.
IMPORTANT DATES FOR EvoDOP-2007
==============================
March 23, 2007: Paper submission deadline
April 03, 2007: Notification of acceptance
April 11, 2007: Camera-ready copy deadline
WEBSITE
=======
The workshop program and further information can be found online. Please
check http://homepages.cwi.nl/~bosman/evodop2007/ regularly for the latest
information. In case you have any questions, please contact one of the
workshop organizers.
We are looking forward to meeting you at EvoDOP-2007!
WORKSHOP ORGANIZERS
===================
Dr. Peter A.N. Bosman
Centre for Mathematics and Computer Science
Theme of Computational Intelligence and Multi-Agent Games
E-mail: Peter.Bosman @ cwi.nl
Dr. Jürgen Branke
Universität Karlsruhe
Institute for Applied Computer Science and Formal Descriptiom Methods (AIFB)
E-mail: branke @ aifb.uni-karlsruhe.de
