{"editor":[{"first_name":"O","last_name":"Schütze","full_name":"Schütze, O"},{"first_name":"Coello CA","full_name":"Coello, Coello CA","last_name":"Coello"},{"last_name":"Tantar","full_name":"Tantar, A","first_name":"A"},{"first_name":"E","full_name":"Tantar, E","last_name":"Tantar"},{"first_name":"P","last_name":"Bouvry","full_name":"Bouvry, P"},{"last_name":"Del","full_name":"Del, Moral P","first_name":"Moral P"},{"first_name":"P","last_name":"Legrand","full_name":"Legrand, P"}],"publication":"EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II","page":"89–105","language":[{"iso":"eng"}],"citation":{"short":"H. Trautmann, G. Rudolph, C. Dominguez-Medina, O. Schütze, in: O. Schütze, C.C. Coello, A. Tantar, E. Tantar, P. Bouvry, M.P. Del, P. Legrand (Eds.), EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II, Springer Berlin Heidelberg, 2013, pp. 89–105.","ieee":"H. Trautmann, G. Rudolph, C. Dominguez-Medina, and O. Schütze, “Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems,” in <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II</i>, vol. 175, O. Schütze, C. C. Coello, A. Tantar, E. Tantar, P. Bouvry, M. P. Del, and P. Legrand, Eds. Springer Berlin Heidelberg, 2013, pp. 89–105.","bibtex":"@inbook{Trautmann_Rudolph_Dominguez-Medina_Schütze_2013, series={Advances in Intelligent Systems and Computing}, title={Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems}, volume={175}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-31519-0_6\">10.1007/978-3-642-31519-0_6</a>}, booktitle={EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II}, publisher={Springer Berlin Heidelberg}, author={Trautmann, Heike and Rudolph, G and Dominguez-Medina, C and Schütze, O}, editor={Schütze, O and Coello, Coello CA and Tantar, A and Tantar, E and Bouvry, P and Del, Moral P and Legrand, P}, year={2013}, pages={89–105}, collection={Advances in Intelligent Systems and Computing} }","ama":"Trautmann H, Rudolph G, Dominguez-Medina C, Schütze O. Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems. In: Schütze O, Coello CC, Tantar A, et al., eds. <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II</i>. Vol 175. Advances in Intelligent Systems and Computing. Springer Berlin Heidelberg; 2013:89–105. doi:<a href=\"https://doi.org/10.1007/978-3-642-31519-0_6\">10.1007/978-3-642-31519-0_6</a>","chicago":"Trautmann, Heike, G Rudolph, C Dominguez-Medina, and O Schütze. “Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems.” In <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II</i>, edited by O Schütze, Coello CA Coello, A Tantar, E Tantar, P Bouvry, Moral P Del, and P Legrand, 175:89–105. Advances in Intelligent Systems and Computing. Springer Berlin Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-31519-0_6\">https://doi.org/10.1007/978-3-642-31519-0_6</a>.","mla":"Trautmann, Heike, et al. “Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems.” <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II</i>, edited by O Schütze et al., vol. 175, Springer Berlin Heidelberg, 2013, pp. 89–105, doi:<a href=\"https://doi.org/10.1007/978-3-642-31519-0_6\">10.1007/978-3-642-31519-0_6</a>.","apa":"Trautmann, H., Rudolph, G., Dominguez-Medina, C., &#38; Schütze, O. (2013). Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems. In O. Schütze, C. C. Coello, A. Tantar, E. Tantar, P. Bouvry, M. P. Del, &#38; P. Legrand (Eds.), <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II</i> (Vol. 175, pp. 89–105). Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-31519-0_6\">https://doi.org/10.1007/978-3-642-31519-0_6</a>"},"publisher":"Springer Berlin Heidelberg","type":"book_chapter","_id":"46386","status":"public","year":"2013","user_id":"15504","title":"Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems","abstract":[{"text":"The averaged Hausdorff distance Δ p is a performance indicator in multi-objective evolutionary optimization which simultaneously takes into account proximity to the true Pareto front and uniform spread of solutions. Recently, the multi-objective evolutionary algorithm Δ p -EMOA was introduced which successfully generates evenly spaced Pareto front approximations for bi-objective problems by integrating an external archiving strategy into the SMS-EMOA based on Δ p . In this work a conceptual generalization of the Δ p -EMOA for higher objective space dimensions is presented and experimentally compared to state-of-the art EMOA as well as specialized EMOA variants on three-dimensional optimization problems.","lang":"eng"}],"series_title":"Advances in Intelligent Systems and Computing","intvolume":"       175","date_updated":"2023-10-16T13:45:12Z","volume":175,"department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T15:38:25Z","doi":"10.1007/978-3-642-31519-0_6","author":[{"orcid":"0000-0002-9788-8282","first_name":"Heike","id":"100740","full_name":"Trautmann, Heike","last_name":"Trautmann"},{"first_name":"G","full_name":"Rudolph, G","last_name":"Rudolph"},{"last_name":"Dominguez-Medina","full_name":"Dominguez-Medina, C","first_name":"C"},{"first_name":"O","last_name":"Schütze","full_name":"Schütze, O"}],"publication_identifier":{"isbn":["978-3-642-31518-3"]}}