IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v41y2005i2p115-130.html
   My bibliography  Save this article

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

Author

Listed:
  • DePuy, Gail W.
  • Moraga, Reinaldo J.
  • Whitehouse, Gary E.

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.

Suggested Citation

  • DePuy, Gail W. & Moraga, Reinaldo J. & Whitehouse, Gary E., 2005. "Meta-RaPS: a simple and effective approach for solving the traveling salesman problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 41(2), pages 115-130, March.
    • Handle: RePEc:eee:transe:v:41:y:2005:i:2:p:115-130
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554504000146
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Christopher Garcia, 2016. "Winner Determination Algorithms for Combinatorial Auctions with Sub-cardinality Constraints," Computational Economics, Springer;Society for Computational Economics, vol. 47(3), pages 401-421, March.
    2. Lan, Guanghui & DePuy, Gail W. & Whitehouse, Gary E., 2007. "An effective and simple heuristic for the set covering problem," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1387-1403, February.
    3. Jamal Ouenniche & Prasanna K. Ramaswamy & Michel Gendreau, 2017. "A dual local search framework for combinatorial optimization problems with TSP application," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(11), pages 1377-1398, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:41:y:2005:i:2:p:115-130. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.