An evolutionary-based approach for solving a capacitated hub location problem

This paper addresses the capacitated hub location problem (CHLP), which is a variant of the classical capacitated hub problem. What is presented is a modified mixed integer linear programming (MILP) formulation for the CHLP. This modified formulation includes fewer variables and constraints compared to the existing problem formulations in the literature. We propose two evolutionary algorithms (EAs) that use binary encoding and standard genetic operators adapted to the problem. The overall performance of both EA implementations is improved by a caching technique. In order to solve large-scale instances within reasonable time, the second EA also uses a newly designed heuristic to approximate the objective function value. The presented computational study indicates that the first EA reaches optimal solutions for all smaller and medium-size problem instances. The second EA obtains high-quality solutions for larger problem dimensions and provides solutions for large-scale instances that have not been addressed in the literature so far.

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

[2]  Inmaculada Rodríguez Martín,et al.  Solving a capacitated hub location problem , 2008, Eur. J. Oper. Res..

[3]  K. N. Ramachandran Nair,et al.  A fuzzy-driven genetic algorithm for sequence segmentation applied to genomic sequences , 2009, Appl. Soft Comput..

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

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

[6]  Zbigniew Michalewicz,et al.  Genetic algorithms + data structures = evolution programs (2nd, extended ed.) , 1994 .

[7]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[8]  Zorica Stanimirović,et al.  An efficient genetic algorithm for the uncapacitated multiple allocation p-hub median problem , 2008 .

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

[10]  Keivan Ghoseiri,et al.  A hybrid genetic algorithm for multi-depot homogenous locomotive assignment with time windows , 2010, Appl. Soft Comput..

[11]  Jozef Kratica,et al.  Solving the Maximally Balanced Connected Partition Problem in Graphs by Using Genetic Algorithm , 2008, Comput. Informatics.

[12]  Horst W. Hamacher,et al.  Adapting polyhedral properties from facility to hub location problems , 2004, Discret. Appl. Math..

[13]  Juan-José Salazar-González,et al.  An iterated local search heuristic for a capacitated hub location problem , 2006 .

[14]  Reza Kerachian,et al.  Deriving operating policies for multi-objective reservoir systems: Application of Self-Learning Genetic Algorithm , 2010, Appl. Soft Comput..

[15]  Pierluigi Crescenzi,et al.  Approximation on the Web: A Compendium of NP Optimization Problems , 1997, RANDOM.

[16]  Zorica Stanimirović,et al.  Solving the Capacitated Single Allocation Hub Location Problem Using Genetic Algorithm , 2007 .

[17]  M. Cangalovic,et al.  COMPUTING STRONG METRIC DIMENSION OF SOME SPECIAL CLASSES OF GRAPHS BY GENETIC ALGORITHMS , 2008 .

[18]  Wolfgang Banzhaf,et al.  An informed genetic algorithm for the examination timetabling problem , 2010, Appl. Soft Comput..

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

[20]  Zorica Stanimirovic,et al.  A Genetic Algorithm Approach for the Capacitated Single Allocation P-Hub Median Problem , 2012, Comput. Informatics.

[21]  Masao Fukushima,et al.  ON THE HUB-AND-SPOKE MODEL WITH ARC CAPACITY CONATRAINTS , 2003 .

[22]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[23]  Jozef Kratica,et al.  Computing minimal doubly resolving sets of graphs , 2009, Comput. Oper. Res..

[24]  Zbigniew Michalewicz,et al.  Genetic Algorithms + Data Structures = Evolution Programs , 1996, Springer Berlin Heidelberg.

[25]  Vladimir Filipovic,et al.  Fine-grained Tournament Selection Operator in Genetic Algorithms , 2003, Comput. Artif. Intell..

[26]  Chun-Liang Lin,et al.  Structure-specified IIR filter and control design using real structured genetic algorithm , 2009, Appl. Soft Comput..

[27]  M. Maric.  An Efficient Genetic Algorithm for Solving the Multi-Level Uncapacitated Facility Location Problem , 2010, Comput. Informatics.

[28]  Jozef Kratica,et al.  Computing the metric dimension of graphs by genetic algorithms , 2009, Comput. Optim. Appl..

[29]  Anupam Ojha,et al.  A solid transportation problem for an item with fixed charge, vechicle cost and price discounted varying charge using genetic algorithm , 2010, Appl. Soft Comput..

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

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

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

[33]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[34]  Jozef Kratica,et al.  Improving Performances of the Genetic Algorithm by Caching , 1999, Comput. Artif. Intell..

[35]  Jozef Kratica,et al.  Discrete Optimization Two genetic algorithms for solving the uncapacitated single allocation p-hub median problem , 2007 .