Metaheuristics in Combinatorial Optimization
The emergence of metaheuristics for solving difficult combinatorial optimization problems is one of the most notable achievements of the last two decades in operations research. This paper provides an account of the most recent developments in the field and identifies some common issues and trends....
Gespeichert in:
Veröffentlicht in: | Annals of operations research 2005-11, Vol.140 (1), p.189-213 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | The emergence of metaheuristics for solving difficult combinatorial optimization problems is one of the most notable achievements of the last two decades in operations research. This paper provides an account of the most recent developments in the field and identifies some common issues and trends. Examples of applications are also reported for vehicle routing and scheduling problems. [PUBLICATION ABSTRACT] |
---|---|
ISSN: | 0254-5330 1572-9338 |
DOI: | 10.1007/s10479-005-3971-7 |