An algorithm for the traveling salesman problem with pickup and delivery customers

Bahman Kalantari, Arthur V. Hill, Sant R. Arora

Research output: Contribution to journalArticle

60 Scopus citations


The paper extends the branch and bound algorithm of Little, Murty, Sweeney, and Karel to the traveling salesman problem with pickup and delivery customers, where each pickup customer is required to be visited before its associated delivery customer. The problems considered include single and multiple vehicle cases as well as infinite and finite capacity cases. Computational results are reported.

Original languageEnglish (US)
Pages (from-to)377-386
Number of pages10
JournalEuropean Journal of Operational Research
Issue number3
StatePublished - Dec 1985


All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management


  • Scheduling
  • combinatorial analysis
  • transportation

Cite this