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  July 2018

META-HEURISTICS July 2018

Options

Subscribe or Unsubscribe

Subscribe or Unsubscribe

Log In

Log In

Get Password

Get Password

Subject:

CfP: EvoCOP 2019, held as part of EvoStar (submission deadline: November 1, 2018)

From:

Luís Paquete <[log in to unmask]>

Reply-To:

Luís Paquete <[log in to unmask]>

Date:

Mon, 23 Jul 2018 16:01:11 +0100

Content-Type:

text/plain

Parts/Attachments:

Parts/Attachments

text/plain (170 lines)

************************************************************************
              EvoCOP 2019 - The 19th European Conference on
         Evolutionary Computation in Combinatorial Optimisation
               http://www.evostar.org/2019/cfp_evocop.php

                        April 24 - April 26, 2019
                            Leipzig, Germany

            held as part of EvoStar (http://www.evostar.org)
************************************************************************

The 19th European Conference on Evolutionary Computation in Combinatorial
Optimisation is a multidisciplinary conference that brings together researchers
working on evolutionary computation methods and other metaheuristics for
solving difficult combinatorial optimisation problems appearing in various
industrial, economic, and scientific domains. Prominent examples of
metaheuristics include: evolutionary algorithms, estimation of distribution
algorithms, swarm intelligence methods such as ant colony and particle swarm
optimisation, local search methods such as simulated annealing, tabu search,
variable neighbourhood search, iterated local search, scatter search and path
relinking, and their hybridisation, such as memetic algorithms. Automatic
algorithm configuration and design, meta-optimisation, model-based methods, and
hyperheuristics are also topics of interest. Successfully solved problems
include, but are not limited to, multi-objective, uncertain, dynamic and
stochastic problems in the context of scheduling, timetabling, network design,
transportation and distribution, vehicle routing, graph problems,
satisfiability, energy optimisation, cutting, packing, and planning problems.


The EvoCOP 2019 conference will be held in the city of Leipzing, Germany,
together with EuroGP (the 22nd European Conference on Genetic Programming),
EvoMUSART (the 8th European conference on evolutionary and biologically inspired
music, sound, art and design) and EvoApplications (the 22nd European Conference
on the Applications of Evolutionary Computation), in a joint event collectively
known as EvoStar (Evo*).


**** Areas of Interest and Contributions ****

Topics of interest include, but are not limited to:

 * Applications of metaheuristics to combinatorial optimisation problems
 * Representation techniques
 * Practical solution of NP-hard problems
 * Neighbourhoods and efficient algorithms for searching them
 * Variation operators for stochastic search methods
 * Theoretical developments
 * Constraint-handling techniques
 * Parallelisation and grid computing
 * Search space and landscape analyses
 * Comparisons between different (also exact) methods
 * Heuristics
 * Genetic programming and Genetic algorithms
 * Tabu search, iterated local search and variable neighbourhood search
 * Ant colony optimisation
 * Artificial immune systems
 * Scatter search
 * Particle swarm optimisation
 * Memetic algorithms
 * Hybrid methods and hybridisation techniques
 * Matheuristics (hybrids of exact and heuristic methods)
 * Hyper-heuristics and autonomous search
 * Automatic algorithm configuration and design
 * Metaheuristics and machine learning
 * Surrogate-model-based methods
 * Estimation of distribution algorithms
 * String processing
 * Scheduling and timetabling
 * Network design
 * Vehicle routing
 * Graph problems
 * Satisfiability
 * Packing and cutting problems
 * Energy optimisation problems
 * Multi-objective optimisation
 * Search-based software engineering

Notice that, by tradition, continuous/numerical optimisation is *not* part of
the topics of interest of EvoCOP. Interested authors might consider submitting
to other EvoStar conferences such as EvoApplications.


**** Publication Details ****

EvoCOP 2019 will accept three types of submissions:

 * Regular 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, 7245, 7832, 8600,
9026, 9595, 10197 and 10782 for the previous proceedings).

The best regular paper presented at EvoCOP 2019 will be distinguished with a
*Best Paper Award*. Authors nominated for the best regular paper award will be
invited for fast track publication in the *Evolutionary Computation Journal*.
The invited submissions must significantly extend the conference paper and will
undergo peer review.

 * Reproducibility studies are concise and rigorous experimental studies that
replicate published experiments, and that substantially shift the confidence in
the main results of the original study. We strongly encourage the authors to
discuss the reasons for the new findings, such as, e.g., input data not
considered in the original work or different implementation details.
A reproducibility study should follow the usual reproducibility standards, that
is, it should provide complete details about the implementation, compiler
options, input data description, algorithmic parameters, operating system and
hardware specification.  Moreover, the code should be available in a public
repository immediately after the submission to EvoCOP and should remain
available after publication in the proceedings. Statistical analysis, if
applicable, should provide details about the statistical assumptions and
statistical testing procedures.  Although it is expected that textual
similarity between the reproducibility study and the original work may arise,
the usual plagiarism standards will be taken into account.  Reproducibility
studies will take the form of short papers presented orally at the conference
and published in the Springer LNCS proceedings.

 * Late-breaking abstracts (LBAs) summarise ongoing research, recent studies and
applications of evolutionary computation and other meta-heuristics to real-world
or academic combinatorial optimisation problems. LBAs will be presented as short
talks during the conference.


**** Submission Details ****

Paper submissions must be original and not published elsewhere. The submissions
will be peer reviewed by 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.

Page limit (Regular papers): 16 pages
Page limit (Reproducibility studies): 8 pages
Page limit (LBAs): 1-2 pages



**** Important Dates ****

Submission deadline (Regular papers, Reproducibility studies): November 1, 2018
Submission deadline (LBAs): TBA
EvoStar: April 24-26, 2019


**** EvoCOP Programme Chairs ****

    Arnaud Liefooghe
    University of Lille, France
    [log in to unmask]

    Luís Paquete
    University of Coimbra, Portugal
    [log in to unmask]





-- 
Luís Paquete | [log in to unmask]
http://www.uc.pt/go/paquete
Dept. of Informatics Engineering
University of Coimbra, Portugal

########################################################################

To unsubscribe from the META-HEURISTICS list, click the following link:
https://www.jiscmail.ac.uk/cgi-bin/webadmin?SUBED1=META-HEURISTICS&A=1

Top of Message | Previous Page | Permalink

JiscMail Tools


RSS Feeds and Sharing


Advanced Options


Archives

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

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