A genetic algorithm with local search for solving single-source single-sink nonlinear non-convex minimum cost flow problems

Network models are widely used for solving difficult real-world problems. The minimum cost flow problem (MCFP) is one of the fundamental network optimisation problems with many practical applications. The difficulty of MCFP depends heavily on the shape of its cost function. A common approach to tackle MCFPs is to relax the non-convex, mixed-integer, nonlinear programme (MINLP) by introducing linearity or convexity to its cost function as an approximation to the original problem. However, this sort of simplification is often unable to sufficiently capture the characteristics of the original problem. How to handle MCFPs with non-convex and nonlinear cost functions is one of the most challenging issues. Considering that mathematical approaches (or solvers) are often sensitive to the shape of the cost function of non-convex MINLPs, this paper proposes a hybrid genetic algorithm with local search (namely GALS) for solving single-source single-sink nonlinear non-convex MCFPs. Our experimental results demonstrate that GALS offers highly competitive performances as compared to those of the mathematical solvers and a standard genetic algorithm.

[1]  Nikolaos V. Sahinidis,et al.  Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming , 2002 .

[2]  Shin-Yeu Lin,et al.  A computationally efficient method for nonlinear multicommodity network flow problems , 1997 .

[3]  Shangyao Yan,et al.  An ant colony system-based hybrid algorithm for square root concave cost transhipment problems , 2010 .

[4]  Xiaodong Li,et al.  A Probabilistic Tree-Based Representation for Non-convex Minimum Cost Flow Problems , 2018, PPSN.

[5]  Warren P. Adams,et al.  A Reformulation-Linearization Technique for Solving Discrete and Continuous Nonconvex Problems , 1998 .

[6]  Reiner Horst,et al.  An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks , 1994, Universität Trier, Mathematik/Informatik, Forschungsbericht.

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

[8]  Clyde L. Monma,et al.  Send-and-Split Method for Minimum-Concave-Cost Network Flows , 1987, Math. Oper. Res..

[9]  Panos M. Pardalos,et al.  Global search algorithms for minimum concave-cost network flow problems , 1991, J. Glob. Optim..

[10]  G. F. Newell.  Non-Convex Traffic Assignment on a Rectangular Grid Network , 1996, Transp. Sci..

[11]  Dingwei Wang,et al.  Genetic algorithms for solving shortest path problems , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[12]  Mitsuo Gen,et al.  Network Models and Optimization: Multiobjective Genetic Algorithm Approach , 2008 .

[13]  David E. Goldberg,et al.  Genetic algorithms and Machine Learning , 1988, Machine Learning.

[14]  Zbigniew Michalewicz,et al.  A Nonstandard Genetic Algorithm for the Nonlinear Transportation Problem , 1991, INFORMS J. Comput..

[15]  Péter Kovács,et al.  Minimum-cost flow algorithms: an experimental evaluation , 2015, Optim. Methods Softw..

[16]  Nicos Christofides,et al.  A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems , 2006, Eur. J. Oper. Res..

[17]  Kalyanmoy Deb,et al.  Evolutionary algorithm for bilevel optimization using approximations of the lower level optimal solution mapping , 2017, Eur. J. Oper. Res..

[18]  U. Klanšek,et al.  Solving the nonlinear transportation problem by global optimization , 2010 .

[19]  Mitsuo Gen,et al.  An evolution programme for the resource-constrained project scheduling problem , 1998, Int. J. Comput. Integr. Manuf..

[20]  John N. Hooker,et al.  Solving Fixed-Charge Network Flow Problems with a Hybrid Optimization and Constraint Programming Approach , 2002, Ann. Oper. Res..

[21]  Uroš Klanšek,et al.  Solving the nonlinear discrete transportation problem by MINLP optimization , 2013 .

[22]  László A. Végh.  A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives , 2016, SIAM J. Comput..

[23]  Fernando A. C. C. Fontes,et al.  An ant colony optimization algorithm to solve the minimum cost network flow problem with concave cost functions , 2011, GECCO '11.

[24]  Laurence A. Wolsey,et al.  A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem , 2003, Networks.

[25]  Rainer E. Burkard,et al.  Linear Approximations in a Dynamic Programming Approach for the Uncapacitated Single-Source Minimum Concave Cost Network Flow Problem in Acyclic Networks , 2001, J. Glob. Optim..

[26]  Fanrong Xie,et al.  Nonlinear fixed charge transportation problem by minimum cost flow-based genetic algorithm , 2012, Comput. Ind. Eng..

[27]  Mitsuo Gen,et al.  Multiobjective Genetic Algorithm for Bicriteria Network Design Problems , 2009 .

[28]  Adam N. Letchford,et al.  Non-convex mixed-integer nonlinear programming: A survey , 2012 .

[29]  Nicos Christofides,et al.  A Branch-and-Bound Algorithm for Concave Network Flow Problems , 2006, J. Glob. Optim..

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

[31]  Panos M. Pardalos,et al.  Algorithms for the single-source uncapacitated minimum concave-cost network flow problem , 1991, J. Glob. Optim..

[32]  Linus Schrage,et al.  The global solver in the LINDO API , 2009, Optim. Methods Softw..

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

[34]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .