The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach

In this work we address the Hop-Constrained Minimum cost Flow Spanning Tree (HMFST) problem with nonlinear costs. The HMFST problem is an extension of the Hop-Constrained Minimum Spanning Tree problem since it considers flow requirements other than unit flows. We propose a hybrid heuristic, based on ant colony optimization and on local search, to solve this class of problems given its combinatorial nature and also that the total costs are nonlinearly flow dependent with a fixed-charge component. We solve a set of benchmark problems available online and compare the results obtained with the ones reported in the literature for a Multi-Population hybrid biased random key Genetic Algorithm (MPGA). Our algorithm proved to be able to find an optimum solution in more than 75 % of the runs, for each problem instance solved, and was also able to improve on many results reported for the MPGA. Furthermore, for every single problem instance we were able to find a feasible solution, which was not the case for the MPGA. Regarding running times, our algorithm improves upon the computational time used by CPLEX and was always lower than that of the MPGA.

[1]  Panos M. Pardalos,et al.  Encyclopedia of Optimization , 2006 .

[2]  Barbaros Ç. Tansel,et al.  New formulations of the Hop-Constrained Minimum Spanning Tree problem via Miller-Tucker-Zemlin constraints , 2011, Eur. J. Oper. Res..

[3]  Fernando A. C. C. Fontes,et al.  Concave minimum cost network flow problems solved with a colony of ants , 2013, J. Heuristics.

[4]  Luca Quadrifoglio,et al.  Comparing Ant Colony Optimization and Genetic Algorithm Approaches for Solving Traffic Signal Coordination under Oversaturation Conditions , 2012, Comput. Aided Civ. Infrastructure Eng..

[5]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[6]  Thomas Stützle,et al.  Ant Colony Optimization Theory , 2004 .

[7]  R. J. Kuo,et al.  Hybrid ant colony optimization algorithms for mixed discrete-continuous optimization problems , 2012, Appl. Math. Comput..

[8]  Luís Gouveia,et al.  Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs , 2011, Math. Program..

[9]  Dukwon Kim.  Piecewise Linear Network Flow Problems , 2009, Encyclopedia of Optimization.

[10]  José Fernando Gonçalves,et al.  Heuristic solutions for general concave minimum cost network flow problems , 2007, Networks.

[11]  Mauro Dell'Amico,et al.  Assignment Problems , 1998, IFIP Congress: Fundamentals - Foundations of Computer Science.

[12]  E. Spencer.  From the Library , 1936, British Journal of Ophthalmology.

[13]  José Fernando Gonçalves,et al.  A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks , 2013, Optim. Lett..

[14]  Yuping Wang,et al.  A deterministic annealing algorithm for the minimum concave cost network flow problem , 2011, Neural Networks.

[15]  Dalila B.M.M. Fontes,et al.  Solving Hop-constrained MST problems with ACO, FEP Working Paper, n. 493, 2013 , 2013 .

[16]  Francisco Herrera,et al.  A taxonomy and an empirical analysis of multiple objective ant colony optimization algorithms for the bi-criteria TSP , 2007, Eur. J. Oper. Res..

[17]  Dorothy Ndedi Monekosso,et al.  A review of ant algorithms , 2009, Expert Syst. Appl..

[18]  Marta Sofia,et al.  Ant Colony Optimization Algorithms to solve Nonlinear Network Flow Problems , 2012 .

[19]  Marta S. R. Monteiro,et al.  Solving Hop-constrained MST problems with ACO , 2013 .

[20]  Baozhen Yao,et al.  Production , Manufacturing and Logistics An improved ant colony optimization for vehicle routing problem , 2008 .

[21]  Dalila B. M. M. Fontes,et al.  Optimal Hop-Constrained Trees for Nonlinear Cost Flow Networks , 2010, INFOR Inf. Syst. Oper. Res..

[22]  Nicos Christofides,et al.  Upper bounds for single‐source uncapacitated concave minimum‐cost network flow problems , 2003, Networks.

[23]  Yueh-Min Huang,et al.  Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints , 2008, Expert Syst. Appl..

[24]  Dushyant Sharma,et al.  Restricted dynamic programming based neighborhoods for the hop-constrained minimum spanning tree problem , 2011, J. Heuristics.

[25]  T. Stützle,et al.  A Review on the Ant Colony Optimization Metaheuristic: Basis, Models and New Trends , 2002 .

[26]  Shuai Li,et al.  Multicast routing for delay variation bound using a modified ant colony algorithm , 2009, J. Netw. Comput. Appl..

[27]  Ismail Karaoglan,et al.  A genetic ant colony optimization approach for concave cost transportation problems , 2007, 2007 IEEE Congress on Evolutionary Computation.

[28]  Jingyu Wang,et al.  Ant colony optimization for the nonlinear resource allocation problem , 2006, Appl. Math. Comput..

[29]  Pedro Martins,et al.  The Capacitated Minimal Spanning Tree Problem: An experiment with a hop‐indexedmodel , 1999, Ann. Oper. Res..

[30]  Luís Gouveia,et al.  A new Lagrangean relaxation approach for the hop-constrained minimum spanning tree problem , 2001, Eur. J. Oper. Res..

[31]  Mesut Gündüz,et al.  A novel hybrid algorithm based on particle swarm and ant colony optimization for finding the global minimum , 2012, Appl. Math. Comput..