<html xmlns:v="urn:schemas-microsoft-com:vml" xmlns:o="urn:schemas-microsoft-com:office:office" xmlns:w="urn:schemas-microsoft-com:office:word" xmlns:x="urn:schemas-microsoft-com:office:excel" xmlns:m="http://schemas.microsoft.com/office/2004/12/omml" xmlns="http://www.w3.org/TR/REC-html40"><head><META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=us-ascii"><meta name=Generator content="Microsoft Word 12 (filtered medium)"><style><!--
/* Font Definitions */
@font-face
{font-family:"Cambria Math";
panose-1:2 4 5 3 5 4 6 3 2 4;}
@font-face
{font-family:Calibri;
panose-1:2 15 5 2 2 2 4 3 2 4;}
@font-face
{font-family:Consolas;
panose-1:2 11 6 9 2 2 4 3 2 4;}
/* Style Definitions */
p.MsoNormal, li.MsoNormal, div.MsoNormal
{margin:0cm;
margin-bottom:.0001pt;
font-size:11.0pt;
font-family:"Calibri","sans-serif";}
a:link, span.MsoHyperlink
{mso-style-priority:99;
color:blue;
text-decoration:underline;}
a:visited, span.MsoHyperlinkFollowed
{mso-style-priority:99;
color:purple;
text-decoration:underline;}
p.MsoPlainText, li.MsoPlainText, div.MsoPlainText
{mso-style-priority:99;
mso-style-link:"Plain Text Char";
margin:0cm;
margin-bottom:.0001pt;
font-size:10.5pt;
font-family:Consolas;}
span.EmailStyle17
{mso-style-type:personal-compose;
font-family:"Calibri","sans-serif";
color:windowtext;}
span.PlainTextChar
{mso-style-name:"Plain Text Char";
mso-style-priority:99;
mso-style-link:"Plain Text";
font-family:Consolas;}
span.EmailStyle20
{mso-style-type:personal;
font-family:"Calibri","sans-serif";
color:windowtext;}
.MsoChpDefault
{mso-style-type:export-only;}
@page WordSection1
{size:612.0pt 792.0pt;
margin:72.0pt 72.0pt 72.0pt 72.0pt;}
div.WordSection1
{page:WordSection1;}
--></style><!--[if gte mso 9]><xml>
<o:shapedefaults v:ext="edit" spidmax="1026" />
</xml><![endif]--><!--[if gte mso 9]><xml>
<o:shapelayout v:ext="edit">
<o:idmap v:ext="edit" data="1" />
</o:shapelayout></xml><![endif]--></head><body lang=EN-GB link=blue vlink=purple><div class=WordSection1><p class=MsoPlainText>[Please circulate to all those who might be interested, and accept our apologies if you received multiple copies of this announcement]<o:p></o:p></p><p class=MsoPlainText> <o:p></o:p></p><p class=MsoPlainText>---------------------------------------------------------------------------------<o:p></o:p></p><p class=MsoPlainText>11th International Conference on Applied Mathematical Optimization and Modelling <o:p></o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoPlainText>APMOD 2014<o:p></o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoPlainText><a href="http://www.apmod2014.org/">www.apmod2014.org/</a> <o:p></o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoPlainText>Warwick, United Kingdom<o:p></o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoPlainText>9-11 April, 2014<o:p></o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoPlainText>Call for Short Abstracts and Student Papers for the<o:p></o:p></p><p class=MsoPlainText>Heuristics & Metaheuristics Stream<o:p></o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoPlainText>Submission Deadline: 15 January 2014<o:p></o:p></p><p class=MsoPlainText>---------------------------------------------------------------------------------<o:p></o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoPlainText>We invite short abstracts and presentations on (meta)heuristics, either theory or practice-oriented, preferably on real world applications. <o:p></o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoPlainText>We are open to all contributions on heuristics and metaheuristics. We are particularly interested in those that lead to some general insight or are potentially relevant to more than one application area. We take a very broad definition of metaheuristics, for example simulated annealing, tabu search, but also evolutionary algorithms, multi-meme algorithms, adaptive operator selection, hyper-heuristics, dynamic algorithm portfolios, reactive search, particle swarm and others. Topics of interest include (but are not limited to):<o:p></o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoPlainText>* (meta)heuristics for combinatorial optimisation problems<o:p></o:p></p><p class=MsoPlainText>* (meta)heuristics for multi-objective, discrete and continuous optimisation<o:p></o:p></p><p class=MsoPlainText>* (meta)heuristics for dynamic environments<o:p></o:p></p><p class=MsoPlainText>* (meta)heuristics to generate (create) heuristics (e.g., generation<o:p></o:p></p><p class=MsoPlainText>hyper-heuristics)<o:p></o:p></p><p class=MsoPlainText>* (meta)heuristics to choose heuristics (e.g., selection hyper-heuristics)<o:p></o:p></p><p class=MsoPlainText>* self adaptive (meta)heuristics<o:p></o:p></p><p class=MsoPlainText>* (meta)heuristics based on machine learning<o:p></o:p></p><p class=MsoPlainText>* hybrids of (meta)heuristics with exact methods such as mathematical or constraint programming<o:p></o:p></p><p class=MsoPlainText>* (automated) parameter tuning in (meta)heuristics<o:p></o:p></p><p class=MsoPlainText>* software tools (e.g., ECJ, HeuristicLab, Hyflex)<o:p></o:p></p><p class=MsoPlainText>* distributed/parallel frameworks<o:p></o:p></p><p class=MsoPlainText>* applications of (meta)heuristics to new challenging domains<o:p></o:p></p><p class=MsoPlainText>* analytical or semi-empirical studies of (meta)heuristics (e.g., landscape analysis)<o:p></o:p></p><p class=MsoPlainText>* performance prediction<o:p></o:p></p><p class=MsoPlainText>* performance robustness<o:p></o:p></p><p class=MsoPlainText>* scalability issues<o:p></o:p></p><p class=MsoPlainText>* barriers to uptake of (meta)heuristics in industry<o:p></o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoPlainText>The winners of the 2nd Cross-domain Heuristic Search Challenge (CHeSC 2014) will be announced in this stream: <a href="http://www.hyflex.org/chesc2014/">www.hyflex.org/chesc2014/</a><o:p></o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoPlainText>The stream will provide an opportunity for constructive exchange of ideas on (meta)heuristics and their applications to real world problems. If you would like to give a talk in this stream, please submit a title and abstract of no more than 300 words via<o:p></o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoPlainText><a href="http://www.easychair.org/conferences/?conf=apmodconference2014">www.easychair.org/conferences/?conf=apmodconference2014</a><o:p></o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoPlainText>by selecting “Heuristics & Metaheuristics” from the topics.<o:p></o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoPlainText>The APMOD 2014 conference also awards a prize for the best student paper needing a full paper submission to any of the streams. Please read the following page for more details including the eligibility criteria:<o:p></o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoPlainText><a href="http://www2.warwick.ac.uk/fac/soc/wbs/conf/apmod2014/callforpapers/">www2.warwick.ac.uk/fac/soc/wbs/conf/apmod2014/callforpapers/</a> <o:p></o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoPlainText>Papers presented at the conference will be considered for publication in the ANNALS OF OPERATIONS RESEARCH.<o:p></o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoPlainText>If you have any questions, please do not hesitate to contact us.<o:p></o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoPlainText>Stream Organisers<o:p></o:p></p><p class=MsoPlainText>Ender Ozcan and Andrew J. Parkes<o:p></o:p></p><p class=MsoPlainText>{Ender.Ozcan, Andrew.Parkes} (a_t) Nottingham . Ac . UK<o:p></o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoPlainText><o:p> </o:p></p><p class=MsoNormal><o:p> </o:p></p><p class=MsoNormal><o:p> </o:p></p></div></body></html>