TY - JOUR
T1 - The Travelling Salesman Problem with pick-up and delivery
AU - Mosheiov, Gur
PY - 1994/12/8
Y1 - 1994/12/8
N2 - Demand points for pick-up and delivery are located in the plane. A single vehicle of a given capacity performs both pick-ups and deliveries. The objective is to find the shortest feasible tour. A real life application is described. We compare this problem to the classic Travelling Salesman Problem. Based on their similarity we develop a simple heuristic consisting of pick-up and delivery along the travelling salesman tour. Asymptotic behavior and worst case analysis are provided. We then introduce an alternative solution method which is an extension of the well known Cheapest Insertion heuristic. Performance of both heuristics is tested on various-size simulated problems.
AB - Demand points for pick-up and delivery are located in the plane. A single vehicle of a given capacity performs both pick-ups and deliveries. The objective is to find the shortest feasible tour. A real life application is described. We compare this problem to the classic Travelling Salesman Problem. Based on their similarity we develop a simple heuristic consisting of pick-up and delivery along the travelling salesman tour. Asymptotic behavior and worst case analysis are provided. We then introduce an alternative solution method which is an extension of the well known Cheapest Insertion heuristic. Performance of both heuristics is tested on various-size simulated problems.
KW - Distribution
KW - General
KW - Heuristics
KW - Routing with pick-up and delivery
KW - Transportation
UR - http://www.scopus.com/inward/record.url?scp=0000289098&partnerID=8YFLogxK
U2 - 10.1016/0377-2217(94)90360-3
DO - 10.1016/0377-2217(94)90360-3
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0000289098
SN - 0377-2217
VL - 79
SP - 299
EP - 310
JO - European Journal of Operational Research
JF - European Journal of Operational Research
IS - 2
ER -