IDEAS home Printed from https://ideas.repec.org/a/inm/oropre/v55y2007i5p949-965.html
   My bibliography  Save this article

The Undirected m -Peripatetic Salesman Problem: Polyhedral Results and New Algorithms

Author

Listed:
  • Éric Duchenne

    (LAMIH, Université de Valenciennes et du Hainaut-Cambresis, 59313 Valenciennes Cedex 9, France)

  • Gilbert Laporte

    (Centre de Recherche sur les Transports, HEC Montréal, Montreal, Quebec, Canada H3T 2A7)

  • Frédéric Semet

    (LAMIH, Université de Valenciennes et du Hainaut-Cambresis, 59313 Valenciennes Cedex 9, France)

Abstract

In the m -peripatetic salesman problem ( m -PSP), the aim is to determine m edge disjoint Hamiltonian cycles of minimum total cost on a graph. This article introduces new valid inequalities and polyhedral results for the m -PSP. An improved 2-index branch-and-cut algorithm is developed. Tests performed on randomly generated and TSPLIB Euclidean instances indicate that this algorithm can solve instances with more than double the size of what was previously achievable.

Suggested Citation

  • Éric Duchenne & Gilbert Laporte & Frédéric Semet, 2007. "The Undirected m -Peripatetic Salesman Problem: Polyhedral Results and New Algorithms," Operations Research, INFORMS, vol. 55(5), pages 949-965, October.
    • Handle: RePEc:inm:oropre:v:55:y:2007:i:5:p:949-965
    DOI: 10.1287/opre.1070.0387
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/opre.1070.0387
    Download Restriction: no
    File URL: https://libkey.io/10.1287/opre.1070.0387?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
    ---><---

    References listed on IDEAS

    as
    1. Duchenne, Eric & Laporte, Gilbert & Semet, Frederic, 2005. "Branch-and-cut algorithms for the undirected m-Peripatetic Salesman Problem," European Journal of Operational Research, Elsevier, vol. 162(3), pages 700-712, May.
    2. Asef-Vaziri, Ardavan & Laporte, Gilbert, 2005. "Loop based facility planning and material handling," European Journal of Operational Research, Elsevier, vol. 164(1), pages 1-11, July.
    3. G. Dantzig & R. Fulkerson & S. Johnson, 1954. "Solution of a Large-Scale Traveling-Salesman Problem," Operations Research, INFORMS, vol. 2(4), pages 393-410, November.
    4. Laurel Lindner-Dutton & Rajan Batta & Mark H. Karwan, 1991. "Equitable Sequencing of a Given Set of Hazardous Materials Shipments," Transportation Science, INFORMS, vol. 25(2), pages 124-137, May.
    5. M. A. Venkataramanan & Kathryn A. Wilson, 1991. "A branch‐and‐bound algorithm for flow‐path design of automated guided vehicle systems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(3), pages 431-445, June.
    6. De Kort, Jeroen B. J. M., 1993. "A branch and bound algorithm for symmetric 2-Peripatetic Salesman Problems," European Journal of Operational Research, Elsevier, vol. 70(2), pages 229-243, October.
    7. Gerhard Reinelt, 1991. "TSPLIB—A Traveling Salesman Problem Library," INFORMS Journal on Computing, INFORMS, vol. 3(4), pages 376-384, November.
    Full references (including those not matched with items on IDEAS)

    Citations

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


    Cited by:

    1. Keskin, Burcu B. & Li, Shirley (Rong) & Steil, Dana & Spiller, Sarah, 2012. "Analysis of an integrated maximum covering and patrol routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 215-232.
    2. TALARICO, Luca & SÖRENSEN, Kenneth & SPRINGAEL, Johan, 2013. "The k-dissimilar vehicle routing problem," Working Papers 2013029, University of Antwerp, Faculty of Business and Economics.
    3. Duchenne, Éric & Laporte, Gilbert & Semet, Frédéric, 2012. "The undirected m-Capacitated Peripatetic Salesman Problem," European Journal of Operational Research, Elsevier, vol. 223(3), pages 637-643.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Duchenne, Éric & Laporte, Gilbert & Semet, Frédéric, 2012. "The undirected m-Capacitated Peripatetic Salesman Problem," European Journal of Operational Research, Elsevier, vol. 223(3), pages 637-643.
    2. Bernardino, Raquel & Paias, Ana, 2018. "Solving the family traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 267(2), pages 453-466.
    3. Muren, & Wu, Jianjun & Zhou, Li & Du, Zhiping & Lv, Ying, 2019. "Mixed steepest descent algorithm for the traveling salesman problem and application in air logistics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 126(C), pages 87-102.
    4. A. S. Santos & A. M. Madureira & M. L. R. Varela, 2018. "The Influence of Problem Specific Neighborhood Structures in Metaheuristics Performance," Journal of Mathematics, Hindawi, vol. 2018, pages 1-14, July.
    5. Gary R. Waissi & Pragya Kaushal, 2020. "A polynomial matrix processing heuristic algorithm for finding high quality feasible solutions for the TSP," OPSEARCH, Springer;Operational Research Society of India, vol. 57(1), pages 73-87, March.
    6. Aardal, K.I. & van Hoesel, S., 1995. "Polyhedral Techniques in Combinatorial Optimization," Other publications TiSEM ed028a07-eb6a-4c8d-8f21-d, Tilburg University, School of Economics and Management.
    7. Balma, Ali & Salem, Safa Ben & Mrad, Mehdi & Ladhari, Talel, 2018. "Strong multi-commodity flow formulations for the asymmetric traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 271(1), pages 72-79.
    8. William Cook & Daniel G. Espinoza & Marcos Goycoolea, 2007. "Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP)," INFORMS Journal on Computing, INFORMS, vol. 19(3), pages 356-365, August.
    9. Zang, Xiaoning & Jiang, Li & Liang, Changyong & Fang, Xiang, 2023. "Coordinated home and locker deliveries: An exact approach for the urban delivery problem with conflicting time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    10. Bruce Golden & Zahra Naji-Azimi & S. Raghavan & Majid Salari & Paolo Toth, 2012. "The Generalized Covering Salesman Problem," INFORMS Journal on Computing, INFORMS, vol. 24(4), pages 534-553, November.
    11. Gianpaolo Ghiani & Gilbert Laporte & Frédéric Semet, 2006. "The Black and White Traveling Salesman Problem," Operations Research, INFORMS, vol. 54(2), pages 366-378, April.
    12. Anirudh Subramanyam & Chrysanthos E. Gounaris, 2018. "A Decomposition Algorithm for the Consistent Traveling Salesman Problem with Vehicle Idling," Transportation Science, INFORMS, vol. 52(2), pages 386-401, March.
    13. Sleegers, Joeri & Olij, Richard & van Horn, Gijs & van den Berg, Daan, 2020. "Where the really hard problems aren’t," Operations Research Perspectives, Elsevier, vol. 7(C).
    14. Cacchiani, Valentina & Contreras-Bolton, Carlos & Toth, Paolo, 2020. "Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times," European Journal of Operational Research, Elsevier, vol. 283(3), pages 825-843.
    15. Burger, M. & Su, Z. & De Schutter, B., 2018. "A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem," European Journal of Operational Research, Elsevier, vol. 265(2), pages 463-477.
    16. William Cook & Sanjeeb Dash & Ricardo Fukasawa & Marcos Goycoolea, 2009. "Numerically Safe Gomory Mixed-Integer Cuts," INFORMS Journal on Computing, INFORMS, vol. 21(4), pages 641-649, November.
    17. Thiago Serra & Ryan J. O’Neil, 2020. "MIPLIBing: Seamless Benchmarking of Mathematical Optimization Problems and Metadata Extensions," SN Operations Research Forum, Springer, vol. 1(3), pages 1-6, September.
    18. Barbato, Michele & Gouveia, Luís, 2024. "The Hamiltonian p-median problem: Polyhedral results and branch-and-cut algorithms," European Journal of Operational Research, Elsevier, vol. 316(2), pages 473-487.
    19. S Salhi & A Al-Khedhairi, 2010. "Integrating heuristic information into exact methods: The case of the vertex p-centre problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(11), pages 1619-1631, November.
    20. Marilène Cherkesly & Claudio Contardo, 2021. "The conditional p-dispersion problem," Journal of Global Optimization, Springer, vol. 81(1), pages 23-83, September.

    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:oropre:v:55:y:2007:i:5:p:949-965. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.