IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v19y1973i7p790-799.html
   My bibliography  Save this article

Computational Experience with an M-Salesman Traveling Salesman Algorithm

Author

Listed:
  • Joseph A. Svestka

    (The Cleveland Trust Company, Cleveland, Ohio)

  • Vaughn E. Huckfeldt

    (Western Interstate Commission on Higher Education (WICHE), Boulder, Colorado)

Abstract

A formulation of the traveling salesman problem with more than one salesman is offered. The particular formulation has computational advantages over other formulations. Experience is obtained with an exact branch and bound algorithm employing both upper and lower bounds (mean run time for 55 city problems is one minute). Due to the special formulation, certain subtours may satisfy the constraints, thus reducing the search. A very good initial tour and upper bound are employed. The determination of these as well as the pathology of the formulation and the algorithm are discussed. No increase in computation time over the one-salesman case is experienced.

Suggested Citation

  • Joseph A. Svestka & Vaughn E. Huckfeldt, 1973. "Computational Experience with an M-Salesman Traveling Salesman Algorithm," Management Science, INFORMS, vol. 19(7), pages 790-799, March.
    • Handle: RePEc:inm:ormnsc:v:19:y:1973:i:7:p:790-799
    DOI: 10.1287/mnsc.19.7.790
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.19.7.790
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.19.7.790?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

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


    Cited by:

    1. Bektas, Tolga, 2006. "The multiple traveling salesman problem: an overview of formulations and solution procedures," Omega, Elsevier, vol. 34(3), pages 209-219, June.
    2. Qu, Hong & Yi, Zhang & Tang, HuaJin, 2007. "A columnar competitive model for solving multi-traveling salesman problem," Chaos, Solitons & Fractals, Elsevier, vol. 31(4), pages 1009-1019.
    3. Yuan, Shuai & Skinner, Bradley & Huang, Shoudong & Liu, Dikai, 2013. "A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 228(1), pages 72-82.
    4. Julia Rieck & Jürgen Zimmermann & Matthias Glagow, 2007. "Tourenplanung mittelständischer Speditionsunternehmen in Stückgutkooperationen: Modellierung und heuristische Lösungsverfahren," Metrika: International Journal for Theoretical and Applied Statistics, Springer, vol. 17(4), pages 365-388, January.
    5. Bismark Singh & Lena Oberfichtner & Sergey Ivliev, 2023. "Heuristics for a cash-collection routing problem with a cluster-first route-second approach," Annals of Operations Research, Springer, vol. 322(1), pages 413-440, March.
    6. Chen, Lijian & Chiang, Wen-Chyuan & Russell, Robert & Chen, Jun & Sun, Dengfeng, 2018. "The probabilistic vehicle routing problem with service guarantees," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 111(C), pages 149-164.
    7. Luo, Zhixing & Qin, Hu & Lim, Andrew, 2014. "Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints," European Journal of Operational Research, Elsevier, vol. 234(1), pages 49-60.
    8. Bräysy, Olli & Dullaert, Wout & Nakari, Pentti, 2009. "The potential of optimization in communal routing problems: case studies from Finland," Journal of Transport Geography, Elsevier, vol. 17(6), pages 484-490.
    9. He, Pengfei & Hao, Jin-Kao, 2023. "Memetic search for the minmax multiple traveling salesman problem with single and multiple depots," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1055-1070.
    10. José Alejandro Cornejo-Acosta & Jesús García-Díaz & Julio César Pérez-Sansalvador & Carlos Segura, 2023. "Compact Integer Programs for Depot-Free Multiple Traveling Salesperson Problems," Mathematics, MDPI, vol. 11(13), pages 1-25, July.
    11. Kara, Imdat & Bektas, Tolga, 2006. "Integer linear programming formulations of multiple salesman problems and its variations," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1449-1458, November.

    More about this item

    Statistics

    Access and download statistics

    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:inm:ormnsc:v:19:y:1973:i:7:p:790-799. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.