NSGA-II for Solving Multiobjective Integer Minimum Cost Flow Problem with Probabilistic Tree-Based Representation

  • Behrooz GhasemishabankarehEmail author
  • Melih Ozlen
  • Xiaodong Li
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11411)


Network flow optimisation has many real-world applications. The minimum cost flow problem (MCFP) is the most common network flow problem, which can also be formulated as a multiobjective optimisation problem, with multiple criteria such as time, cost, and distance being considered simultaneously. Although there exist several multiobjective mathematical programming techniques, they often assume linearity or convexity of the cost functions, which are unrealistic in many real-world situations. In this paper, we propose to use the non-dominated sorting genetic algorithm, NSGA-II, to solve this sort of Multiobjective MCFPs (MOMCFPs), because of its robustness in dealing with optimisation problems of linear as well as nonlinear properties. We adopt a probabilistic tree-based representation scheme, and apply NSGA-II to solve the multiobjective integer minimum cost flow problem (MOIMCFP). Our experimental results demonstrate that the proposed method has superior performance compared to those of the mathematical programming methods in terms of the quality as well as the diversity of solutions approximating the Pareto front. In particular, the proposed method is robust in handling linear as well as nonlinear cost functions.


Multiobjective optimisation Minimum cost flow problem Genetic algorithm 


  1. 1.
    Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications, pp. 4–6. Prentice hall, Upper Saddle River (1993)zbMATHGoogle Scholar
  2. 2.
    Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)CrossRefGoogle Scholar
  3. 3.
    Eusébio, A., Figueira, J.R.: Finding non-dominated solutions in bi-objective integer network flow problems. Comput. Oper. Res. 36(9), 2554–2564 (2009)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Eusébio, A., Figueira, J.R.: On the computation of all supported efficient solutions in multi-objective integer network flow problems. Eur. J. Oper. Res. 199(1), 68–76 (2009)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Eusébio, A., Figueira, J.R., Ehrgott, M.: On finding representative non-dominated points for bi-objective integer network flow problems. Comput. Oper. Res. 48, 1–10 (2014)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Fruhwirth, B., Bukkard, R., Rote, G.: Approximation of convex curves with application to the bicriterial minimum cost flow problem. Eur. J. Oper. Res. 42(3), 326–338 (1989)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Gen, M., Cheng, R., Lin, L.: Network Models and Optimization: Multiobjective Genetic Algorithm Approach. DECENGIN. Springer Science & Business Media, London (2008). Scholar
  8. 8.
    Ghasemishabankareh, B., Ozlen, M., Neumann, F., Li, X.: A probabilistic tree-based representation for non-convex minimum cost flow problems. In: Auger, A., Fonseca, C.M., Lourenço, N., Machado, P., Paquete, L., Whitley, D. (eds.) PPSN 2018. LNCS, vol. 11101, pp. 69–81. Springer, Cham (2018). Scholar
  9. 9.
    Hamacher, H.W., Pedersen, C.R., Ruzika, S.: Multiple objective minimum cost flow problems: a review. Eur. J. Oper. Res. 176(3), 1404–1422 (2007)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Lee, H., Pulat, P.S.: Bicriteria network flow problems: continuous case. Eur. J. Oper. Res. 51(1), 119–126 (1991)CrossRefGoogle Scholar
  11. 11.
    Löhne, A., Weißing, B.: The vector linear program solver Bensolve-notes on theoretical background. Eur. J. Oper. Res. 260(3), 807–813 (2017)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Malhotra, R., Puri, M.: Bi-criteria network problem. Cahiers du Centre d’études de recherche opérationnelle 26(1–2), 95–102 (1984)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Raith, A., Ehrgott, M.: A two-phase algorithm for the biobjective integer minimum cost flow problem. Comput. Oper. Res. 36(6), 1945–1954 (2009)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Raith, A., Sedeño-Noda, A.: Finding extreme supported solutions of biobjective network flow problems: an enhanced parametric programming approach. Comput. Oper. Res. 82, 153–166 (2017)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Ruhe, G.: Algorithmic Aspects of Flows in Networks. MAIA, vol. 69. Springer Science & Business Media, Dordrecht (1991). Scholar
  16. 16.
    Sedeño-Noda, A., González-Martın, C.: The biobjective minimum cost flow problem. Eur. J. Oper. Res. 124(3), 591–600 (2000)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Steuer, R.: Multiple Criteria Optimization: Theory, Computation, and Application. Willey, New York (1986)zbMATHGoogle Scholar
  18. 18.
    Sun, M.: A branch-and-bound algorithm for representative integer efficient solutions in multiple objective network programming problems. Networks 62(1), 56–71 (2013)MathSciNetCrossRefGoogle Scholar
  19. 19.
    While, L., Hingston, P., Barone, L., Huband, S.: A faster algorithm for calculating hypervolume. IEEE Trans. Evol. Comput. 10(1), 29–38 (2006)CrossRefGoogle Scholar
  20. 20.
    Yan, S., Shih, Y., Wang, C.: An ant colony system-based hybrid algorithm for square root concave cost transhipment problems. Eng. Optim. 42(11), 983–1001 (2010)MathSciNetCrossRefGoogle Scholar
  21. 21.
    Zitzler, E.: Evolutionary algorithms for multiobjective optimization: methods and applications, vol. 63. Citeseer (1999)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Behrooz Ghasemishabankareh
    • 1
    Email author
  • Melih Ozlen
    • 1
  • Xiaodong Li
    • 1
  1. 1.School of ScienceRMIT UniversityMelbourneAustralia

Personalised recommendations