Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems

  • Jakob BossekEmail author
  • Christian Grimme
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11353)


The \(\mathcal {NP}\)-hard multi-criteria shortest path problem (mcSPP) is of utmost practical relevance, e. g., in navigation system design and logistics. We address the problem of approximating the Pareto-front of the mcSPP with sum objectives. We do so by proposing a new mutation operator for multi-objective evolutionary algorithms that solves single-objective versions of the shortest path problem on subgraphs. A rigorous empirical benchmark on a diverse set of problem instances shows the effectiveness of the approach in comparison to a well-known mutation operator in terms of convergence speed and approximation quality. In addition, we glance at the neighbourhood structure and similarity of obtained Pareto-optimal solutions and derive promising directions for future work.



The authors acknowledge support from the European Research Center for Information Systems (ERCIS).


  1. 1.
    Bossek, J.: ecr 2.0: a modular framework for evolutionary computation in R. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2017, pp. 1187–1193 (2017).
  2. 2.
    Bossek, J.: grapherator: a modular multi-step graph generator. J. Open Source Softw. 3(22), 528 (2018).
  3. 3.
    Bossek, J., Grimme, C.: A pareto-beneficial sub-tree mutation for the multi-criteria minimum spanning tree problem. In: 2017 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 3280–3287. IEEE, Honolulu (2017).
  4. 4.
    Bossek, J., Grimme, C.: An extended mutation-based priority-rule integration concept for multi-objective machine scheduling. In: 2017 IEEE Symposium Series on Computational Intelligence (SSCI), pp. 3288–3295. IEEE, Honolulu (2017).
  5. 5.
    Chitra, C., Subbaraj, P.: Multiobjective optimization solution for shortest path routing problem. Int. Sch. Sci. Res. Innov. 4(1) (2010)Google Scholar
  6. 6.
    Coello Coello, C.A., Lamont, G.B., Van Veldhuizen, D.A.: Evolutionary Algorithms for Solving Multi-Objective Problems. Genetic and Evolutionary Computation, 2nd edn. Springer, New York (2007). Scholar
  7. 7.
    Coutinho-Rodrigues, J., Clmaco, J., Current, J.: An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions. Comput. Oper. Res. 26(8), 789–798 (1999).
  8. 8.
    Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evolut. Comput. 6(2), 182–197 (2002)CrossRefGoogle Scholar
  9. 9.
    Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik 1, 269–271 (1959)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Ehrgott, M., Gandibleux, X.: A survey and annotated bibliography of multiobjective combinatorial optimization. OR-Spektrum 22(4), 425–460 (2000). Scholar
  11. 11.
    Ehrgott, M., Gandibleux, X.: A survey and annotated bibliography of multiobjective combinatorial optimization. OR-Spektrum 22(4), 425–460 (2000).
  12. 12.
    Emmerich, Michael, Beume, Nicola, Naujoks, Boris: An EMO algorithm using the hypervolume measure as selection criterion. In: Coello Coello, Carlos A., Hernández Aguirre, Arturo, Zitzler, Eckart (eds.) EMO 2005. LNCS, vol. 3410, pp. 62–76. Springer, Heidelberg (2005). Scholar
  13. 13.
    Floyd, R.W.: Algorithm 97: shortest path. Commun. ACM 5(6), 345 (1962).
  14. 14.
    Gandibleux, X., Beugnies, F., Randriamasy, S.: Martins’ algorithm revisited for multi-objective shortest path problems with a maxmin cost function. 4OR 4(1), 47–59 (2006).
  15. 15.
    Martins, E.Q.V.: On a multicriteria shortest path problem. Eur. J. Oper. Res. 16(2), 236–245 (1984)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Miettinen, K.: Nonlinear Multiobjective Optimization. International Series in Operations Research & Management Science, vol. 12. Springer, New York (1998)zbMATHGoogle Scholar
  17. 17.
    Mohamed, C., Bassem, J., Taicir, L.: A genetic algorithms to solve the bicriteria shortest path problem. Electron. Notes Discret. Math. 36, 851–858 (2010). ISCO 2010 - International Symposium on Combinatorial Optimization
  18. 18.
    Müller-Hannemann, M., Weihe, K.: Pareto Shortest Paths is Often Feasible in Practice, pp. 185–197. Springer, Berlin (2001). Scholar
  19. 19.
    Pangilinan, J.M.A., Janssens, G.K.: Evolutionary algorithms for the multiobjective shortest path planning problem. In: International Journal of Computer and Information Science and Engineering, pp. 54–59 (2007)Google Scholar
  20. 20.
    Sanders, P., Mandow, L.: Parallel label-setting multi-objective shortest path search. In: 2013 IEEE 27th International Symposium on Parallel and Distributed Processing, pp. 215–224 (2013).
  21. 21.
    Tsaggouris, G., Zaroliagis, C.: Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications, pp. 389–398. Springer, Berlin (2006). Scholar
  22. 22.
    Warburton, A.: Approximation of pareto optima in multiple-objective, shortest-path problems. Oper. Res. 35(1), 70–79 (1987). Scholar
  23. 23.
    Zhang, Q., Li, H.: MOEA/D: a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evolu. Comput. 11(6), 712–731 (2007)CrossRefGoogle Scholar
  24. 24.
    Zitzler, E., Thiele, L., Laumanns, M., Fonseca, C.M., Da Fonseca, V.G.: Performance assessment of multiobjective optimizers: an analysis and review. IEEE Trans. Evolu. Comput. 7(2), 117–132 (2003)CrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Information Systems and StatisticsUniversity of MünsterMünsterGermany

Personalised recommendations