A multi-objective imperialist competitive algorithm for a capacitated hub covering location problem

Article history: Received 20 October 2010 Received in revised form 20 December 2010 Accepted 28 December 2010 Available online 28 December 2010 The hub location problem appears in a variety of applications, including airline systems, cargo delivery systems and telecommunication network design. Hub location problems deal with finding the location of hub facilities and the allocation of demand nodes to these located hub facilities. In this paper, a new model for the capacitated single allocation hub covering location problem is presented. Instead of using capacity constraints to limit the amount of flow received by the hubs, the second objective function is introduced to minimize service times in the hubs. The service time in the hubs includes the waiting time of received flows in a queue and the time to get services. Due to the NP-hardness of the problem, a new weight-based multi-objective imperialist competitive algorithm (MOICA) is designed to find near-optimal solutions. To validate the performance of the proposed algorithm, the solutions obtained by the MOICA are compared by the exact solutions of the mathematical programming model. © 2011 Growing Science Ltd. All rights reserved

[1]  Turgut Aykin,et al.  On the Location of Hub Facilities , 1988, Transp. Sci..

[2]  Andreas T. Ernst,et al.  Exact and heuristic algorithms for the uncapacitated multiple allocation p-hub median problem , 1998 .

[3]  Andreas T. Ernst,et al.  Hub Arc Location Problems: Part I - Introduction and Results , 2005, Manag. Sci..

[4]  Martine Labbé,et al.  Projecting the flow variables for hub location problems , 2004, Networks.

[5]  Iván A. Contreras,et al.  Tight bounds from a path based formulation for the tree of hub location problem , 2009, Comput. Oper. Res..

[6]  Sibel A. Alumur,et al.  The design of single allocation incomplete hub networks , 2009 .

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

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

[9]  T. Aykin.  On “a quadratic integer program for the location of interacting hub facilities” , 1990 .

[10]  N. Ghaffari-Nasaba,et al.  A variable neighborhood descent based heuristic to solve the capacitated location-routing problem , 2010 .

[11]  M. Aryanezhad,et al.  A multi-objective set covering problem: A case study of warehouse allocation in truck industry , 2011 .

[12]  Alfredo Marín,et al.  Formulating and solving splittable capacitated multiple allocation hub location problems , 2005, Comput. Oper. Res..

[13]  James F. Campbell.  Hub Location and the p-Hub Median Problem , 1996, Oper. Res..

[14]  Hande Yaman,et al.  Star p-hub median problem with modular arc capacities , 2008, Comput. Oper. Res..

[15]  Mir-Bahador Aryanezhad,et al.  A variable neighborhood descent based heuristic to solve the capacitated location-routing problem , 2011 .

[16]  Andreas T. Ernst,et al.  Solution algorithms for the capacitated single allocation hub location problem , 1999, Ann. Oper. Res..

[17]  D. Skorin-Kapov,et al.  Lower bounds for the hub location problem , 1995 .

[18]  Caro Lucas,et al.  Colonial competitive algorithm: A novel approach for PID controller design in MIMO distillation column process , 2008, Int. J. Intell. Comput. Cybern..

[19]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .

[20]  Iván A. Contreras,et al.  Lagrangean relaxation for the capacitated hub location problem with single assignment , 2009, OR Spectr..

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

[22]  Iván A. Contreras,et al.  The Tree of Hubs Location Problem , 2010, Eur. J. Oper. Res..

[23]  Andreas T. Ernst,et al.  An Exact Solution Approach Based on Shortest-Paths for p-Hub Median Problems , 1998, INFORMS J. Comput..

[24]  João C. N. Clímaco,et al.  Capacitated single allocation hub location problem - A bi-criteria approach , 2008, Comput. Oper. Res..

[25]  Stefan Nickel,et al.  Hub Location Problems in Urban Traffic Networks , 2001 .

[26]  Margaret J. Robertson,et al.  Design and Analysis of Experiments , 2006, Handbook of statistics.

[27]  T. Aykin.  Lagrangian relaxation based approaches to capacitated hub-and-spoke network design problem , 1994 .

[28]  Andreas T. Ernst,et al.  Preprocessing and cutting for multiple allocation hub location problems , 2004, Eur. J. Oper. Res..

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

[30]  Andreas T. Ernst,et al.  The capacitated multiple allocation hub location problem: Formulations and algorithms , 2000, Eur. J. Oper. Res..