The multiple bottleneck transportation problem

Bill Wild; Kirk R. Karwan; Mark H. Karwan

doi:10.1016/0305-0548(93)90003-2

The multiple bottleneck transportation problem

Bill Wild
, Kirk R. Karwan
, Mark H. Karwan

Department of Industrial and Systems Engineering

RAND Corporation
University of South Carolina

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

7 Scopus citations

Abstract

An extension to the Bottleneck Transportation Problem (BTP) is considered wherein a bottleneck is computed for each demand point. Due to the existence of local optima, solution procedures that have been developed for BTP do not readily apply to the Multiple Bottleneck Problem (MTP). An effective solution technique that uses Lagrangean relaxation methods is described and tested. One of the keys to the algorithm is a unique "double bounding" technique derived from the special structure of MTP.

Original language	English
Pages (from-to)	261-274
Number of pages	14
Journal	Computers and Operations Research
Volume	20
Issue number	3
DOIs	https://doi.org/10.1016/0305-0548(93)90003-2
State	Published - Apr 1993

Access to Document

10.1016/0305-0548(93)90003-2

Cite this

@article{6a8b1ff0809546d4accece2d4959e5a9,

title = "The multiple bottleneck transportation problem",

abstract = "An extension to the Bottleneck Transportation Problem (BTP) is considered wherein a bottleneck is computed for each demand point. Due to the existence of local optima, solution procedures that have been developed for BTP do not readily apply to the Multiple Bottleneck Problem (MTP). An effective solution technique that uses Lagrangean relaxation methods is described and tested. One of the keys to the algorithm is a unique {"}double bounding{"} technique derived from the special structure of MTP.",

author = "Bill Wild and Karwan, \{Kirk R.\} and Karwan, \{Mark H.\}",

year = "1993",

month = apr,

doi = "10.1016/0305-0548(93)90003-2",

language = "English",

volume = "20",

pages = "261--274",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd",

number = "3",

}

TY - JOUR

T1 - The multiple bottleneck transportation problem

AU - Wild, Bill

AU - Karwan, Kirk R.

AU - Karwan, Mark H.

PY - 1993/4

Y1 - 1993/4

N2 - An extension to the Bottleneck Transportation Problem (BTP) is considered wherein a bottleneck is computed for each demand point. Due to the existence of local optima, solution procedures that have been developed for BTP do not readily apply to the Multiple Bottleneck Problem (MTP). An effective solution technique that uses Lagrangean relaxation methods is described and tested. One of the keys to the algorithm is a unique "double bounding" technique derived from the special structure of MTP.

AB - An extension to the Bottleneck Transportation Problem (BTP) is considered wherein a bottleneck is computed for each demand point. Due to the existence of local optima, solution procedures that have been developed for BTP do not readily apply to the Multiple Bottleneck Problem (MTP). An effective solution technique that uses Lagrangean relaxation methods is described and tested. One of the keys to the algorithm is a unique "double bounding" technique derived from the special structure of MTP.

UR - https://www.scopus.com/pages/publications/0027573037

U2 - 10.1016/0305-0548(93)90003-2

DO - 10.1016/0305-0548(93)90003-2

M3 - Article

AN - SCOPUS:0027573037

SN - 0305-0548

VL - 20

SP - 261

EP - 274

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 3

ER -

The multiple bottleneck transportation problem

Abstract

Access to Document

Other files and links

Fingerprint

Cite this