Benders decomposition for the uncapacitated multiple allocation hub location problem
Computers and Operations Research
Editorial: New developments on hub location
Computers and Operations Research
A conditional p-hub location problem with attraction functions
Computers and Operations Research
Computers and Industrial Engineering
Hi-index | 0.01 |
We propose a new hub location model defined by the minimization of costs. The main contribution of this work is to permit the analysis of a hub-and-spoke network operated under ''decentralized management''. In this type of network, various transport companies act independently, and each makes its route choices according to its own criteria, which can include cost, time, frequency, security and other factors, including subjective ones. Therefore, due to the diversity of the various companies' criteria, one can expect that between each origin-destination pair, a fraction of the flow will be carried through hubs and a fraction will be carried by the direct route. to resolve this problem, it becomes necessary to determine the probability that any network user will choose the hub route for each trip to be made (or for each load to be carried). We present an integer programming formulation, subject the new model to experiments with an intermodal general cargo network in Brazil and address questions regarding the solution of the problem in practice.