JiscMail Logo
Email discussion lists for the UK Education and Research communities

Help for META-HEURISTICS Archives


META-HEURISTICS Archives

META-HEURISTICS Archives


META-HEURISTICS@JISCMAIL.AC.UK


View:

Message:

[

First

|

Previous

|

Next

|

Last

]

By Topic:

[

First

|

Previous

|

Next

|

Last

]

By Author:

[

First

|

Previous

|

Next

|

Last

]

Font:

Proportional Font

LISTSERV Archives

LISTSERV Archives

META-HEURISTICS Home

META-HEURISTICS Home

META-HEURISTICS  October 2012

META-HEURISTICS October 2012

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

EvoCOP 2013 -- submission deadline extension

From:

Christian Blum <[log in to unmask]>

Reply-To:

Christian Blum <[log in to unmask]>

Date:

Mon, 29 Oct 2012 15:52:49 +0100

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (126 lines)

Please note: The deadline for paper submissions has been extended to **
November 11, 2012 **
Note also that no further deadline extensions will be granted.

** Apologies for multiple copies **

----------------------------------------------------------------

EvoCOP 2013 - 13th European Conference on Evolutionary Computation in
Combinatorial Optimisation

3th - 5th April, 2012
Vienna, Austria

Part of EVO* 2013 (http://www.evostar.org) including: EuroGP, EvoCOP,
EvoBIO, EvoMUSART and EvoApplications


The 13th European Conference on Evolutionary Computation in
Combinatorial Optimisation is a multidisciplinary conference that brings
together researchers working on metaheuristics that are used to solve
difficult combinatorial optimization problems appearing in various
industrial, economic, and scientific domains. Prominent examples of
metaheuristics include: evolutionary algorithms, simulated annealing,
tabu search, scatter search and path relinking, memetic algorithms, ant
colony and bee colony optimization, particle swarm optimization,
variable neighbourhood search, iterated local search, greedy randomized
adaptive search procedures, estimation of distribution algorithms, and
hyperheuristics. Successfully solved problems include scheduling,
timetabling, network design, transportation and distribution problems,
vehicle routing, travelling salesman, graph problems, satisfiability,
energy optimization problems, packing problems, planning problems, and
general mixed integer programming.

The EvoCOP 2013 conference will be held in Vienna, Austria. The
conference will be held in conjunction with EuroGP (the 16th European
Conference on Genetic Programming), EvoBio (the 11th European Conference
on Evolutionary Computation, Machine Learning and Data Mining in
Computational Biology), EvoMUSART (11th European conference on
evolutionary and biologically inspired music, sound, art and design) and
EvoApplications (specialist events on a range of evolutionary
computation topics and applications), in a joint event collectively
known as EVO*.

For more information see the EvoCOP 2013 webpage
http://www.evostar.org/


Areas of Interest and Contributions

Topics of interest include, but are not limited to:


    Applications of metaheuristics to combinatorial optimization problems
    Novel application domains for metaheuristic optimisation methods
    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 and landscape analyses
    Comparisons between different (also exact) techniques
    Metaheuristics and machine learning
    Ant colony optimisation
    Artificial immune systems
    Bee colony optimization
    Genetic programming and Genetic algorithms
    (Meta-)heuristics
    Scatter search
    Particle swarm optimisation
    Tabu search, iterated local search and variable neighborhood search
    Memetic algorithms and hyperheuristics
    Estimation of distribution algorithms
    String processing
    Scheduling and timetabling
    Network design
    Vehicle routing
    Graph problems
    Satisfiability
    Packing and cutting problems
    Energy optimization problems
    Practical solving of NP-hard problems
    Mixed integer programming
    Multi-objective optimisation
    Grid computing
    Combinatorial optimisation
    Nature and Bio-inspired methods
    Quantum computing and quantum annealing
    Optimization in Cloud computing

Publication Details

All 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, 3906, 4446, 4972, 5482, 6022,
6622, and 7245 for the previous proceedings).

