A genetic algorithm with local search for solving single-source single-sink nonlinear non-convex minimum cost flow problems
- 86 Downloads
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.
KeywordsMinimum cost flow problem Non-convex cost function Genetic algorithm Local search
Compliance with ethical standards
Conflict of interest
The authors declare that they have no conflict of interest.
This article does not contain any studies with human participants or animals performed by any of the authors.
- Garey MR, Johnson DS (2002) Computers and intractability, vol 29. wh freeman, New YorkGoogle Scholar
- Gen M, Cheng R, Wang D (1997) Genetic algorithms for solving shortest path problems. In: IEEE International conference on evolutionary computation, 1997. IEEEGoogle Scholar
- Michalewicz Z, Stephen H (1996) Genetic algorithms + data structures = evolution programs. Math Intell. https://doi.org/10.1007/978-3-662-03315-9
- Monteiro MSR, Fontes DB, Fontes FA (2011) An ant colony optimization algorithm to solve the minimum cost network flow problem with concave cost functions. In: Proceedings of the 13th annual conference on Genetic and evolutionary computation, pp 139–146Google Scholar
- Reca J, Martnez J, Lpez-Luque R (2017) A new efficient bounding strategy applied to the heuristic optimization of the water distribution networks design. In: Congress on numerical methods in engineering CMNGoogle Scholar