Please circulate this CFP among your colleagues and students.
!! Due to several requests, the submission deadline has been !!
!! extended to May 24, 2010 !!
*********************************************************************
Call for Papers
HYBRID METAHEURISTICS - HM 2010
7th International Workshop
Vienna, Austria
October 1-2, 2010
Extended submission deadline: May 24, 2010
http://www.ads.tuwien.ac.at/HM2010
*********************************************************************
Metaheuristics have received considerable interest in the fields of
applied artificial intelligence and optimization. Many hard
problems in a huge variety of areas, including bioinformatics,
logistics, engineering, business, etc., have been tackled
successfully with metaheuristic approaches. For many problems the
resulting algorithms are considered to be the state-of-the-art
methods.
In recent years it has become evident that a skilled combination of
metaheuristics with other techniques for optimization or among
themselves, a so-called hybrid metaheuristic, can provide a more
efficient behavior and a higher flexibility especially when dealing
with real-world and large-scale problems.
SCOPE AND TOPICS OF INTEREST
The HM 2010 workshop aims at papers describing good examples of
carefully designed and well-analyzed hybrid metaheuristics.
Topics of interest include, but is not limited to:
- novel combinations of components from different metaheuristics,
- hybridization of metaheuristics and AI/OR techniques,
- matheuristics,
- low-level hybridization,
- high-level hybridization, portfolio techniques, expert systems,
- cooperative search,
- automated parameter tuning,
- empirical and statistical comparison,
- theoretical aspects of hybridization,
- parallelization,
- software libraries.
PAPER SUBMISSION
Researchers are invited to submit papers of not more than 15 pages.
Authors are strongly encouraged to typeset their papers with LaTeX
and to submit them in PDF format (see Information for LNCS Authors
at www.springeronline.com).
Further information on the submission procedure is available on
the workshop website http://www.ads.tuwien.ac.at/HM2010
Every paper will be reviewed by at least two members of the program
committee. Researchers are explicitly encouraged to address
statistical validity of their results, if they compare different
approaches. Source code and problem instances, if relevant, should
be made available on the internet.
The submitted papers must be original works. Simultaneous submission
to other conferences with published proceedings is not permitted.
PROCEEDINGS
As in the previous editions of the workshop, accepted papers will be
published as a volume of the LECTURE NOTES IN COMPUTER SCIENCE series
of Springer.
IMPORTANT DATES
Extended and final submission deadline: May 24, 2010
Notification of acceptance: June 20, 2010
Camera-ready papers: July 2, 2010
Workshop: October 1-2, 2010
FURTHER REMARKS
HM 2010 shall be a non-profit workshop. The workshop fee will be kept
as low as possible.
GENERAL CHAIR
Guenther Raidl, Vienna University of Technology, Austria
PROGRAM CO-CHAIRS
Maria J. Blesa, Universitat Politecnica de Catalunya, Spain
Christian Blum, Universitat Politecnica de Catalunya, Spain
Andrea Roli, Universita di Bologna, Italy
Michael Sampels, Universite Libre de Bruxelles, Belgium
LOCAL ORGANIZATION
Algorithms and Data Structures Group
Institute of Computer Graphics and Algorithms
Vienna University of Technology
CONTACT INFORMATION
hm2010@ads.tuwien.ac.at
http://www.ads.tuwien.ac.at/HM2010
Fax: +43/1-58801-18699
**********************************************************
*
* 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