Submission Details

Submissions must be original and not published elsewhere. The
submissions will be peer reviewed by at least three members of the
program committee. The authors of accepted papers will have to improve
their paper on the basis of the reviewers comments and will be asked to
send a camera ready version of their manuscripts. At least one author of
each accepted work has to register for the conference, attend the
conference and present the work.

The reviewing process will be double-blind, please omit information
about the authors in the submitted paper. Submit your manuscript in
Springer LNCS format.

Submission link: http://myreview.csregistry.org/evocop13/
Page limit: 12 pages

Important Dates
Submission deadline: 11. November 2012
EVO* event: 3-5 April 2013

Programme Chairs
Martin Middendorf (University of Leipzig, Germany)   
 middendorf(at)informatik.uni-leipzig.de
Christian Blum (Ikerbasque, Basque Foundation for Science, Spain)   
 christian.c.blum(at)gmail.com

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

April 2024
March 2024
February 2024
January 2024
December 2023
November 2023
October 2023
September 2023
August 2023
July 2023
June 2023
May 2023
April 2023
March 2023
February 2023
January 2023
December 2022
November 2022
October 2022
September 2022
August 2022
July 2022
June 2022
May 2022
April 2022
March 2022
February 2022
January 2022
December 2021
November 2021
October 2021
September 2021
August 2021
July 2021
June 2021
May 2021
April 2021
March 2021
February 2021
January 2021
December 2020
November 2020
October 2020
September 2020
August 2020
July 2020
June 2020
May 2020
April 2020
March 2020
February 2020
January 2020
December 2019
November 2019
October 2019
September 2019
August 2019
July 2019
June 2019
May 2019
April 2019
March 2019
February 2019
January 2019
December 2018
November 2018
October 2018
September 2018
August 2018
July 2018
June 2018
May 2018
April 2018
March 2018
February 2018
January 2018
December 2017
November 2017
October 2017
September 2017
August 2017
July 2017
June 2017
May 2017
April 2017
March 2017
February 2017
January 2017
December 2016
November 2016
October 2016
September 2016
August 2016
July 2016
June 2016
May 2016
April 2016
March 2016
February 2016
January 2016
December 2015
November 2015
October 2015
September 2015
August 2015
July 2015
June 2015
May 2015
April 2015
March 2015
February 2015
January 2015
December 2014
November 2014
October 2014
September 2014
August 2014
July 2014
June 2014
May 2014
April 2014
March 2014
February 2014
January 2014
December 2013
November 2013
October 2013
September 2013
August 2013
July 2013
June 2013
May 2013
April 2013
March 2013
February 2013
January 2013
December 2012
November 2012
October 2012
September 2012
August 2012
July 2012
June 2012
May 2012
April 2012
March 2012
February 2012
January 2012
December 2011
November 2011
October 2011
September 2011
August 2011
July 2011
June 2011
May 2011
April 2011
March 2011
February 2011
January 2011
December 2010
November 2010
October 2010
September 2010
August 2010
July 2010
June 2010
May 2010
April 2010
March 2010
February 2010
January 2010
December 2009
November 2009
October 2009
September 2009
August 2009
July 2009
June 2009
May 2009
April 2009
March 2009
February 2009
January 2009
December 2008
November 2008
October 2008
September 2008
August 2008
July 2008
June 2008
May 2008
April 2008
February 2008
January 2008
December 2007
November 2007
October 2007
September 2007
August 2007
July 2007
June 2007
May 2007
April 2007
March 2007
February 2007
January 2007
2006
2005
2004
2003
2002
2001


JiscMail is a Jisc service.

View our service policies at https://www.jiscmail.ac.uk/policyandsecurity/ and Jisc's privacy policy at https://www.jisc.ac.uk/website/privacy-notice

For help and support help@jisc.ac.uk

Secured by F-Secure Anti-Virus CataList Email List Search Powered by the LISTSERV Email List Manager