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

A transformation technique for the clustered generalized traveling salesman problem with applications to logistics

Author

Listed:
  • Baniasadi, Pouya
  • Foumani, Mehdi
  • Smith-Miles, Kate
  • Ejov, Vladimir

Abstract

The clustered generalized traveling salesman problem (CGTSP) is an extension of the classical traveling salesman problem (TSP), where the set of nodes is divided into clusters of nodes, and the clusters are further divided into subclusters of nodes. The objective is to find the minimal route that visits exactly one node from each subcluster in such a way that all subclusters of each cluster are visited consecutively. Due to the additional flexibility of the CGTSP compared to the classical TSP, CGTSP can incorporate a wider range of complexities arising from some practical applications. However, the absence of a good solution method for CGTSP is currently a major impediment in the use of the framework for modeling. Accordingly, the main objective of this paper is to enable the powerful framework of CGTSP for applied problems. To attain this goal, we first develop a solution method by an efficient transformation from CGTSP to TSP. We then demonstrate that not only the solution method provides far superior solution quality compared to existing methods for solving CGTSP, but also it enables practical solutions to far larger CGTSP instances. Finally, to illustrate that the modeling framework and the solution method apply to some practical problems of realistic sizes, we conduct a computational experiment by considering the application of CGTSP to two modern logistics problems; namely, automated storage and retrieval systems (logistics inside the warehouse) and drone-assisted parcel delivery service (logistics outside the warehouse).

