Meta-RaPS: a simple and effective approach for solving the traveling salesman problem

This paper investigates the development and application of a general meta-heuristic, Meta-RaPS (meta-heuristic for randomized priority search), to the traveling salesman problem (TSP). The Meta-RaPS approach is tested on several established test sets. The Meta-RaPS approach outperformed most other s...

Full description

Saved in:
Bibliographic Details
Published inTransportation research. Part E, Logistics and transportation review Vol. 41; no. 2; pp. 115 - 130
Main Authors DePuy, Gail W., Moraga, Reinaldo J., Whitehouse, Gary E.
Format Journal Article
LanguageEnglish
Published Exeter Elsevier India Pvt Ltd 01.03.2005
Elsevier
Elsevier Sequoia S.A
SeriesTransportation Research Part E: Logistics and Transportation Review
Subjects
Cheapest insertion
Heuristic
Meta-heuristic
Meta-heuristic TSP Cheapest insertion
Studies
Transportation economics
Traveling salesman problem
TSP
TSP
Cheapest insertion
Meta-heuristic
Online AccessGet full text

Cover

More Information
Summary:This paper investigates the development and application of a general meta-heuristic, Meta-RaPS (meta-heuristic for randomized priority search), to the traveling salesman problem (TSP). The Meta-RaPS approach is tested on several established test sets. The Meta-RaPS approach outperformed most other solution methodologies in terms of percent difference from optimal. Additionally, an industry case study that incorporates Meta-RaPS TSP in a large truck route assignment model is presented. The company estimates a more than 50% reduction in engineering time and over $2.5 million annual savings in transportation costs using the automated Meta-RaPS TSP tool compared to their current method.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1366-5545
1878-5794
DOI:10.1016/j.tre.2004.02.001