IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v223y2012i3p637-643.html
   My bibliography  Save this article

The undirected m-Capacitated Peripatetic Salesman Problem

Author

Listed:
  • Duchenne, Éric
  • Laporte, Gilbert
  • Semet, Frédéric

Abstract

In the m-Capacitated Peripatetic Salesman Problem (m-CPSP) the aim is to determine m Hamiltonian cycles of minimal total cost on a graph, such that all the edges are traversed less than the value of their capacity. This article introduces three formulations for the m-CPSP. Two branch-and-cut algorithms and one branch-and-price algorithm are developed. Tests performed on randomly generated and on TSPLIB Euclidean instances indicate that the branch-and-price algorithm can solve instances with more than twice the size of what is achievable with the branch-and-cut algorithms.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:ejores:v:223:y:2012:i:3:p:637-643
    DOI: 10.1016/j.ejor.2012.07.022
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221712005632
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2012.07.022?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.

    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. 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.
    4. É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.
    5. 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.
    6. 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.
    7. Matteo Fischetti & Juan José Salazar González & Paolo Toth, 1997. "A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem," Operations Research, INFORMS, vol. 45(3), pages 378-394, June.
    8. Plastria, Frank, 2002. "Formulating logical implications in combinatorial optimisation," European Journal of Operational Research, Elsevier, vol. 140(2), pages 338-353, July.
    Full references (including those not matched with items on IDEAS)

    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. É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.
    2. Asef-Vaziri, Ardavan & Kazemi, Morteza, 2018. "Covering and connectivity constraints in loop-based formulation of material flow network design in facility layout," European Journal of Operational Research, Elsevier, vol. 264(3), pages 1033-1044.
    3. Amir Ahmadi-Javid & Nasrin Ramshe, 2019. "Designing flexible loop-based material handling AGV paths with cell-adjacency priorities: an efficient cutting-plane algorithm," 4OR, Springer, vol. 17(4), pages 373-400, December.
    4. 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.
    5. Khachai, Daniil & Sadykov, Ruslan & Battaia, Olga & Khachay, Michael, 2023. "Precedence constrained generalized traveling salesman problem: Polyhedral study, formulations, and branch-and-cut algorithm," European Journal of Operational Research, Elsevier, vol. 309(2), pages 488-505.
    6. Bernardino, Raquel & Paias, Ana, 2018. "Solving the family traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 267(2), pages 453-466.
    7. Tolga Bektaş & Güneş Erdoğan & Stefan Røpke, 2011. "Formulations and Branch-and-Cut Algorithms for the Generalized Vehicle Routing Problem," Transportation Science, INFORMS, vol. 45(3), pages 299-316, August.
    8. Asef-Vaziri, Ardavan & Kazemi, Morteza & Eshghi, Kourosh & Lahmar, Maher, 2010. "An ant colony system for enhanced loop-based aisle-network design," European Journal of Operational Research, Elsevier, vol. 207(1), pages 110-120, November.
    9. Bektaş, Tolga & Gouveia, Luís & Santos, Daniel, 2019. "Revisiting the Hamiltonian p-median problem: A new formulation on directed graphs and a branch-and-cut algorithm," European Journal of Operational Research, Elsevier, vol. 276(1), pages 40-64.
    10. 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.
    11. Asef-Vaziri, Ardavan & Goetschalckx, Marc, 2008. "Dual track and segmented single track bidirectional loop guidepath layout for AGV systems," European Journal of Operational Research, Elsevier, vol. 186(3), pages 972-989, May.
    12. 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.
    13. 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.
    14. Eduardo Álvarez-Miranda & Markus Sinnl, 2020. "A branch-and-cut algorithm for the maximum covering cycle problem," Annals of Operations Research, Springer, vol. 284(2), pages 487-499, January.
    15. Asef-Vaziri, Ardavan & Laporte, Gilbert & Ortiz, Robert, 2007. "Exact and heuristic procedures for the material handling circular flow path design problem," European Journal of Operational Research, Elsevier, vol. 176(2), pages 707-726, January.
    16. 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).
    17. 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.
    18. Bronfman, Andrés & Marianov, Vladimir & Paredes-Belmar, Germán & Lüer-Villagra, Armin, 2015. "The maximin HAZMAT routing problem," European Journal of Operational Research, Elsevier, vol. 241(1), pages 15-27.
    19. Yuan, Yuan & Cattaruzza, Diego & Ogier, Maxime & Semet, Frédéric, 2020. "A branch-and-cut algorithm for the generalized traveling salesman problem with time windows," European Journal of Operational Research, Elsevier, vol. 286(3), pages 849-866.
    20. Buckow, Jan-Niklas & Knust, Sigrid, 2023. "The warehouse reshuffling problem with swap moves," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).

    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:ejores:v:223:y:2012:i:3:p:637-643. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    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.