IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v286y2020i1d10.1007_s10479-018-2812-4.html
   My bibliography  Save this article

Multi-depot traveling salesmen location problems on networks with special structure

Author

Listed:
  • Igor Averbakh

    (University of Toronto Scarborough)

  • Wei Yu

    (East China University of Science and Technology)

Abstract

Suppose that on any day, calls for service are generated by nodes of a transportation network independently with known probabilities. The calls are allocated to p service units that visit the allocated customers on shortest closed tours. That is, each service unit performs an optimal traveling salesman tour on its set of allocated calls (customers). We need to find optimal locations for the service units to minimize the expected travel distance. For this problem on a path, we present an $$O(n^4)$$O(n4) algorithm, where n is the number of nodes of the network. We also present an $$O(n^5)$$O(n5) algorithm for the problem on a tree with $$p=2$$p=2.

Suggested Citation

  • Igor Averbakh & Wei Yu, 2020. "Multi-depot traveling salesmen location problems on networks with special structure," Annals of Operations Research, Springer, vol. 286(1), pages 635-648, March.
    • Handle: RePEc:spr:annopr:v:286:y:2020:i:1:d:10.1007_s10479-018-2812-4
    DOI: 10.1007/s10479-018-2812-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-018-2812-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10479-018-2812-4?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. Kien Nguyen & Lam Anh, 2015. "Inverse $$k$$ k -centrum problem on trees with variable vertex weights," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 82(1), pages 19-30, August.
    2. Igor Averbakh & Oded Berman, 1995. "Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree," Transportation Science, INFORMS, vol. 29(2), pages 184-197, May.
    3. Robert C. Burness & John A. White, 1976. "The Traveling Salesman Location Problem," Transportation Science, INFORMS, vol. 10(4), pages 348-360, November.
    4. David Simchi-Levi & Oded Berman, 1988. "A Heuristic Algorithm for the Traveling Salesman Location Problem on Networks," Operations Research, INFORMS, vol. 36(3), pages 478-484, June.
    5. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    6. Berman, O. & Simchi-Levi, D., 1988. "Minisum location of a travelling salesman on simple networks," European Journal of Operational Research, Elsevier, vol. 36(2), pages 241-250, August.
    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. Nagy, Gabor & Salhi, Said, 2007. "Location-routing: Issues, models and methods," European Journal of Operational Research, Elsevier, vol. 177(2), pages 649-672, March.
    2. Hunkar Toyoglu & Oya Ekin Karasan & Bahar Yetis Kara, 2011. "Distribution network design on the battlefield," Naval Research Logistics (NRL), John Wiley & Sons, vol. 58(3), pages 188-209, April.
    3. Mina, Hokey & Jayaraman, Vaidyanathan & Srivastava, Rajesh, 1998. "Combined location-routing problems: A synthesis and future research directions," European Journal of Operational Research, Elsevier, vol. 108(1), pages 1-15, July.
    4. Ahmadi-Javid, Amir & Amiri, Elahe & Meskar, Mahla, 2018. "A Profit-Maximization Location-Routing-Pricing Problem: A Branch-and-Price Algorithm," European Journal of Operational Research, Elsevier, vol. 271(3), pages 866-881.
    5. Luca Bertazzi & Francesca Maggioni, 2015. "Solution Approaches for the Stochastic Capacitated Traveling Salesmen Location Problem with Recourse," Journal of Optimization Theory and Applications, Springer, vol. 166(1), pages 321-342, July.
    6. Lee, Chungmok & Han, Jinil, 2017. "Benders-and-Price approach for electric vehicle charging station location problem under probabilistic travel range," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 130-152.
    7. Saïd Salhi & Gábor Nagy, 2009. "Local improvement in planar facility location using vehicle routing," Annals of Operations Research, Springer, vol. 167(1), pages 287-296, March.
    8. Karaoglan, Ismail & Altiparmak, Fulya & Kara, Imdat & Dengiz, Berna, 2012. "The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach," Omega, Elsevier, vol. 40(4), pages 465-477.
    9. Berman, Oded & Drezner, Zvi & Wesolowsky, George O., 2007. "The transfer point location problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 978-989, June.
    10. Weijun Xie & Yanfeng Ouyang & Sze Chun Wong, 2016. "Reliable Location-Routing Design Under Probabilistic Facility Disruptions," Transportation Science, INFORMS, vol. 50(3), pages 1128-1138, August.
    11. Liu, Yubin & Ye, Qiming & Escribano-Macias, Jose & Feng, Yuxiang & Candela, Eduardo & Angeloudis, Panagiotis, 2023. "Route planning for last-mile deliveries using mobile parcel lockers: A hybrid q-learning network approach," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    12. Yang, Jun & Guo, Fang & Zhang, Min, 2017. "Optimal planning of swapping/charging station network with customer satisfaction," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 174-197.
    13. Park, Hyeongjun & Park, Dongjoo & Jeong, In-Jae, 2016. "An effects analysis of logistics collaboration in last-mile networks for CEP delivery services," Transport Policy, Elsevier, vol. 50(C), pages 115-125.
    14. Davood Shishebori & Lawrence Snyder & Mohammad Jabalameli, 2014. "A Reliable Budget-Constrained FL/ND Problem with Unreliable Facilities," Networks and Spatial Economics, Springer, vol. 14(3), pages 549-580, December.
    15. Sahar Validi & Arijit Bhattacharya & P. J. Byrne, 2020. "Sustainable distribution system design: a two-phase DoE-guided meta-heuristic solution approach for a three-echelon bi-objective AHP-integrated location-routing model," Annals of Operations Research, Springer, vol. 290(1), pages 191-222, July.
    16. Hashemi Doulabi, Seyed Hossein & Seifi, Abbas, 2013. "Lower and upper bounds for location-arc routing problems with vehicle capacity constraints," European Journal of Operational Research, Elsevier, vol. 224(1), pages 189-208.
    17. Capelle, Thomas & Cortés, Cristián E. & Gendreau, Michel & Rey, Pablo A. & Rousseau, Louis-Martin, 2019. "A column generation approach for location-routing problems with pickup and delivery," European Journal of Operational Research, Elsevier, vol. 272(1), pages 121-131.
    18. Alvarez, Jose A. Lopez & Buijs, Paul & Deluster, Rogier & Coelho, Leandro C. & Ursavas, Evrim, 2020. "Strategic and operational decision-making in expanding supply chains for LNG as a fuel," Omega, Elsevier, vol. 97(C).
    19. Eduardo Alarcon-Gerbier & Zarina Chokparova & Nassim Ghondaghsaz & Wanqi Zhao & Hani Shahmoradi-Moghadam & Uwe Aßmann & Orçun Oruç, 2022. "Software-Defined Mobile Supply Chains: Rebalancing Resilience and Efficiency in Production Systems," Sustainability, MDPI, vol. 14(5), pages 1-21, February.
    20. Kuby, Michael & Lim, Seow, 2005. "The flow-refueling location problem for alternative-fuel vehicles," Socio-Economic Planning Sciences, Elsevier, vol. 39(2), pages 125-145, June.

    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:spr:annopr:v:286:y:2020:i:1:d:10.1007_s10479-018-2812-4. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.