2003
DOI: 10.1057/palgrave.jors.2601534
|View full text |Cite
|
Sign up to set email alerts
|

Exact and heuristic methods for a full-load, multi-terminal, vehicle scheduling problem with backhauling and time windows

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
9
0

Year Published

2007
2007
2017
2017

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 22 publications
(9 citation statements)
references
References 10 publications
0
9
0
Order By: Relevance
“…In their Pickup and Delivery Problem with Time Windows (PDPTW) goods are transported between customer locations, as opposed to our problem definition where all containers either originate or return to the terminal. A full truckload PDPTW is also considered by Currie and Salhi (2003) and Currie and Salhi (2004). The problem studied in these papers also differs from our setting with respect to the definition of customer requests.…”
Section: Introductionmentioning
confidence: 99%
“…In their Pickup and Delivery Problem with Time Windows (PDPTW) goods are transported between customer locations, as opposed to our problem definition where all containers either originate or return to the terminal. A full truckload PDPTW is also considered by Currie and Salhi (2003) and Currie and Salhi (2004). The problem studied in these papers also differs from our setting with respect to the definition of customer requests.…”
Section: Introductionmentioning
confidence: 99%
“…Another application presented by Currie and Salhi () is a full‐load PDP with time windows. They have heterogeneous vehicles and products.…”
Section: Single Region Problemsmentioning
confidence: 99%
“…Even though the work deals only with a simple vehicle routing problem, it is mentioned because of the region-based solution approach that makes it interesting for our topic. Another application presented by Currie and Salhi (2003) is a full-load PDP with time windows. They have heterogeneous vehicles and products.…”
Section: Single Region Problemsmentioning
confidence: 99%
“…Consequently the lower bound represents the variable costs of optimally combining delivery customers with pickup customers, but underestimates the number of vehicles necessary to perform the selected trips. A similar approach for calculating a lower bound is proposed by Currie and Salhi (2003). The authors relax either the integrality constraints or time window constraints to evaluate their heuristics.…”
Section: Inmentioning
confidence: 99%