An integral constrained generalized hub-and-spoke network design problem
Cheng-Chang Lin and
Sheu-Hua Chen
Transportation Research Part E: Logistics and Transportation Review, 2008, vol. 44, issue 6, 986-1003
Abstract:
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.
Keywords: Freight; transportation; Network; design; Hub-and-spoke; networks; Implicit; enumeration; algorithm (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations: View citations in EconPapers (16)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S1366554508000173
Full text for ScienceDirect subscribers only
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:transe:v:44:y:2008:i:6:p:986-1003
Ordering information: This journal article can be ordered from
http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/bibliographic
http://www.elsevier. ... 600244/bibliographic
Access Statistics for this article
Transportation Research Part E: Logistics and Transportation Review is currently edited by W. Talley
More articles in Transportation Research Part E: Logistics and Transportation Review from Elsevier
Bibliographic data for series maintained by Catherine Liu ().