Sampling-Based Genetic Algorithms for the Bi-Objective Stochastic Covering Tour Problem

  • Michaela Zehetner
  • Walter J. Gutjahr
Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 62)


The paper investigates a sampling-based extension of the NSGA-II algorithm, applied to the solution of a bi-objective stochastic covering tour problem. The proposed extension uses variable samples for gradually improving approximations to the Pareto front. The approach is evaluated on a test benchmark for a humanitarian logistics application with data from Senegal. Comparisons to alternative solution techniques, in particular also to the exact solution of the deterministic counterpart problem based on a fixed sample, show the superiority of our approach.


Humanitarian logistics Genetic algorithms Multi-objective optimization Stochastic optimization Covering tour problem 



We want to express our thanks to Fabien Tricoire for his help during the preparation of this paper.


  1. 1.
    L. Amodeo, C. Prins, D. Sanchez, Comparison of metaheuristic approaches for multi-objective simulation-based optimization in supply chain inventory management, in Applications of Evolutionary Computing. Lecture Notes in Computer Science (Springer, Berlin, 2009), pp. 798–807Google Scholar
  2. 2.
    P. Balaprakash, M. Birattari, T. Stützle, M. Dorigo, Estimation-based metaheuristics for the probabilistic traveling salesman problem. Comput. Oper. Res. 37, 1939–1951 (2010)CrossRefGoogle Scholar
  3. 3.
    R. Baldacci, M.A. Boschetti, V. Maniezzo, M. Zamboni, Scatter search methods for the covering tour problem, in Metaheuristic Optimization via Memory and Evolution, ed. by R. Sharda et al. (Springer, Berlin, 2005), pp. 59–91CrossRefGoogle Scholar
  4. 4.
    M. Basseur, E. Zitzler, Handling uncertainty in indicator-based multiobjective optimization. Int. J. Comput. Intell. Res. 2, 255–272 (2006)CrossRefGoogle Scholar
  5. 5.
    F. Ben Abdelaziz, Solution approaches for the multiobjective stochastic programming. Eur. J. Oper. Res. (2011). doi:10.1016/j.ejor.2011.03.033Google Scholar
  6. 6.
    A.G. Carvalho, A.F.R. Araujo, Improving NSGA-II with an adaptive mutation operator, in Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference, July 2009, Montreal (2009), pp. 2697–2700Google Scholar
  7. 7.
    J.R. Current, D.A. Schilling, The median tour and maximal covering tour problems: formulations and heuristics. Eur. J. Oper. Res. 73(1), 114–126 (1994)CrossRefGoogle Scholar
  8. 8.
    K. Deb, A. Pratap, S. Agarwal, T. Meyarivan, A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182–197 (2002)CrossRefGoogle Scholar
  9. 9.
    H. Ding, L. Benyoucef, X. Xie, A simulation-based multi-objective genetic algorithm approach for networked enterprises optimization. Eng. Appl. Artif. Intell. 19, 609–623 (2006)CrossRefGoogle Scholar
  10. 10.
    K. Doerner, A. Focke, W.J. Gutjahr, Multicriteria tour planning for mobile healthcare facilities in a developing country. Eur. J. Oper. Res. 179(3), 1078–1096 (2007)CrossRefGoogle Scholar
  11. 11.
    W. Domschke, Logistik: Rundreisen und Touren, 3rd edn. (Oldenbourg, München, 1990)Google Scholar
  12. 12.
    H. Eskandari, C.D. Geiger, Evolutionary multiobjective optimization in noisy problem environments. J. Heuristics 15, 559–595 (2009)CrossRefGoogle Scholar
  13. 13.
    H. Eskandari, L. Rabelo, M. Mollaghasemi, Multiobjective simulation optimization using an enhanced genetic algorithm, in Proceedings of the 37th Conference on Winter Simulation, WSC ’05, Orlando, FL (2005), pp. 833–841Google Scholar
  14. 14.
    F. Foord, Gambia: evaluation of the mobile health care service in West Kiang district. World Health Stat. Q. 48(1), 18–22 (1995)Google Scholar
  15. 15.
    M. Gendreau, G. Laporte, F. Semet, The covering tour problem. Oper. Res. 45(4), 568–576 (1997)CrossRefGoogle Scholar
  16. 16.
    L. Gustavsson, Humanitarian logistics: context and challenges. Forced Migr. Rev. 18, 6–8 (2003)Google Scholar
  17. 17.
    W.J. Gutjahr, A converging ACO algorithm for stochastic combinatorial optimization, in Proceedings of SAGA 2003 (Stochastic Algorithms: Foundations and Applications). Lecture Notes in Computer Science, vol. 2827 (Springer, Berlin, 2003), pp. 10–25Google Scholar
  18. 18.
    W.J. Gutjahr, Two metaheuristics for multiobjective stochastic combinatorial optimization, in Proceedings of SAGA 2005 (Stochastic Algorithms: Foundations and Applications) (Springer, Berlin, 2005), pp. 116–125Google Scholar
  19. 19.
    W.J. Gutjahr, A provably convergent heuristic for stochastic bicriteria integer programming. J. Heuristics 15(3), 227–258 (2009)CrossRefGoogle Scholar
  20. 20.
    W.J. Gutjahr, Recent trends in metaheuristics for stochastic combinatorial optimization. Cent. Eur. J. Comput. Sci. 1, 58–66 (2011)Google Scholar
  21. 21.
    W.J. Gutjahr, Runtime analysis of an evolutionary algorithm for stochastic multi-objective combinatorial optimization. Evol. Comput. 20, 395–421 (2012)CrossRefGoogle Scholar
  22. 22.
    W.J. Gutjahr, A. Pichler, Stochastic multi-objective optimization: a survey on non-scalarizing methods. Ann. Oper. Res. (2013). doi:10.1007/s10478-013-1369-5Google Scholar
  23. 23.
    W.J. Gutjahr, P. Reiter, Bi-objective project portfolio selection and staff assignment under uncertainty. Optimization 59, 417–445 (2010)CrossRefGoogle Scholar
  24. 24.
    M.H. Ha, N. Bostel, A. Langevin, L.-M. Rousseau, An exact algorithm and a metaheuristic for the multi-vehicle covering tour problem with a constraint on the number of vertices. Eur. J. Oper. Res. 226(2), 211–220 (2013)CrossRefGoogle Scholar
  25. 25.
    M. Hachicha, M.J. Hodgson, G. Laporte, F. Semet, Heuristics for the multi-vehicle covering tour problem. Comput. Oper. Res. 27(1), 29–42 (2000)CrossRefGoogle Scholar
  26. 26.
    M.J. Hodgson, G. Laporte, F. Semet, A covering tour model for planning mobile health care facilities in Suhum district, Ghana. J. Reg. Sci. 38(4), 621–638 (1998)CrossRefGoogle Scholar
  27. 27.
    T. Homem-de-Mello, Variable-sample methods for stochastic optimization. ACM Trans. Model. Comput. Simul. 13(2), 108–133 (2003)CrossRefGoogle Scholar
  28. 28.
    E.J. Hughes, Evolutionary multi-objective ranking with uncertainty and noise, in Proceedings of EMO ’01 (Evolutionary Multicriterion Optimization), (Springer, Berlin, 2001), pp. 329–343Google Scholar
  29. 29.
    A. Jaszkiewicz, Evaluation of multiple objective metaheuristics, in Metaheuristics for Multiobjective Optimization, ed. by X. Gandibleux et al. Lecture Notes in Economics and Mathematical Systems, vol. 535 (Springer, Berlin, 2004), pp. 65–89Google Scholar
  30. 30.
    M.T. Jensen, Reducing the run-time complexity of multiobjective EAs: the NSGA-II and other algorithms. IEEE Trans. Evol. Comput. 7(5), 503–515 (2003)CrossRefGoogle Scholar
  31. 31.
    N. Jozefowiez, A column generation approach for the multi-vehicle covering tour problem, in Proceedings of the 12th ROADEF Conference, Saint-Etienne, March 2011Google Scholar
  32. 32.
    N. Jozefowiez, A branch-and-price algorithm for the multiple vehicle covering tour problem, in Proceedings of ODYSSEUS 2012, Mykonos, May 2012Google Scholar
  33. 33.
    N. Jozefowiez, F. Semet, E.-G. Talbi, The bi-objective covering tour problem. Comput. Oper. Res. 34(7), 1929–1942 (2007)CrossRefGoogle Scholar
  34. 34.
    A. Konak, D.W. Coit, A.E. Smith, Multi-objective optimization using genetic algorithms: a tutorial. Reliab. Eng. Syst. Saf. 91(9), 992–1007 (2006)CrossRefGoogle Scholar
  35. 35.
    A. Liefooghe, M. Basseur, L. Jourdan, E.-G. Talbi, Combinatorial optimization of stochastic multi-objective problems: an application to the flow-shop scheduling problem, in Evolutionary Multi-Criterion Optimization. Lecture Notes in Computer Science, vol. 4403 (Springer, Berlin, 2007), pp. 457–471Google Scholar
  36. 36.
    A. Liefooghe, M. Basseur, L. Jourdan, E.-G. Talbi, ParadisEO-MOEO: a framework for evolutionary multi-objective optimization, in Evolutionary Multi-Criterion Optimization. Lecture Notes in Computer Science, vol. 4403 (Springer, Berlin, 2007), pp. 386–400Google Scholar
  37. 37.
    W.-K. Mak, D.P. Morton, R.K. Wood, Monte Carlo bounding techniques for determining solution quality in stochastic programs. Oper. Res. Lett. 24(1–2), 47–56 (1999)CrossRefGoogle Scholar
  38. 38.
    J.B. Mendes, J.A. de Vasconcelos, Using an adaptation of a binary search tree to improve the NSGA-II nondominated sorting procedure, in Proceedings of the 8th International Conference on Simulated Evolution and Learning, Kanpur, December 2010, pp. 558–562Google Scholar
  39. 39.
    L. Motta, L.S. Ochi, C. Martinhon, GRASP metaheuristics to the generalized covering tour problem, in Proceedings of the 4th Metaheuristics International Conference, Porto, July 2001, pp. 387–391Google Scholar
  40. 40.
    Z. Naji-Azimi, J. Renaud, A. Ruiz, M. Salari, A covering tour approach to the location of satellite distribution centers to supply humanitarian aid. Eur. J. Oper. Res. 222(3), 596–605 (2012)CrossRefGoogle Scholar
  41. 41.
    P.C. Nolz, K.F. Doerner, W.J. Gutjahr, R.F. Hartl, A bi-objective metaheuristic for disaster relief operation planning, in Advances in Multi-Objective Nature Inspired Computing, ed. by C.A. Coello Coello, C. Dhaenes, L. Jourdan. Studies in Computational Intelligence, vol. 272 (Springer, Berlin, 2010), pp. 167–187Google Scholar
  42. 42.
    P.C. Nolz, F. Semet, K.F. Doerner, Risk approaches for delivering disaster relief supplies. OR Spectr. 33(3), 543–569 (2011)CrossRefGoogle Scholar
  43. 43.
    S. Rath, W.J. Gutjahr, A math-heuristic for the warehouse location routing problem in disaster relief. Comput. Oper. Res. 42, 25–39 (2014)CrossRefGoogle Scholar
  44. 44.
    S. Rath, M. Gendreau, W.J. Gutjahr, Bi-objective stochastic programming models for determining depot locations in disaster relief operations planning. Int. Trans. Oper. Res. 23, 997–1023 (2016)CrossRefGoogle Scholar
  45. 45.
    J.R. Schott, Fault tolerant design using single and multicriteria genetic algorithm optimization. Master’s thesis, Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge (1995)Google Scholar
  46. 46.
    W. Swaddiwudhipong, C. Chaovakiratipong, P. Nguntra, P. Lerdlukanavonge, S. Koonchote, Effect of a mobile unit on changes in knowledge and use of cervical cancer screening among rural Thai women. Int. J. Epidemiol. 24(3), 493–498 (1995)CrossRefGoogle Scholar
  47. 47.
    A. Syberfeldt, A. Ng, R.I. John, P. Moore, Multi-objective evolutionary simulation-optimisation of a real-world manufacturing problem. Robot. Comput. Integr. Manuf. 25, 926–931 (2009)CrossRefGoogle Scholar
  48. 48.
    J. Teich, Pareto-front exploration with uncertain objectives, in Proceedings of EMO ’01 (Evolutionary Multicriterion Optimization) (Springer, Berlin, 2001), pp. 314–328Google Scholar
  49. 49.
    A.S. Thomas, L.R. Kopczak, From logistics to supply chain management: the path forward in the humanitarian sector. Fritz Institute [online] (2005), available at: Accessed 08 Oct 2012
  50. 50.
    A. Thomas, M. Mizushima, Logistics training: necessity or luxury? Forced Migr. Rev. 22, 60–61 (2005)Google Scholar
  51. 51.
    F. Tricoire, A. Graf, W.J. Gutjahr, The bi-objective stochastic covering tour problem. Comput. Oper. Res. 39(7), 1582–1592 (2012)CrossRefGoogle Scholar
  52. 52.
    D.A. Van Veldhuizen, Multiobjective evolutionary algorithms: classifications, analyses, and new innovations. Ph.D. Thesis, Department of Electrical and Computer Engineering, Graduate School of Engineering, Air Force Institute of Technology, Wright-Patterson AFB, OH (1999)Google Scholar
  53. 53.
    E. Zitzler, L. Thiele, Multiobjective optimization using evolutionary algorithms—a comparative case study, in Parallel Problem Solving from Nature V, ed. by A.E. Eiben, T. Bäck, M. Schoenauer, H.-P. Schwefel (Springer, Berlin, 1998), pp. 292–301CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Michaela Zehetner
    • 1
  • Walter J. Gutjahr
    • 1
  1. 1.University of ViennaWienAustria

Personalised recommendations