Skip to main content

The Sim-EA Algorithm with Operator Autoadaptation for the Multiobjective Firefighter Problem

  • Conference paper
  • First Online:
Evolutionary Computation in Combinatorial Optimization (EvoCOP 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9026))

Abstract

The firefighter problem is a graph-based optimization problem that can be used for modelling the spread of fires, and also for studying the dynamics of epidemics. Recently, this problem gained interest from the softcomputing research community and papers were published on applications of ant colony optimization and evolutionary algorithms to this problem. Also, the multiobjective version of the problem was formulated.

In this paper a multipopulation algorithm Sim-EA is applied to the multiobjective version of the firefighter problem. The algorithm optimizes firefighter assignment for a predefined set of weight vectors which determine the importance of individual objectives. A migration mechanism is used for improving the effectiveness of the algorithm.

Obtained results confirm that the multipopulation approach works better than the decomposition approach in which a single specimen is assigned to each direction. Given less computational resources than the decomposition approach, the Sim-EA algorithm produces better results than a decomposition-based algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Bierwirth, C., Mattfeld, D.C., Kopfer, H.: On permutation representations for scheduling problems. In: Proceedings of the 4th International Conference on Parallel Problem Solving from Nature, pp. 310–318. Springer (1996)

    Google Scholar 

  2. Blanton, J.L., Jr., Wainwright, R.L.: Multiple vehicle routing with time and capacity constraints using genetic algorithms. In: Proceedings of the 5th International Conference on Genetic Algorithms, pp. 452–459. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1993)

    Google Scholar 

  3. Blum, C., Blesa, M.J., García-Martínez, C., Rodríguez, F.J., Lozano, M.: The firefighter problem: application of hybrid ant colony optimization algorithms. In: Blum, C., Ochoa, G. (eds.) EvoCOP 2014. LNCS, vol. 8600, pp. 218–229. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  4. Cicirello, V.A., Smith, S.F.: Modeling GA performance for control parameter optimization. In: Whitley, L. (ed.) GECCO-2000: Proceedings of the Genetic and Evolutionary Computation Conference: A Joint Meeting of the Ninth International Conference on Genetic Algorithms (ICGA-2000) and the Fifth Annual Genetic Programming Conference (GP-2000). Morgan Kaufmann Publishers, Massachusetts (2000)

    Google Scholar 

  5. Cicirello, V.A.: Non-wrapping order crossover: an order preserving crossover operator that respects absolute position. In: Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation, pp. 1125–1132. ACM, New York, NY, USA (2006)

    Google Scholar 

  6. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evolut. Comput. 6, 182–197 (2002)

    Article  Google Scholar 

  7. Derrac, J., Garca, S., Molina, D., Herrera, F.: A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms. Swarm Evol. Comput. 1(1), 3–18 (2011)

    Article  Google Scholar 

  8. Develin, M., Hartke, S.G.: Fire containment in grids of dimension three and higher. Discrete Appl. Math. 155(17), 2257–2268 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  9. Falkenauer, E., Bouffouix, S.: A genetic algorithm for job shop. In: Proceedings of the 1991 IEEE International Conference on Robotics and Automation, pp. 824–829 (1991)

    Google Scholar 

  10. Feldheim, O.N., Hod, R.: 3/2 firefighters are not enough. Discre. Appl. Math. 161(12), 301–306 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  11. Goldberg, D.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley, Reading (1989)

    MATH  Google Scholar 

  12. Goldberg, D.E., Lingle Jr., R.: Alleles, loci, and the traveling salesman problem. In: Grefenstette, J.J. (ed.) Proceedings of the First International Conference on Genetic Algorithms and Their Applications, pp. 154–159. Lawrence Erlbaum Associates Publishers, Hillsdale (1985)

    Google Scholar 

  13. Hartnell, B.: Firefighter! an application of domination. In: 20th Conference on Numerical Mathematics and Computing (1995)

    Google Scholar 

  14. Li, H., Zhang, Q.: Multiobjective optimization problems with complicated pareto sets, MOEA/D and NSGA-II. IEEE Trans. Evolut. Comput. 13(2), 284–302 (2009)

    Article  Google Scholar 

  15. Michalak, K.: Auto-adaptation of genetic operators for multi-objective optimization in the firefighter problem. In: Corchado, E., Lozano, J.A., Quintián, H., Yin, H. (eds.) IDEAL 2014. LNCS, vol. 8669, pp. 484–491. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  16. Michalak, K.: Sim-EA: an evolutionary algorithm based on problem similarity. In: Corchado, E., Lozano, J.A., Quintián, H., Yin, H. (eds.) IDEAL 2014. LNCS, vol. 8669, pp. 191–198. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  17. Miller, B.L., Goldberg, D.E.: Genetic algorithms, tournament selection, and the effects of noise. Complex Syst. 9, 193–212 (1995)

    MathSciNet  Google Scholar 

  18. Mumford, C.L.: New order-based crossovers for the graph coloring problem. In: Runarsson, T.P., Beyer, H.G., Burke, E., Merelo-Guervós, J.J., Darrell Whitley, L., Yao, X. (eds.) PPSN IX. LNCS, vol. 4193, pp. 880–889. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  19. Oliver, I.M., Smith, D.J., Holland, J.R.C.: A study of permutation crossover operators on the traveling salesman problem. In: Proceedings of the Second International Conference on Genetic Algorithms on Genetic Algorithms and Their Applications, pp. 224–230. Lawrence Erlbaum Associates Inc., Hillsdale, NJ, USA (1987)

    Google Scholar 

  20. Syswerda, G.: Schedule optimization using genetic algorithms. In: Davis, L. (ed.) Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)

    Google Scholar 

  21. Whitley, D., Rana, S., Heckendorn, R.B.: The island model genetic algorithm: on separability, population size and convergence. J. Comput. Inf. Technol. 7, 33–47 (1998)

    Google Scholar 

  22. Wilcoxon, F.: Individual comparisons by ranking methods. Biometrics Bull. 1(6), 80–83 (1945)

    Article  Google Scholar 

  23. Zhang, Q., Li, H.: MOEA/D: A multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evolut. Comput. 11(6), 712–731 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Krzysztof Michalak .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Michalak, K. (2015). The Sim-EA Algorithm with Operator Autoadaptation for the Multiobjective Firefighter Problem. In: Ochoa, G., Chicano, F. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2015. Lecture Notes in Computer Science(), vol 9026. Springer, Cham. https://doi.org/10.1007/978-3-319-16468-7_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-16468-7_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-16467-0

  • Online ISBN: 978-3-319-16468-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics