1991
DOI: 10.1016/0377-2217(91)90319-q
|View full text |Cite
|
Sign up to set email alerts
|

The pickup and delivery problem with time windows

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
288
0
1

Year Published

1998
1998
2019
2019

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 529 publications
(289 citation statements)
references
References 18 publications
0
288
0
1
Order By: Relevance
“…Assuming a homogeneous container type and size, the problem is to find an assignment of delivery and pickup customers to a fleet of vehicles, in order to minimize the total cost of serving all customers, which includes fixed vehicle costs and travelling costs. In accordance with Dumas et al (1991), a fixed vehicle cost is introduced to minimize the fleet size. Each vehicle used incurs a fixed cost, which may vary with the vehicle.…”
Section: Problem Formulationmentioning
confidence: 99%
“…Assuming a homogeneous container type and size, the problem is to find an assignment of delivery and pickup customers to a fleet of vehicles, in order to minimize the total cost of serving all customers, which includes fixed vehicle costs and travelling costs. In accordance with Dumas et al (1991), a fixed vehicle cost is introduced to minimize the fleet size. Each vehicle used incurs a fixed cost, which may vary with the vehicle.…”
Section: Problem Formulationmentioning
confidence: 99%
“…I n this way the feasible routes are generated on the y as needed and only a small fraction of all feasible routes is used to solve LP. Dumas, Desrosiers and Soumis 1991] were the rst to develop and implement a branch-and-price algorithm for the pickup and delivery problem with time windows. Our branch-and-price algorithm di ers from theirs in various aspects.…”
Section: A Branch-and-price Algorithmmentioning
confidence: 99%
“…A dynamic programming algorithm using labeling techniques to handle the precedence, capacity and time constraints, can be used to solve this shortest path problem Dumas, Desrosiers, and Soumis 1991]. However, for instances with many transportation requests and time and capacity constraints that are not very tight, solving S k to optimality becomes computationally prohibitive.…”
Section: The Pricing Problemmentioning
confidence: 99%
“…Less-than-truckload PDP may also be formulated for planning problems where goods need to be transported between pickup and delivery locations. Dumas et al (1991) present an exact solution for this class of PDP based on column generation. Heuristic solutions can be found in Nanry and Barnes (2000), Landrieu et al (2001), Lu and Dessouky (2006) and Bent and Van Hentenryck (2006).…”
Section: Related Literaturementioning
confidence: 99%
“…Assuming a homogeneous container type and size, the problem is to find an assignment of delivery and pickup customer pairs to a fleet of vehicles, in order to minimize the total cost of serving all customers, which includes fixed vehicle costs and travelling costs. In accordance with Dumas et al (1991), a fixed vehicle cost is introduced to minimize the fleet size. Each vehicle used incurs a fixed cost, which may vary with the vehicle.…”
Section: Problem Definitionmentioning
confidence: 99%