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

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 sales...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Annals of operations research 2020-03, Vol.286 (1-2), p.635-648
Hauptverfasser:	Averbakh, Igor, Yu, Wei
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Business and Management Combinatorial optimization Combinatorics Customer services Customers Mathematical research Operations research Operations Research/Decision Theory S.i.: Claio 2016 Studies Theory of Computation Traveling salesman problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!