Solving a new stochastic multi-mode p-hub covering location problem considering risk by a novel multi-objective algorithm

Abstract In this paper, we develop a novel stochastic multi-objective multi-mode transportation model for hub covering location problem under uncertainty. The transportation time between each pair of nodes is an uncertain parameter and also is influenced by a risk factor in the network. We extend the traditional comprehensive hub location problem by considering two new objective functions. So, our multi-objective model includes (i) minimization of total current investment costs and (ii) minimization of maximum transportation time between each origin–destination pair in the network. Besides, a novel multi-objective imperialist competitive algorithm (MOICA) is proposed to obtain the Pareto-optimal solutions of the problem. The performance of the proposed solution algorithm is compared with two well-known meta-heuristics, namely, non-dominated sorting genetic algorithm (NSGA-II) and Pareto archive evolution strategy (PAES). Computational results show that MOICA outperforms the other meta-heuristics.

[1]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

[2]  Barrett W. Thomas,et al.  The stochastic p-hub center problem with service-level constraints , 2009, Comput. Oper. Res..

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

[4]  Vladimir Marianov,et al.  Location models for airline hubs behaving as M/D/c queues , 2003, Comput. Oper. Res..

[5]  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..

[6]  Bo Qu,et al.  Path relinking approach for multiple allocation hub maximal covering problem , 2009, Comput. Math. Appl..

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

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

[9]  Gilbert Laporte,et al.  Stochastic uncapacitated hub location , 2011, Eur. J. Oper. Res..

[10]  Fariborz Jolai,et al.  An M/M/c queue model for hub covering location problem , 2011, Math. Comput. Model..

[11]  D. Skorin-Kapov,et al.  On tabu search for the location of interacting hub facilities , 1994 .

[12]  Claudio B. Cunha,et al.  A genetic algorithm for the problem of configuring a hub-and-spoke network for a LTL trucking company in Brazil , 2007, Eur. J. Oper. Res..

[13]  Caro Lucas,et al.  Colonial Competitive Algorithm as a Tool for Nash Equilibrium Point Achievement , 2008, ICCSA.

[14]  Martin J. Oates,et al.  The Pareto Envelope-Based Selection Algorithm for Multi-objective Optimisation , 2000, PPSN.

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

[16]  Marcus Randall,et al.  Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation , 2008, Comput. Optim. Appl..

[17]  Kamran Rezaie,et al.  Solving the integrated product mix-outsourcing problem using the Imperialist Competitive Algorithm , 2010, Expert Syst. Appl..

[18]  F. S. Pamuk,et al.  A solution to the hub center problem via a single-relocation algorithm with tabu search , 2001 .

[19]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[20]  Reza Tavakkoli-Moghaddam,et al.  A new support vector model-based imperialist competitive algorithm for time estimation in new product development projects , 2013 .

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

[22]  Jeng-Fung Chen,et al.  A hybrid heuristic for the uncapacitated single allocation hub location problem , 2007 .

[23]  Ta-Hui Yang,et al.  Stochastic air freight hub location and flight routes planning , 2009 .