The Travelling Salesman Problem with pick-up and delivery

Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

118 Scopus citations


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.

Original languageAmerican English
Pages (from-to)299-310
Number of pages12
JournalEuropean Journal of Operational Research
Issue number2
StatePublished - 8 Dec 1994


  • Distribution
  • General
  • Heuristics
  • Routing with pick-up and delivery
  • Transportation


Dive into the research topics of 'The Travelling Salesman Problem with pick-up and delivery'. Together they form a unique fingerprint.

Cite this