The Sim-EA Algorithm with Operator Autoadaptation for the Multiobjective Firefighter Problem
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.
KeywordsMultipopulation algorithms Multi-objective evolutionary optimization Graph-based optimization Firefighter problem
- 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
- 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
- 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
- 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
- 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