Metaheuristics in combinatorial optimization

Metaheuristics in combinatorial optimization

0.00 Avg rating0 Votes
Article ID: iaor20061800
Country: Netherlands
Volume: 140
Issue: 1
Start Page Number: 189
End Page Number: 213
Publication Date: Nov 2005
Journal: Annals of Operations Research
Authors: ,
Keywords: vehicle routing & scheduling, combinatorial analysis
Abstract:

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.

Reviews

Required fields are marked *. Your email address will not be published.