AbstractThis 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.
Meta-RaPS: a simple and effective approach for solving the traveling salesman problem
Transportation Research Part E: Logistics and Transportation Review ; 41 , 2 ; 115-130
2004-02-10
16 pages
Article (Journal)
Electronic Resource
English
Meta-RaPS: a simple and effective approach for solving the traveling salesman problem
Online Contents | 2005
|Swarm Intelligence for Solving a Traveling Salesman Problem
German Aerospace Center (DLR) | 2020
|Heuristic Approach to the Traveling Salesman Problem
NTIS | 1987
|