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

Igor Averbakh () and Wei Yu ()
Additional contact information
Igor Averbakh: University of Toronto Scarborough
Wei Yu: East China University of Science and Technology

Annals of Operations Research, 2020, vol. 286, issue 1, No 27, 635-648

Abstract: 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.

Keywords: Traveling salesmen location problem; Probabilistic location-routing; Network algorithms (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10479-018-2812-4 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:286:y:2020:i:1:d:10.1007_s10479-018-2812-4

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-018-2812-4

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().