Hub Location Under Capacity Constraints

Hub-and-spoke networks are employed in cargo transportation. This paper presents a model for hub location in these kinds of networks. Hubs are considered capacity limited. For that reason, costs due to congestion in hubs are introduced into the model. A Simulated Annealing algorithm has been developed to solve the model. The algorithm includes a balanced module, the purpose of which is to reduce congestion. Each hub is modelled as an M/M/1 queuing system. The algorithm has been tested in randomly created networks. The results show that when a situation of congestion occurs, the proposed algorithm enables better solutions to be found, thereby improving the standard of service.

• Record URL:
  • http://www.sciencedirect.com/science/article/B6VHF-4JRKD6Y-1/2/f56cf80c6120883f0830243b7d5ee134
• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/13665545
• Supplemental Notes:
  • Abstract reprinted with permission from Elsevier
• Authors:
  • Rodriguez, V
  • Alvarez, M J
  • Barcos, L
• Publication Date: 2007-9

Language

• English

Media Info

• Media Type: Print
• Features: Figures; References; Tables;
• Pagination: pp 495-505
• Serial:
  • Transportation Research Part E: Logistics and Transportation Review
  • Volume: 43
  • Issue Number: 5
  • Publisher: Elsevier
  • ISSN: 1366-5545
  • Serial URL: http://www.sciencedirect.com/science/journal/13665545

Subject/Index Terms

• TRT Terms: Algorithms; Cargo handling; Costs; Hub and spoke systems; Hubs; Mathematical models; Simulated annealing; Traffic congestion
• Subject Areas: Aviation; Finance; Freight Transportation; Terminals and Facilities;

Filing Info

• Accession Number: 01055959
• Record Type: Publication
• Files: TRIS
• Created Date: Aug 29 2007 7:56AM