dmanet@zpr.uni-koeln.de
To subscribe or unsubscribe via the World Wide Web, visit
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
or, via email, send a message with subject or body 'help' to
dmanet-request@zpr.uni-koeln.de
You can reach the person managing the list at
dmanet-owner@zpr.uni-koeln.de
When replying, please edit your Subject line so it is more specific
than "Re: Contents of dmanet digest..."
Today's Topics:
1. CFP - Special issue on "Metaheuristics and Hybrid Methods for
Combinatorial Optimization Problems" (Jingpeng Li)
2. Call for Workshop Proposals affiliated with ICALP 2016
(Irene Finocchi)
----------------------------------------------------------------------
Message: 1
Date: Mon, 16 Nov 2015 16:54:23 +0000
From: Jingpeng Li <jli@cs.stir.ac.uk>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] CFP - Special issue on "Metaheuristics and Hybrid
Methods for Combinatorial Optimization Problems"
Message-ID: <564A0A3F.8000907@cs.stir.ac.uk>
Content-Type: text/plain; charset=utf-8; format=flowed
***********************************************************************************************
* CALL FOR PAPERS
* Journal of Mathematics
* Special issue on "Metaheuristics and Hybrid Methods for Combinatorial Optimization Problems"
*http://www.hindawi.com/journals/jmath/si/901960/cfp/
***********************************************************************************************
Submission deadline: Friday, 27 November 2015
Optimization problems can be divided into two categories: the first category consists of problems with continuous variables and the second category consists of problems with discrete variables. Among the latter ones, there are a class of problems called combinatorial optimization problems, in which we are looking for the best possible solution from a finite set of discrete decision variables subject to a set of constraints among variables, and this solution may typically be an integer number, a permutation, a subset, or a graph structure.
Combinatorial optimization has important applications in various fields including computer science, management, and engineering. Many such problems (e.g., traveling salesman problems, maximum satisfiability problems, timetabling problems, and scheduling and rostering problems) cannot be solved exactly within reasonable time limits due to the problem instance sizes of practical interest. To achieve a trade-off between solution quality and search completeness, metaheuristic approaches have therefore been widely studied and can be applied, with suitable modifications, to a broad class of combinatorial optimization problems. Some well-known examples of metaheuristics include genetic algorithms, memetic algorithms, ant colony optimization, estimation of distribution algorithms, particle swarm optimisation, stochastic local search, GRASP, simulated annealing, tabu search, and variable neighbourhood search.
The purpose of this special issue is to provide a premier forum for researchers to disseminate their high quality and original research results on all kinds of metaheuristics for combinatorial problems either in an application perspective or from a theoretical sense.
Potential topics include, but are not limited to:
- Applications of metaheuristics to combinatorial optimization problems
- In-depth experimental analysis and comparisons between different techniques
- Neighborhoods and efficient algorithms for searching them
- Hybrid methods (e.g., memetic computing, matheuristics, hyperheuristics)
- Meta-analytics and search space landscape analyses
- Theoretical studies of metaheuristics
- Representation techniques
- Multiobjective combinatorial optimization
- Constraint-handling techniques in metaheuristics
- Automated tuning of metaheuristics
- Automated design of metaheuristics
Authors can submit their manuscripts via the Manuscript Tracking System athttp://mts.hindawi.com/submit/journals/jmath/operations.research/mmcop/
IMPORTANT DATES:
- Manuscript Due Friday, 27 November 2015
- First Round of Reviews Friday, 19 February 2016
- Publication Date Friday, 15 April 2016
Lead Guest Editor:
Jingpeng Li, University of Stirling, Stirling, UK
Guest Editors:
Jun He, Aberystwyth University, Aberystwyth, UK
Hugo Terashima-Marín, Tecnológico de Monterrey, Monterrey, Mexico
Yindong Shen, Huazhong University of Science and technology, Wuhan, China
------------------------------
Message: 2
Date: Tue, 17 Nov 2015 12:30:41 +0100
From: Irene Finocchi <finocchi@di.uniroma1.it>
To: dmanet@zpr.uni-koeln.de
Subject: [DMANET] Call for Workshop Proposals affiliated with ICALP
2016
Message-ID:
<CA+iZuiXmM5uH8CHq0hxgjyReYvcXSPpKF+gpup4FJAStRUuf-A@mail.gmail.com>
Content-Type: text/plain; charset=UTF-8
Call for Workshops Proposals affiliated with ICALP 2016
July 11-15, 2016, Rome, Italy
Workshop proposals are solicited for ICALP 2016. A workshop may relate to
any of the three tracks of ICALP, but proposals related to all aspects of
theoretical computer science will be considered as well.
ICALP workshops typically feature a number of invited speakers and a number
of contributed presentations. Workshops will be held on the first day of
the conference (July 11, 2016) and will have a duration of at most one day.
Workshop proposals should be no longer than two pages and should include:
- title of the workshop;
- person(s) responsible for the workshop (name and email address);
- a short scientific summary and justification of the proposed topic. This
should include a discussion of the particular benefits of the topic to the
ICALP community;
- the proposed format and agenda;
- procedures for selecting participants and papers;
- expected number of participants.
Proposals should be sent in pdf format to icalp2016@di.uniroma1.it
Important dates
Submission due: December 20, 2015
Notifications: January 10, 2016
Final program due: 15 May 15, 2016
Further information
We provide the following aspects of the workshop organisation:
- registration;
- wireless network, conference rooms, etc. (as for ICALP);
- a link to the web page of the workshop;
- local support and organization.
We do not provide:
- management of any scientific aspects of the workshop program (the
workshop organizers are responsible for call for papers, call for
participation, notification, program, workshop webpage, publication of
workshop proceedings or journal special issues, etc.);
- publicity for the workshop.
------------------------------
Subject: Digest Footer
_______________________________________________
dmanet mailing list
dmanet@zpr.uni-koeln.de
http://www.zaik.uni-koeln.de/mailman/listinfo/dmanet
------------------------------
End of dmanet Digest, Vol 93, Issue 15
**************************************
No comments:
Post a Comment