Solving the uncapacitated hub location problem using genetic algorithms
Computers and Operations Research
Aggregation in hub location problems
Computers and Operations Research
Hub Covering Location Problem under Capacity Constraints
AMS '10 Proceedings of the 2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation
The Dynamic Uncapacitated Hub Location Problem
Transportation Science
Hi-index | 0.00 |
The overcrowded airline hubs, an increase in time-conscious business travelers, and increase in fuel prices, have once again sparked the debate about the merits of current hub-and-spoke mode of airline routing versus direct point-to-point routing. In addition, there is now a need to consider two types of passengers---time conscious and cost conscious. In this paper, we present a detailed model for the passengers and the airlines. We propose a two-step heuristic approach to evaluate the viability of the choices, primarily keeping the passengers' interest in mind. In the first step, a genetic algorithm is employed to determine the hubs. The second step employs a deterministic algorithm to compare the costs under the two routing modes. We conclude that the passenger value of time and ticket cost, the waiting times at the intermediate hubs, and a discount cost factor for hub-to-hub and non-hub to hub travel are the critical factors for passengers to choose between hub-and-spoke and direct point-to-point flights.