A simulated annealing-based heuristic for the single allocation maximal covering hub location problem

Hub location problem is one of the most important problems in the areas of logistics and telecommunication network design. In this paper, we address the single allocation maximal covering hub location problem in which the objective is to maximise the amount of covered flows associated with origin-destination pairs in a hub-and-spoke network using a fixed number of hub facilities. Two mathematical programming formulations are developed for the problem and since the problem belongs to the class of NP-hard problems, an efficient simulated annealing (SA)-based heuristic is proposed to solve it. Computational results indicate the efficiency of the proposed heuristic both in terms of solution quality and CPU time.

[1]  Mehrdad Mohammadi,et al.  Hub Covering Location Problem under Capacity Constraints , 2010, 2010 Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation.

[2]  Andreas T. Ernst,et al.  Hub location problems , 2002 .

[3]  Bahar Y. Kara,et al.  A hub covering model for cargo delivery systems , 2007 .

[4]  Haluk Topcuoglu,et al.  Solving the uncapacitated hub location problem using genetic algorithms , 2005, Comput. Oper. Res..

[5]  Sibel A. Alumur,et al.  Network hub location problems: The state of the art , 2008, Eur. J. Oper. Res..

[6]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[7]  Munirpallam A. Venkataramanan,et al.  Solution approaches to hub location problems , 1998, Ann. Oper. Res..

[8]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[9]  James F. Campbell,et al.  Integer programming formulations of discrete hub location problems , 1994 .

[10]  B. Wagner,et al.  Model formulations for hub covering problems , 2008, J. Oper. Res. Soc..

[11]  J. G. Klincewicz,et al.  Avoiding local optima in thep-hub location problem using tabu search and GRASP , 1993, Ann. Oper. Res..

[12]  Chao Yang,et al.  Two Artificial Intelligence Heuristics in Solving Multiple Allocation Hub Maximal Covering Problem , 2006, ICIC.

[13]  Bahar Yetis Kara,et al.  The single-assignment hub covering problem: Models and linearizations , 2003, J. Oper. Res. Soc..

[14]  Sue Abdinnour-Helm,et al.  Using simulated annealing to solve the p‐Hub Median Problem , 2001 .

[15]  J. G. Klincewicz,et al.  Heuristics for the p-hub location problem , 1991 .

[16]  Claudio B. Cunha,et al.  New simple and efficient heuristics for the uncapacitated single allocation hub location problem , 2009, Comput. Oper. Res..

[17]  D. Skorin-Kapov,et al.  Tight linear programming relaxations of uncapacitated p-hub median problems , 1996 .

[18]  Andreas T. Ernst,et al.  Efficient algorithms for the uncapac-itated single allocation p-hub median problem , 1996 .

[19]  Sibel A. Alumur,et al.  A tabu-search based heuristic for the hub covering problem over incomplete hub networks , 2009, Comput. Oper. Res..

[20]  Sibel A. Alumur,et al.  A hub covering network design problem for cargo applications in Turkey , 2009, J. Oper. Res. Soc..

[21]  Gerhard J. Woeginger,et al.  Uncapacitated single and multiple allocation p-hub center problems , 2009, Comput. Oper. Res..

[22]  Shaofeng Liu,et al.  Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , 2006 .

[23]  Nenad Mladenovic,et al.  A general variable neighborhood search for solving the uncapacitated single allocation p-hub median problem , 2009, Eur. J. Oper. Res..

[24]  Sue Abdinnour-Helm,et al.  A hybrid heuristic for the uncapacitated hub location problem , 1998, Eur. J. Oper. Res..

[25]  M. O'Kelly,et al.  A quadratic integer program for the location of interacting hub facilities , 1987 .

[26]  Bahar Yetis Kara,et al.  The Latest Arrival Hub Location Problem , 2001, Manag. Sci..