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

57 Citations (Scopus)

Abstract

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
Volume22
Issue number3
DOIs
StatePublished - Jan 1 1985

Fingerprint

Pickup and Delivery
Traveling salesman problem
Pickups
Travelling salesman problems
Customers
Finite Capacity
Branch and Bound Algorithm
Computational Results
Pickup and delivery

All Science Journal Classification (ASJC) codes

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

Cite this

@article{159f70201f8c4c208c979d232304b594,
title = "An algorithm for the traveling salesman problem with pickup and delivery customers",
abstract = "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.",
author = "Bahman Kalantari and Hill, {Arthur V.} and Arora, {Sant R.}",
year = "1985",
month = "1",
day = "1",
doi = "10.1016/0377-2217(85)90257-7",
language = "English (US)",
volume = "22",
pages = "377--386",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "3",

}

An algorithm for the traveling salesman problem with pickup and delivery customers. / Kalantari, Bahman; Hill, Arthur V.; Arora, Sant R.

In: European Journal of Operational Research, Vol. 22, No. 3, 01.01.1985, p. 377-386.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Kalantari, Bahman

AU - Hill, Arthur V.

AU - Arora, Sant R.

PY - 1985/1/1

Y1 - 1985/1/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=0022413468&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0022413468&partnerID=8YFLogxK

U2 - 10.1016/0377-2217(85)90257-7

DO - 10.1016/0377-2217(85)90257-7

M3 - Article

VL - 22

SP - 377

EP - 386

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 3

ER -