The traveling salesman problem: an overview of exact and approximate algorithms

Article Abstract:

Exact and approximate algorithms for the traveling salesman problem (TSP) are presented. These are integer linear programming formulations; assignment lower bound and related branch-and-bound algorithms; the shortest spanning arborescence bound; the shortest spanning tree bound; the 2-matching lower bound; heuristics with guaranteed worst-case performance; heuristics with good empirical performance; composite algorithms; and related algorithms. These algorithms yield solutions to the TSP with over 2000 vertices using constraint relaxation algorithms. Tabu search methods and generalized insertion algorithms are also proposed as potentially powerful heuristics.

Combinatorial optimization, Traveling-salesman problem

---

The vehicle routing problem: an overview of exact and approximate algorithms

Article Abstract:

Exact and appropriate mathematical models are presented which can help solve vehicle routing problems (VRP), a central concern in logistics and distribution management. Exact calculations, however, can address only relatively minor problems. Several approximate algorithms produce satisfactory solutions. Many potential areas for further research include the tabu search methods.

Traffic flow

---

Real-time vehicle routing: solution concepts, algorithms and parallel computing strategies

Article Abstract:

A new generation of fast on-line algorithms capable of taking into account the uncertainty is developed. A particular emphasis is put on parallel computing strategies.

Usage, Algorithm, Heuristic, Parallel processing, Heuristics (Psychology)

Similar abstracts:

• Abstracts: Travelling salesman. Battle by statute. Passing the bullet
• Abstracts: The people problem. After politics. The British referendum
• Abstracts: Simulated annealing for machine layout problems in the presence of zoning constraints. Recent models and techniques for solving the layout problem
• Abstracts: The Tibetan gambit. Eleventh coming: designation of Panchen Lama stirs a storm. God child; young Spanish boy assumes the yoke of celebrated Tibetan lama
• Abstracts: Lot sizing with quality improvement and setup time reduction. Setup cost stability region for the dynamic lot sizing problem with backlogging

This website is not affiliated with document authors or copyright owners. This page is provided for informational purposes only. Unintentional errors are possible.