Title

Meta-Raps: A Simple And Effective Approach For Solving The Traveling Salesman Problem

Keywords

Cheapest insertion; Meta-heuristic; TSP

Abstract

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. © 2004 Elsevier Ltd. All rights reserved.

Publication Date

1-1-2005

Publication Title

Transportation Research Part E: Logistics and Transportation Review

Volume

41

Issue

2

Number of Pages

115-130

Document Type

Article

Personal Identifier

scopus

DOI Link

https://doi.org/10.1016/j.tre.2004.02.001

Socpus ID

8144228804 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/8144228804

This document is currently not available here.

Share

COinS