Volume 131, Issue 1-4 | Annals of Operations Research

Search all Annals of Operations Research articles

Volume 131, Issue 1-4

October 2004

Meta-Heuristics - Theory, Applications and Software

Issue Editors:

Ulrich Derigs,
Stefan Voss

17 articles in this issue

Preface
Ulrich Derigs
Stefan Voß
Preface Pages: 17 - 20
Density Based Problem Space Search for the Capacitated Clustering p-Median Problem
Samad Ahmadi
Ibrahim H. Osman
OriginalPaper Pages: 21 - 43
On a Local-Search Heuristic for a Class of Tracking Error Minimization Problems in Portfolio Management
Ulrich Derigs
Nils-H. Nickel
OriginalPaper Pages: 45 - 77
Pareto Ant Colony Optimization: A Metaheuristic Approach to Multiobjective Portfolio Selection
Karl Doerner
Walter J. Gutjahr
Christian Stummer
OriginalPaper Pages: 79 - 99
A Short Note on a Simple Search Heuristic for the Diskspacking Problem
Huang Wenqi
Kang Yan
OriginalPaper Pages: 101 - 108
Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design
Ilfat Ghamlouche
Teodor Gabriel Crainic
Michel Gendreau
OriginalPaper Pages: 109 - 133
A Comparative Study of Multiple-Objective Metaheuristics on the Bi-Objective Set Covering Problem and the Pareto Memetic Algorithm
Andrzej Jaszkiewicz
OriginalPaper Pages: 135 - 158
Competitive Memetic Algorithms for Arc Routing Problems
Philippe Lacomme
Christian Prins
Wahiba Ramdane-Cherif
OriginalPaper Pages: 159 - 185
GENI Ants for the Traveling Salesman Problem
François-Xavier Le Louarn
Michel Gendreau
Jean-Yves Potvin
OriginalPaper Pages: 187 - 201
TSpack: A Unified Tabu Search Code for Multi-Dimensional Bin Packing Problems
Andrea Lodi
Silvano Martello
Daniele Vigo
OriginalPaper Pages: 203 - 213
A Rollout Metaheuristic for Job Shop Scheduling Problems
Carlo Meloni
Dario Pacciarelli
Marco Pranzo
OriginalPaper Pages: 215 - 235
LSSPER: Solving the Resource-Constrained Project Scheduling Problem with Large Neighbourhood Search
Mireille Palpant
Christian Artigues
Philippe Michelon
OriginalPaper Pages: 237 - 257
Multistart Tabu Search Strategies for the Unconstrained Binary Quadratic Optimization Problem
Gintaras Palubeckis
OriginalPaper Pages: 259 - 282
An Ant Colony Optimization Algorithm for the Minimum Weight Vertex Cover Problem
Shyong Jian Shyu
Peng-Yeng Yin
Bertrand M.T. Lin
OriginalPaper Pages: 283 - 304
A Population-Based Approach to the Resource-Constrained Project Scheduling Problem
Vicente Valls
Francisco Ballestín
Sacramento Quintanilla
OriginalPaper Pages: 305 - 324
Multilevel Refinement for Combinatorial Optimisation Problems
Chris Walshaw
OriginalPaper Pages: 325 - 372
Model-Based Search for Combinatorial Optimization: A Critical Survey
Mark Zlochin
Mauro Birattari
Marco Dorigo
OriginalPaper Pages: 373 - 395