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!

Schreiben Sie den ersten Kommentar!