TY - JOUR
T1 - The traveling salesman problem with delivery and backhauls
AU - Anily, Shoshana
AU - Mosheiov, Gur
PY - 1994/8
Y1 - 1994/8
N2 - The problem that we consider here deals with a single vehicle of a given capacity that needs to serve N customers: some of the customers require a delivery of stock from the warehouse, whereas others need to deliver stock from their location to the warehouse. The objective is to find a shortest feasible tour visiting all customers, emanating from and ending at the warehouse. We introduce an efficient (O(N2)) heuristic for this problem. The heuristic improves the worst-case bound known in the literature from 2.5 to 2. However, its average performance is shown in our numerical study to be slightly worse than that of a previously published (O(N3)) solution method.
AB - The problem that we consider here deals with a single vehicle of a given capacity that needs to serve N customers: some of the customers require a delivery of stock from the warehouse, whereas others need to deliver stock from their location to the warehouse. The objective is to find a shortest feasible tour visiting all customers, emanating from and ending at the warehouse. We introduce an efficient (O(N2)) heuristic for this problem. The heuristic improves the worst-case bound known in the literature from 2.5 to 2. However, its average performance is shown in our numerical study to be slightly worse than that of a previously published (O(N3)) solution method.
KW - Computational complexity
KW - Heuristic
KW - Traveling salesman problem
KW - Vehicle routing
KW - Worst-case analysis
UR - http://www.scopus.com/inward/record.url?scp=0028493374&partnerID=8YFLogxK
U2 - 10.1016/0167-6377(94)90016-7
DO - 10.1016/0167-6377(94)90016-7
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0028493374
SN - 0167-6377
VL - 16
SP - 11
EP - 18
JO - Operations Research Letters
JF - Operations Research Letters
IS - 1
ER -