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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

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


    Contributors:


    Publication date :

    2004-02-10


    Size :

    16 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    Swarm Intelligence for Solving a Traveling Salesman Problem

    Kuehner, Isabel | German Aerospace Center (DLR) | 2020

    Free access

    Enhanced Approaches to Solving the Multiple Traveling Salesman Problem

    Boone, Nathan / Sathyan, Anoop / Cohen, Kelly | AIAA | 2015


    Heuristic Approach to the Traveling Salesman Problem

    C. Y. Huang / S. H. Lane | NTIS | 1987


    A deep reinforcement learning approach for solving the Traveling Salesman Problem with Drone

    Bogyrbayeva, Aigerim / Yoon, Taehyun / Ko, Hanbum et al. | Elsevier | 2022