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

    Authors

    G. W. DePuy; R. J. Moraga;G. E. Whitehouse

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Abbreviated Journal Title

    Transp. Res. Pt. e-Logist. Transp. Rev.

    Keywords

    meta-heuristic; TSP; cheapest insertion; GRASP; SEARCH; NET; Economics; Engineering, Civil; Operations Research & Management Science; Transportation; Transportation Science & Technology

    Abstract

    This paper investigates the development and application of a general meta-heuristic, Meta-RaPS (metaheuristic 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. (C) 2004 Elsevier Ltd. All rights reserved.

    Journal Title

    Transportation Research Part E-Logistics and Transportation Review

    Volume

    41

    Issue/Number

    2

    Publication Date

    1-1-2005

    Document Type

    Article

    Language

    English

    First Page

    115

    Last Page

    130

    WOS Identifier

    WOS:000226334000003

    ISSN

    1366-5545

    Share

    COinS