The freight routing problem of time-definite freight delivery common carriers

The freight routing problem of time-definite common carriers is to minimize the sum of handling and transportation costs, while meeting service commitments and operational restrictions. There are two types of operational restrictions, capacity and directed in-tree rooted at each destination. Directe...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Transportation research. Part B: methodological Jg. 35; H. 6; S. 525 - 547
1. Verfasser: Lin, Cheng-Chang
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Kidlington Elsevier Ltd 01.07.2001
Elsevier
Schriftenreihe:Transportation Research Part B: Methodological
Schlagworte:
Applied sciences
Exact sciences and technology
Ground, air and sea transportation, marine construction
Hub-and-spoke network
Implicit enumeration algorithm
Lagrangian relaxation
Road transportation and traffic
Time-definite freight delivery industry
Transportation planning, management and economics
Hub-and-spoke network
Implicit enumeration algorithm
Time-definite freight delivery industry
Lagrangian relaxation
Delivery (good)
Road transportation
Relaxation
Implicit enumeration method
Example
Routing
Numerical simulation
Mathematical model
Algorithm
Lagrange equation
Freight transportation
ISSN:0191-2615, 1879-2367
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The freight routing problem of time-definite common carriers is to minimize the sum of handling and transportation costs, while meeting service commitments and operational restrictions. There are two types of operational restrictions, capacity and directed in-tree rooted at each destination. Directed in-tree implicitly implies that there is a singular path for each origin–destination pair. The routing problem is an integrality constrained multi-commodity problem with side constraints. In this research, we study two approaches, the Lagrangian relaxation (LR) and implicit enumeration algorithm with ε-optimality (IE- ε). We use the third largest time-definite freight delivery common carrier in Taiwan for our numerical test. The result shows that the IE- ε outperforms the LR, both quantitatively and qualitatively. In addition, two major shortcomings of the LR approach are shown: it may fail to find any feasible solutions even though they exist, and it cannot determine whether the feasible set is empty or not.
ISSN:0191-2615
1879-2367
DOI:10.1016/S0191-2615(00)00008-4