Suggested Citation

  • 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.
  • Handle: RePEc:eee:ejores:v:285:y:2020:i:2:p:444-457
    DOI: 10.1016/j.ejor.2020.01.053
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.ejor.2020.01.053?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. Karapetyan, D. & Gutin, G., 2011. "Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 208(3), pages 221-232, February.
    2. David Applegate & William Cook & André Rohe, 2003. "Chained Lin-Kernighan for Large Traveling Salesman Problems," INFORMS Journal on Computing, INFORMS, vol. 15(1), pages 82-92, February.
    3. Boysen, Nils & Briskorn, Dirk & Emde, Simon, 2017. "Parts-to-picker based order processing in a rack-moving mobile robots environment," European Journal of Operational Research, Elsevier, vol. 262(2), pages 550-562.
    4. Emine Gundogdu & Hakan Gultekin, 2016. "Scheduling in two-machine robotic cells with a self-buffered robot," IISE Transactions, Taylor & Francis Journals, vol. 48(2), pages 170-191, February.
    5. Karapetyan, D. & Gutin, G., 2012. "Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 219(2), pages 234-251.
    6. 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.
    7. Niels Agatz & Paul Bouman & Marie Schmidt, 2018. "Optimization Approaches for the Traveling Salesman Problem with Drone," Transportation Science, INFORMS, vol. 52(4), pages 965-981, August.
    8. Helsgaun, Keld, 2000. "An effective implementation of the Lin-Kernighan traveling salesman heuristic," European Journal of Operational Research, Elsevier, vol. 126(1), pages 106-130, October.
    9. René B. M. De Koster & Andrew L. Johnson & Debjit Roy, 2017. "Warehouse design and management," International Journal of Production Research, Taylor & Francis Journals, vol. 55(21), pages 6327-6330, November.
    10. Doppstadt, C. & Koberstein, A. & Vigo, D., 2016. "The Hybrid Electric Vehicle – Traveling Salesman Problem," European Journal of Operational Research, Elsevier, vol. 253(3), pages 825-842.
    11. Rao, Bharat & Gopi, Ashwin Goutham & Maione, Romana, 2016. "The societal impact of commercial drones," Technology in Society, Elsevier, vol. 45(C), pages 83-90.
    12. Boysen, Nils & Stephan, Konrad, 2016. "A survey on single crane scheduling in automated storage/retrieval systems," European Journal of Operational Research, Elsevier, vol. 254(3), pages 691-704.
    13. Zhou, Lin & Baldacci, Roberto & Vigo, Daniele & Wang, Xu, 2018. "A Multi-Depot Two-Echelon Vehicle Routing Problem with Delivery Options Arising in the Last Mile Distribution," European Journal of Operational Research, Elsevier, vol. 265(2), pages 765-778.
    14. Lim, Ming K. & Bahr, Witold & Leung, Stephen C.H., 2013. "RFID in the warehouse: A literature analysis (1995–2010) of its applications, benefits, challenges and future trends," International Journal of Production Economics, Elsevier, vol. 145(1), pages 409-430.
    15. Zhi-Long Chen, 2010. "Integrated Production and Outbound Distribution Scheduling: Review and Extensions," Operations Research, INFORMS, vol. 58(1), pages 130-148, February.
    16. Niels Agatz & Ann Campbell & Moritz Fleischmann & Martin Savelsbergh, 2011. "Time Slot Management in Attended Home Delivery," Transportation Science, INFORMS, vol. 45(3), pages 435-449, August.
    17. Bernardino, Raquel & Paias, Ana, 2018. "Solving the family traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 267(2), pages 453-466.
    18. Theys, Christophe & Bräysy, Olli & Dullaert, Wout & Raa, Birger, 2010. "Using a TSP heuristic for routing order pickers in warehouses," European Journal of Operational Research, Elsevier, vol. 200(3), pages 755-763, February.
    19. 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.
    20. Boysen, Nils & Briskorn, Dirk & Emde, Simon, 2017. "Parts-to-picker based order processing in a rack-moving mobile robots environment," Publications of Darmstadt Technical University, Institute for Business Studies (BWL) 85774, Darmstadt Technical University, Department of Business Administration, Economics and Law, Institute for Business Studies (BWL).
    21. Mehdi Foumani & Asghar Moeini & Michael Haythorpe & Kate Smith-Miles, 2018. "A cross-entropy method for optimising robotic automated storage and retrieval systems," International Journal of Production Research, Taylor & Francis Journals, vol. 56(19), pages 6450-6472, October.
    22. Snyder, Lawrence V. & Daskin, Mark S., 2006. "A random-key genetic algorithm for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 174(1), pages 38-53, October.
    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. Pop, Petrică C. & Cosma, Ovidiu & Sabo, Cosmin & Sitar, Corina Pop, 2024. "A comprehensive survey on the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 314(3), pages 819-835.
    2. 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).
    3. Sihan Wang & Cheng Han & Yang Yu & Min Huang & Wei Sun & Ikou Kaku, 2022. "Reducing Carbon Emissions for the Vehicle Routing Problem by Utilizing Multiple Depots," Sustainability, MDPI, vol. 14(3), pages 1-18, January.
    4. Polten, Lukas & Emde, Simon, 2022. "Multi-shuttle crane scheduling in automated storage and retrieval systems," European Journal of Operational Research, Elsevier, vol. 302(3), pages 892-908.
    5. Scianna, Marco, 2024. "The AddACO: A bio-inspired modified version of the ant colony optimization algorithm to solve travel salesman problems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 218(C), pages 357-382.
    6. Cheng-Hsiung Tsai & Yu-Da Lin & Cheng-Hong Yang & Chien-Kun Wang & Li-Chun Chiang & Po-Jui Chiang, 2023. "A Biogeography-Based Optimization with a Greedy Randomized Adaptive Search Procedure and the 2-Opt Algorithm for the Traveling Salesman Problem," Sustainability, MDPI, vol. 15(6), pages 1-14, March.
    7. Rajabighamchi, Farzaneh & van Hoesel, Stan & Defryn, Christof, 2023. "The order picking problem under a scattered storage policy," Research Memorandum 006, Maastricht University, Graduate School of Business and Economics (GSBE).
    8. 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.
    9. Janusz Szpytko & Yorlandys Salgado Duarte, 2021. "A digital twins concept model for integrated maintenance: a case study for crane operation," Journal of Intelligent Manufacturing, Springer, vol. 32(7), pages 1863-1881, October.
    10. Tao Yang & Weixin Wang, 2022. "Logistics Network Distribution Optimization Based on Vehicle Sharing," Sustainability, MDPI, vol. 14(4), pages 1-12, February.

    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. Gharehgozli, Amir & Zaerpour, Nima, 2020. "Robot scheduling for pod retrieval in a robotic mobile fulfillment system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    2. Pop, Petrică C. & Cosma, Ovidiu & Sabo, Cosmin & Sitar, Corina Pop, 2024. "A comprehensive survey on the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 314(3), pages 819-835.
    3. Jeanette Schmidt & Stefan Irnich, 2020. "New Neighborhoods and an Iterated Local Search Algorithm for the Generalized Traveling Salesman Problem," Working Papers 2020, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    4. Gharehgozli, Amir & Yu, Yugang & de Koster, René & Du, Shaofu, 2019. "Sequencing storage and retrieval requests in a container block with multiple open locations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 125(C), pages 261-284.
    5. Jiang, Min & Huang, George Q., 2022. "Intralogistics synchronization in robotic forward-reserve warehouses for e-commerce last-mile delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    6. Dontas, Michael & Sideris, Georgios & Manousakis, Eleftherios G. & Zachariadis, Emmanouil E., 2023. "An adaptive memory matheuristic for the set orienteering problem," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1010-1023.
    7. Li, Xiaowei & Hua, Guowei & Huang, Anqiang & Sheu, Jiuh-Biing & Cheng, T.C.E. & Huang, Fengquan, 2020. "Storage assignment policy with awareness of energy consumption in the Kiva mobile fulfilment system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    8. Lu Zhen & Jingwen Wu & Haolin Li & Zheyi Tan & Yingying Yuan, 2023. "Scheduling multiple types of equipment in an automated warehouse," Annals of Operations Research, Springer, vol. 322(2), pages 1119-1141, March.
    9. 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.
    10. Mehdi El Krari & Belaïd Ahiod & Youssef Bouazza El Benani, 2021. "A pre-processing reduction method for the generalized travelling salesman problem," Operational Research, Springer, vol. 21(4), pages 2543-2591, December.
    11. David Füßler & Nils Boysen, 2019. "High-performance order processing in picking workstations," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(1), pages 65-90, March.
    12. Karapetyan, D. & Gutin, G., 2011. "Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 208(3), pages 221-232, February.
    13. Boysen, Nils & Briskorn, Dirk & Fedtke, Stefan & Schmickerath, Marcel, 2019. "Automated sortation conveyors: A survey from an operational research perspective," European Journal of Operational Research, Elsevier, vol. 276(3), pages 796-815.
    14. Polten, Lukas & Emde, Simon, 2021. "Scheduling automated guided vehicles in very narrow aisle warehouses," Omega, Elsevier, vol. 99(C).
    15. 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.
    16. Nils Boysen & Stefan Fedtke & Stefan Schwerdfeger, 2021. "Last-mile delivery concepts: a survey from an operational research perspective," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(1), pages 1-58, March.
    17. Karapetyan, D. & Gutin, G., 2012. "Efficient local search algorithms for known and new neighborhoods for the generalized traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 219(2), pages 234-251.
    18. Boysen, Nils & Schwerdfeger, Stefan & Stephan, Konrad, 2023. "A review of synchronization problems in parts-to-picker warehouses," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1374-1390.
    19. Yuan, Yuan & Cattaruzza, Diego & Ogier, Maxime & Semet, Frédéric & Vigo, Daniele, 2021. "A column generation based heuristic for the generalized vehicle routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    20. 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.

    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:285:y:2020:i:2:p:444-457. 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.