Abstract
The so called second generation of Multi-Objective Evolutionary Algorithms (MOEAs) like NSGA-II, are highly efficient and obtain Pareto optimal fronts characterized mainly by a wider spread and visually distributed fronts. The subjacent idea is to provide the decision-makers (DM) with the most representative set of alternatives in terms of objective values, reserving the articulation of preferences to an a posteriori stage. Nevertheless, in many real discrete problems the number of solutions that belong the Pareto front is unknown and if the specified size of the non-dominated population in the MOEA is less than the number of solutions of the problem, the found front will be incomplete for a posteriori Making Decision. A possible strategy to overcome this difficulty is to promote those solutions placed in the region of interest while neglecting the others during the search, according to some DM's preferences. We propose TOPSISGA, that merges the second generation of MOEAs (we use NSGA-II) with the well known multiple criteria decision making technique TOPSIS whose main principle is to identify as preferred solutions those ones with the shortest distance to the positive ideal solution and the longest distance from the negative ideal solution. The method induces an ordered list of alternatives in accordance to the DM's preferences based on Similarity to the ideal point.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cvetkovic D, Coello C (2005) Human preferences and their applications in evolutionary multi- objective optimization. In: Yaochu J (ed) Knowledge incorporation in evolutionary computation (Studies in Fuzziness and Soft Computing, vol. 167). Springer, Berlin, pp 479–502
Deb K, Pratap A, Agrawal S, Meyarivan T (2002) A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans Evol Comput 6(2):182–197
Deb K, Sundar J, Udaya Bhaskara Rao N, Chaudhuri S (2006) Reference Point based multi- objective optimization using evolutionary algorithms. Int J Comput Intell Res 2(3):273–286
Galván B (1999) Contributions to fault tree quantitative evaluation. Dissertation, Physics Department, Las Palmas de Gran Canaria University, Canary Islands, Spain, (In Spanish)
Greiner D, Galván B, Winter G (2003) Safety systems optimum design by multicriteria evolutionary algorithms. In: Evolutionary multi-criterion optimization, LNCS 2632. Springer, Berlin, pp 722–736
Hwang CL, Yoon K (1981) Multiple attribute decision making: methods and applications. Springer, Heidelberg
Ishibuchi H, Narukawa K (2004) Performance evaluation of simple multiobjective genetic local search algorithms on multiobjective 0/1 knapsack problems. Proc. 2004 Congress on Evolutionary Computation (CEC'2004), IEEE Service Center, vol. 1, pp 441–448
Jaszkiewicz A (2002) On the Performance of Multiple Objective Genetic Local Search on the 0/1 Knapsack Problem. A comparative experiment. IEEE Trans Evol Comput 6(4):402–412
Kwangsun Yoon (1987) A reconciliation among discrete compromise solutions. J Oper Res Soc 38(3):277–286
Zitzler E, Deb K, Thiele L (2000) Comparison of multiobjective evolutionary algorithms: empirical results. Evol Comput J 8(2):125–148
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Méndez, M., Galván, B., Salazar, D., Greiner, D. (2009). Multiple-Objective Genetic Algorithm Using the Multiple Criteria Decision Making Method TOPSIS. In: Barichard, V., Ehrgott, M., Gandibleux, X., T'Kindt, V. (eds) Multiobjective Programming and Goal Programming. Lecture Notes in Economics and Mathematical Systems, vol 618. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85646-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-85646-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85645-0
Online ISBN: 978-3-540-85646-7
eBook Packages: Business and EconomicsBusiness and Management (R0)