IDEAS home Printed from https://ideas.repec.org/a/pal/jorsoc/v53y2002i9d10.1057_palgrave.jors.2601420.html
   My bibliography  Save this article

Some applications of the clustered travelling salesman problem

Author

Listed:
  • G Laporte

    (École des Hautes Études Commerciales)

  • U Palekar

    (University of Illinois at Urbana-Champaign, Urbana)

Abstract

The purpose of this article is to describe several applications of the clustered travelling salesman problem arising in areas as diverse as vehicle routing, manufacturing, computer operations, examination timetabling, cytological testing, and integrated circuit testing.

Suggested Citation

  • G Laporte & U Palekar, 2002. "Some applications of the clustered travelling salesman problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(9), pages 972-976, September.
    • Handle: RePEc:pal:jorsoc:v:53:y:2002:i:9:d:10.1057_palgrave.jors.2601420
    DOI: 10.1057/palgrave.jors.2601420
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1057/palgrave.jors.2601420
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1057/palgrave.jors.2601420?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
    ---><---

    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. Thanh Tan Doan & Nathalie Bostel & Minh Hoàng Hà & Vu Hoang Vuong Nguyen, 2023. "New mixed integer linear programming models and an iterated local search for the clustered traveling salesman problem with relaxed priority rule," Journal of Combinatorial Optimization, Springer, vol. 46(1), pages 1-27, August.
    2. Miranda, Pablo A. & Blazquez, Carola A. & Obreque, Carlos & Maturana-Ross, Javier & Gutierrez-Jarpa, Gabriel, 2018. "The bi-objective insular traveling salesman problem with maritime and ground transportation costs," European Journal of Operational Research, Elsevier, vol. 271(3), pages 1014-1036.
    3. Taillard, Éric D., 2022. "A linearithmic heuristic for the travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 297(2), pages 442-450.
    4. DEFRYN, Christof & SÖRENSEN, Kenneth, 2015. "A two-level variable neighbourhood search for the Euclidean clustered vehicle routing problem," Working Papers 2015002, University of Antwerp, Faculty of Business and Economics.
    5. Gustavo Erick Anaya Fuentes & Eva Selene Hernández Gress & Juan Carlos Seck Tuoh Mora & Joselito Medina Marín, 2018. "Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic," PLOS ONE, Public Library of Science, vol. 13(8), pages 1-20, August.
    6. Baniasadi, Pouya & Foumani, Mehdi & Smith-Miles, Kate & Ejov, Vladimir, 2020. "A transformation technique for the clustered generalized traveling salesman problem with applications to logistics," European Journal of Operational Research, Elsevier, vol. 285(2), pages 444-457.

    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:pal:jorsoc:v:53:y:2002:i:9:d:10.1057_palgrave.jors.2601420. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.palgrave-journals.com/ .

    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.