Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Metaheuristics in Combinatorial Optimization

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. Examples of applications are also reported for vehicle routing and scheduling problems. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Annals of Operations Research Springer Journals

Metaheuristics in Combinatorial Optimization

Loading next page...
 
/lp/springer-journals/metaheuristics-in-combinatorial-optimization-uMwG0M0U0D

References (138)

Publisher
Springer Journals
Copyright
Copyright © 2005 by Springer Science + Business Media, Inc.
Subject
Business and Management; Operation Research/Decision Theory; Combinatorics; Theory of Computation
ISSN
0254-5330
eISSN
1572-9338
DOI
10.1007/s10479-005-3971-7
Publisher site
See Article on Publisher Site

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.

Journal

Annals of Operations ResearchSpringer Journals

Published: Jan 1, 2005

There are no references for this article.