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

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

doi:10.1016/0377-2217(85)90257-7

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

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

Research output: Contribution to journal › Article › peer-review

71 Scopus citations

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 language	English (US)
Pages (from-to)	377-386
Number of pages	10
Journal	European Journal of Operational Research
Volume	22
Issue number	3
DOIs	https://doi.org/10.1016/0377-2217(85)90257-7
State	Published - Dec 1985
Externally published	Yes

Keywords

Scheduling
combinatorial analysis
transportation

Access

10.1016/0377-2217(85)90257-7

OpenUrl availability

Full text

Cite this

@article{30671058f5bd46b088f2f4ed00b5d297,

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.",

keywords = "Scheduling, combinatorial analysis, transportation",

author = "Bahman Kalantari and Hill, {Arthur V.} and Arora, {Sant R.}",

year = "1985",

month = dec,

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",

}

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/12

Y1 - 1985/12

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.

KW - Scheduling

KW - combinatorial analysis

KW - transportation

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

AN - SCOPUS:0022413468

SN - 0377-2217

VL - 22

SP - 377

EP - 386

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 3

ER -

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

Abstract

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this