Premium
Mode Choice in a Hub‐and‐Spoke Network: A Zero‐One Linear Programming Approach
Author(s) -
O'Kelly M. E.,
Lao Yong
Publication year - 1991
Publication title -
geographical analysis
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.773
H-Index - 65
eISSN - 1538-4632
pISSN - 0016-7363
DOI - 10.1111/j.1538-4632.1991.tb00240.x
Subject(s) - truck , schedule , integer programming , mode (computer interface) , computer science , linear programming , operations research , modal , spoke hub distribution paradigm , network planning and design , mathematical optimization , transport engineering , computer network , engineering , mathematics , algorithm , chemistry , polymer chemistry , aerospace engineering , operating system
While research has tackled the hub‐and‐spoke network design problem, that research has overlooked the air‐truck modal integration issue which is a common feature of real express delivery systems. This paper devises integer linear programs to represent the mode and route assignment aspects of the operational problem. The model is solved under four different levels of delivery schedule, and the results show that as the promised delivery schedule is relaxed, not only does the use of truck routes become more desirable, but also interesting adjustments in mode and hub assignment occur. Consider the case of hubs in Los Angeles and Dayton. As the time constraints are relaxed, cities such as Minneapolis and New Orleans originally linked by air to Los Angeles, switch to Dayton because cheaper truck routes become feasible.