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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Transportation research. Part B: methodological Ročník 35; číslo 6; s. 525 - 547
Hlavný autor:	Lin, Cheng-Chang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Kidlington Elsevier Ltd 01.07.2001 Elsevier
Edícia:	Transportation Research Part B: Methodological
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!