Special Volume of the Annals of Operations Research

Adaptive Memory Programming
Methods and Algorithms for Hard Combinatorial Problems

Call for Papers [PDF Version]

Scope of the Volume

We invite research articles for a forthcoming volume of the Annals of Operations Research, on the application of adaptive memory metaheuristics to challenging combinatorial optimization problems. Potential topics include, but are not limited to, Tabu Search, Scatter Search, Path Relinking, as well as hybrid approaches including instances of Genetic Algorithms, Ant Colony Systems, Evolutionary Methods and so forth. The volume draws on the perspective that such hybrids can be usefully viewed and understood as instances of higher evolutionary methods that make use of adaptive memory1, referring to the fact that adaptive memory itself constitutes a higher product of evolution whose constituents influence the composition of lower level evolutionary structures. We also invite articles on innovative uses of mathematical programming in adaptive memory metaheuristics, as illustrated, for example, by strategies exploited in Relaxation Adaptive Memory Programming (RAMP) methods.

Important Dates

Submission deadline: March 31, 2007.
Acceptance decision: February 2008.

Author Instructions

Information about author guidelines is available at Annals of Operations Research. Additional information about the volume can be obtained from the Guest Editor.

Paper Submission

Please submit your paper in electronic form (PS or PDF) by email (subject: AOR) to the Guest Editor. All submissions will be thoroughly refereed according to the usual standards of the Annals of Operations Research.

Guest Editor

Cesar Rego
School of Business Administration
University of Mississippi
Oxford, MS 38677
E-mail: crego@bus.olemiss.edu