An integral constrained generalized hub-and-spoke network design problem
The hub-and-spoke network design problem determines the smallest fleet size with their routes and freight paths to minimize operating costs. We proposed a generalized hub-and-spoke network in a capacitated and directed network configuration that integrates the operations of three common hub-and-spoke networks: pure, stopover and center directs. An implicit enumeration algorithm with embedded integrally constrained multi-commodity min-cost flow was developed. Tested using the FedEx AsiaOne air network, the solution showed that the generalized network structure provided an operational flexibility, using center directs, topoffs/drop-offs, transits and rehandling via hubs, to determine the most cost-effective operations plan.
Year of publication: |
2008
|
---|---|
Authors: | Lin, Cheng-Chang ; Chen, Sheu-Hua |
Published in: |
Transportation Research Part E: Logistics and Transportation Review. - Elsevier, ISSN 1366-5545. - Vol. 44.2008, 6, p. 986-1003
|
Publisher: |
Elsevier |
Keywords: | Freight transportation Network design Hub-and-spoke networks Implicit enumeration algorithm |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
An integral constrained generalized hub-and-spoke network design problem
Lin, Cheng-Chang, (2008)
-
An integral constrained generalized hub-and-spoke network design problem
Lin, Cheng-Chang, (2008)
-
The hierarchical network design problem for time-definite express common carriers
Lin, Cheng-Chang, (2004)
- More ...