Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014, Article ID 745921, 10 pages
http://dx.doi.org/10.1155/2014/745921
Research Article

Comparing Evolutionary Strategies on a Biobjective Cultural Algorithm

1Escuela de Ingeniería Informática, Pontificia Universidad Católica de Valparaíso, 2362807 Valparaíso, Chile
2Universidad Finis Terrae, 7500000 Santiago, Chile
3CIMFAV Facultad de Ingeniería, Universidad de Valparaíso, 2362735 Valparaíso, Chile
4Universidad Autónoma de Chile, 7500138 Santiago, Chile
5Departamento de Computación e Informática, Universidad de Playa Ancha, 33449 Valparaíso, Chile
6Escuela de Ingeniería Industrial, Universidad Diego Portales, 8370109 Santiago, Chile

Received 9 April 2014; Accepted 27 June 2014; Published 31 August 2014

Academic Editor: Xin-She Yang

Copyright © 2014 Carolina Lagos et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. D. Maravall and J. de Lope, “Multi-objective dynamic optimization with genetic algorithms for automatic parking,” Soft Computing, vol. 11, no. 3, pp. 249–257, 2007. View at Publisher · View at Google Scholar · View at Scopus
  2. K. Deb, S. Agrawal, A. Pratap, and T. Meyarivan, “A fast elitist non-dominated sorting genetic algorithm for multiobjective optimization: Nsga II,” in Parallel Problem Solving from Nature PPSN VI, M. Schoenauer, K. Deb, G. Rudolph et al., Eds., vol. 1917 of Lecture Notes in Computer Science, pp. 849–858, Springer, Berlin, Germany, 2000. View at Google Scholar
  3. I. Borgulya, “An algorithm for the capacitated vehicle routing problem with route balancing,” Central European Journal of Operations Research, vol. 16, no. 4, pp. 331–343, 2008. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  4. P. J. Angeline, Z. Michalewicz, M. Schoenauer, X. Yao, and A. Zalzala, Eds., The Pareto Archived Evolution Strategy: A New Baseline Algorithm for Pareto Multiobjective Optimisation, vol. 1, IEEE Press, 1999.
  5. C. A. Coello Coello and M. Lechuga, “MOPSO: a proposal for multiple objective particle swarm optimization,” in Proceedings of the Congress on Evolutionary Computation (CEC '02), vol. 2, pp. 1051–1056, 2002.
  6. W. K. Mashwani, “Comprehensive survey of the hybrid evolutionary algorithms,” International Journal of Applied Evolutionary Computation, vol. 4, pp. 1–19, 2013. View at Google Scholar
  7. R. Bhattacharya and S. Bandyopadhyay, “Solving conflicting bi-objective facility location problem by NSGA II evolutionary algorithm,” International Journal of Advanced Manufacturing Technology, vol. 51, no. 1–4, pp. 397–414, 2010. View at Publisher · View at Google Scholar · View at Scopus
  8. B. Crawford, C. Lagos, C. Castro, and F. Paredes, “A cultural algorithm for solving the set covering problem,” in Analysis and Design of Intelligent Systems using Soft Computing Techniques, P. Melin, O. Castillo, E. Ramírez, J. Kacprzyk, and W. Pedrycz, Eds., vol. 41 of Advances in Soft Computing, pp. 408–415, Springer, Berlin, Germany, 2007. View at Google Scholar
  9. Y. Guo, J. Cheng, Y. Cao, and Y. Lin, “A novel multi-population cultural algorithm adopting knowledge migration,” Soft Computing, vol. 15, no. 5, pp. 897–905, 2011. View at Publisher · View at Google Scholar · View at Scopus
  10. R. G. Reynolds, “An introduction to cultural algorithms,” in Proceedings of the 3rd Annual Conference on Evolutionary Programming, pp. 131–139, World Scientic, 1994.
  11. C. A. C. Coello, G. B. Lamont, and D. A. V. Veldhuizen, Evolutionary Algorithms for Solving Multi-Objective Problems (Genetic and Evolutionary Computation), Springer, Secaucus, NJ, USA, 2006.
  12. C. A. Coello, C. Dhaenens, and L. Jourdan, Advances in Multi-Objective Nature Inspired Computing, Springer, 1st edition, 2010.
  13. C. A. Coello and R. Landa, “Evolutionary multiobjective optimization using a cultural algorithm,” in Proceedings of the IEEE Swarm Intelligence Symposium, pp. 6–13, IEEE Service Center, Piscataway, NJ, USA, 2003.
  14. R. Zhang, J. Zhou, L. Mo, S. Ouyang, and X. Liao, “Economic environmental dispatch using an enhanced multi-objective cultural algorithm,” Electric Power Systems Research, vol. 99, pp. 18–29, 2013. View at Publisher · View at Google Scholar · View at Scopus
  15. S. Srinivasan and S. Ramakrishnan, “A social intelligent system for multi-objective optimization of classification rules using cultural algorithms,” Computing, vol. 95, no. 4, pp. 327–350, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. G. G. Cabrera, C. Vasconcellos, R. Soto, J. M. Rubio, F. Paredes, and B. Crawford, “An evolutionary multi-objective optimization algorithm for portfolio selection problem,” International Journal of Physical Sciences, vol. 6, no. 22, pp. 5316–5327, 2011. View at Google Scholar · View at Scopus
  17. R. Reynolds and D. Liu, “Multi-objective cultural algorithms,” in Proceedings of the IEEE Congress of Evolutionary Computation (CEC '11), pp. 1233–1241, June 2011. View at Publisher · View at Google Scholar · View at Scopus
  18. G. Cabrera, J. M. Rubio, D. Díaz, B. Fernández, C. Cubillos, and R. Soto, “A cultural algorithm applied in a BiObjective uncapacitated facility location problem,” in Evolutionary Multi-Criterion Optimization, R. Takahashi, K. Deb, E. Wanner, and S. Greco, Eds., vol. 6576 of Lecture Notes in Computer Science, pp. 477–491, Springer, Berlin, Germany, 2011. View at Google Scholar
  19. J. Knowles and D. Corne, “On metrics for comparing nondominated sets,” in Proceedings of the Congress on Evolutionary Computation (CEC '02), vol. 1, pp. 711–716, Honolulu, Hawaii, USA, May 2002. View at Publisher · View at Google Scholar
  20. I. Kaliszewski, Soft Computing for Complex Multiple Criteria Decision Making, vol. 85 of International Series in Operations Research & Management Science, Springer, 2006.
  21. M. Ehrgott, Multicriteria Optimization, Springer, Berlin, Germany, 2nd edition, 2005. View at MathSciNet
  22. A. Farhang-mehr and S. Azarm, “Minimal sets of quality metrics,” in Proceedings of the 2nd International Conference on Evolutionary Multi-Criterion Optimization (EMO '03), Lecture Notes in Computer Science, pp. 405–417, Springer, 2003.
  23. M. P. Hansen and A. Jaszkiewicz, “Evaluating the quality of approximations to the non-dominated set,” Tech. Rep. IMM-REP-1998-7, Institute of Mathematical Modelling , Technical University of Denmark, 1998. View at Google Scholar
  24. E. Zitzler, Evolutionary algorithms for multiobjective optimization: methods and applications [Ph.D. thesis], Swiss Federal Institute of Technology (ETH), Zurich, Switzerland, 1999.
  25. E. Zitzler, K. Deb, and L. Thiele, “Comparison of multiobjective evolutionary algorithms: empirical results,” Evolutionary Computation, vol. 8, no. 2, pp. 173–195, 2000. View at Publisher · View at Google Scholar · View at Scopus
  26. J. G. Villegas, F. Palacios, and A. L. Medaglia, “Solution methods for the bi-objective (cost-coverage) unconstrained facility location problem with an illustrative example,” Annals of Operations Research, vol. 147, pp. 109–141, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  27. M. Ehrgott and X. Gandibleux, “Hybrid metaheuristics for multi-objective combinatorial optimization,” in Hybrid Metaheuristics, C. Blum, M. J. B. Aguilera, A. Roli, and M. Sampels, Eds., vol. 114 of Studies in Computational Intelligence, pp. 221–259, Springer, Berlin, Germany, 2008. View at Google Scholar
  28. J. Bramel and D. Simchi-Levi, The Logic of Logistics: Theory, Algorithms, and Applications for Logistics Management, Springer, New York, NY, USA, 1997.
  29. M. S. Daskin, Network and Discrete Location: Models, Algorithms, and Applications, Wiley-Interscience, New York, NY, USA, 1st edition, 1995. View at Publisher · View at Google Scholar · View at MathSciNet
  30. Z. Drezner and H. Hamacher, Facility Location: Applications and Theory, Springer, Berlin, Germany, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  31. R. Z. Farahani, M. SteadieSeifi, and N. Asgari, “Multiple criteria facility location problems: a survey,” Applied Mathematical Modelling, vol. 34, no. 7, pp. 1689–1709, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  32. C. S. Revelle and G. Laporte, “The plant location problem: new models and research prospects,” Operations Research, vol. 44, no. 6, pp. 864–874, 1996. View at Publisher · View at Google Scholar · View at Scopus
  33. R. G. Reynolds, New Ideas in Optimization, McGraw-Hill, Maidenhead, UK, 1999.
  34. R. Landa Becerra and C. A. Coello Coello, “A cultural algorithm with differential evolution to solve constrained optimization problems,” in Advances in Artificial Intelligence (IBERAMIA '04), C. Lemaître, C. Reyes, and J. A. González, Eds., vol. 3315 of Lecture Notes in Computer Science, pp. 881–890, Springer, Berlin, Germany, 2004. View at Google Scholar
  35. C. Soza, R. Landa, M. Riff, and C. Coello, “A cultural algorithm with operator parameters control for solving timetabling problems,” in Foundations of Fuzzy Logic and Soft Computing, P. Melin, O. Castillo, L. Aguilar, J. Kacprzyk, and W. Pedrycz, Eds., vol. 4529 of Lecture Notes in Computer Science, pp. 810–819, Springer, Berlin, Germany, 2007. View at Publisher · View at Google Scholar
  36. M. Hoefer, “UflLib, Benchmark Instances for the Uncapacitated Facility Location Problem,” 2014.