Wasserstein-Based Evolutionary Operators for Optimizing Sets of Points: Application to Wind-Farm Layout Design
Source abstract
Abstract
This paper introduces an evolutionary algorithm for objective functions defined over clouds of points of varying sizes. Such design variables are modeled as uniform discrete measures with finite support and the crossover and mutation operators of the algorithm are defined using the Wasserstein barycenter. We prove that the Wasserstein-based crossover has a contracting property in the sense that the support of the generated measure is included in the closed convex hull of the union of the two parents’ supports. We introduce boundary mutations to counteract this contraction. Variants of evolutionary operators based on Wasserstein barycenters are studied. We compare the resulting algorithm to a more classical, sequence-based, evolutionary algorithm on a family of test functions that include a wind-farm layout problem. The results show that Wasserstein-based evolutionary operators better capture the underlying geometrical structures of the considered test functions and outperform a reference evolutionary algorithm in the vast majority of the cases. The tests indicate that the mutation operators play a major part in the performances of the algorithms.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Textile materials and evaluations · Cellular and Composite Structures · 3D Shape Modeling and Analysis
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Ecole Nationale Supérieure des Mines de Saint-Etienne (EMSE), 42100 Saint-Étienne, France
Laboratoire d’Informatique, de Modélisation et d’Optimisation des Systèmes (LIMOS), 63178 Aubiere, France
EDF R&D, 78401 Chatou, France
Funding
French Agence Nationale de la Recherche
References (48)
Show source-provided references
1. TOPFARM—A tool for wind farm optimization10.1016/j.egypro.2013.07.184 ↗
2. Optimization of wind turbine positioning in large windfarms by means of a genetic algorithm10.1016/0167-6105(94)90080-9 ↗
3. Design of wind farm layout for maximum wind energy capture10.1016/j.renene.2009.08.019 ↗
4. Variable neighborhood search for large offshore wind farm layout optimization10.1016/j.cor.2021.105588 ↗
5. Optimization models for the installation planning of offshore wind farms10.1016/j.ejor.2024.01.011 ↗
6. Optimal operation of energy hub: An integrated model combined distributionally robust optimization method with Stackelberg game10.1109/TSTE.2023.3252519 ↗
7. The offshore wind farm array cable layout problem: A planar open vehicle routing problem10.1057/jors.2013.188 ↗
8. Snow water equivalent estimation using blackbox optimization
9. Bayesian Experimental Design: A Review10.1214/ss/1177009939 ↗
10. Stenger, J. (2020). Optimal Uncertainty Quantification of a Risk Measurement from a Computer Code. [Ph.D. Thesis, Université Paul Sabatier-Toulouse III].10.1615/Int.J.UncertaintyQuantification.2020030800 ↗
11. McLachlan, G.J., and Basford, K.E. (1988). Mixture Models. Inference and Applications to Clustering, M. Dekker.
12. Eiben, A.E., and Smith, J.E. (2015). Introduction to Evolutionary Computing, Springer.10.1007/978-3-662-44874-8 ↗
13. Kacprzyk, J., and Pedrycz, W. (2015). Evolution Strategies. Handbook of Computational Intelligence, Springer. Number 871-898.10.1007/978-3-662-43505-2_44 ↗
14. Offshore wind farm layout optimization using mathematical programming techniques10.1016/j.renene.2012.12.007 ↗
15. Byrd, R.H., Nocedal, J., and Waltz, R.A. (2006). K nitro: An integrated package for nonlinear optimization. Large-Scale Nonlinear Optimization, Springer.10.1007/0-387-30065-1_4 ↗
16. Fagerfjäll, P. (2010). Optimizing Wind Farm Layout: More Bang for the Buck Using Mixed Integer Linear Programming. [Master’s Thesis, Chalmers University of Technology and Gothenburg University]. Volume 111.
17. Mathematical optimization and algorithms for offshore wind farm design: An overview10.1007/s12599-018-0538-0 ↗
18. Kim, J. (2016). Cardinality Constrained Optimization Problems. [Ph.D. Dissertation, Purdue University].
19. Surry, P.D., and Radcliffe, N.J. (2013). Formal search algorithms + problem characterisations = executable search strategies. Theory and Principled Methods for the Design of Metaheuristics, Springer.10.1007/978-3-642-33206-7_11 ↗
20. Michalewicz, Z. (1996). Genetic Algorithms + Data Structures = Evolution Programs, Springer Science & Business Media.10.1007/978-3-662-03315-9 ↗
21. Genetic Set Recombination
22. Design of wind farm layout using ant colony algorithm10.1016/j.renene.2011.12.013 ↗
23. Solving the wind farm layout optimization problem using random search algorithm10.1016/j.renene.2015.01.005 ↗
24. Bilbao, M., and Alba, E. (2009, January 10–12). Simulated annealing for optimization of wind farm annual profit. Proceedings of the 2009 2nd International Symposium on Logistics and Industrial Informatics, Linz, Austria.10.1109/LINDI.2009.5258656 ↗
25. Placement of wind turbines using genetic algorithms10.1016/j.renene.2004.05.007 ↗
26. TOPFARM: Multi-fidelity optimization of wind farms10.1002/we.1667 ↗
27. Arora, J.S. (2004). Introduction to Optimum Design, Elsevier.10.1016/B978-012064155-0/50012-4 ↗
28. Goldberg, D. (1989). Genetic Algorithms in Search, Optimization and Machine Learning, Addion Wesley.
29. Integrated optimization of offshore wind farm layout design and turbine opportunistic condition-based maintenance10.1016/j.cie.2018.04.051 ↗
30. Optimisation of offshore wind farms using a genetic algorithm10.17736/ijope.2016.mmr16 ↗
31. Pillai, A.C., Chick, J., Johanning, L., Khorasanchi, M., and Barbouchi, S. (2016, January 19–24). Comparison of offshore wind farm layout optimization using a genetic algorithm and a particle swarm optimizer. Proceedings of the International Conference on Offshore Mechanics and Arctic Engineering, Busan, Republic of Korea.10.1115/OMAE2016-54145 ↗
32. Villani, C. (2009). Optimal Transport: Old and New, Springer.10.1007/978-3-540-71050-9 ↗
33. Sloss, A.N., and Gustafson, S. (2019). 2019 evolutionary algorithms review. arXiv.10.1007/978-3-030-39958-0_16 ↗
34. Evolutionary algorithms10.1002/widm.1124 ↗
35. Poincaré Fréchet mean10.1016/j.patcog.2023.109302 ↗
36. Montrucchio, L., and Pistone, G. (2019). Kantorovich distance on a finite metric space. arXiv.
37. Cuturi, M., and Doucet, A. (2014, January 22–24). Fast computation of Wasserstein barycenters. Proceedings of the International Conference on Machine Learning, PMLR, Beijing, China.
38. Pot: Python optimal transport
39. Barycenters in the Wasserstein space10.1137/100805741 ↗
40. A novel particle swarm optimization algorithm with Levy flight10.1016/j.asoc.2014.06.034 ↗
41. Eiben, A.E., Bäck, T., Schoenauer, M., and Schwefel, H.P. (1998, January 27–30). Extending population-based incremental learning to continuous search spaces. Proceedings of the Parallel Problem Solving from Nature—PPSN V, Amsterdam, The Netherlands.10.1007/BFb0056843 ↗
42. Hansen, N. (2006). The CMA evolution strategy: A comparing review. Towards a New Evolutionary Computation: Advances in the Estimation of Distribution Algorithms, Springer.
43. Santner, T.J., Williams, B.J., Notz, W.I., and Williams, B.J. (2003). The Design and Analysis of Computer Experiments, Springer.10.1007/978-1-4757-3799-8 ↗
44. Impacts of invariance in search: When CMA-ES and PSO face ill-conditioned and non-separable problems10.1016/j.asoc.2011.03.001 ↗
45. Real royal road functions-where crossover provably is essential10.1016/j.dam.2004.02.019 ↗
46. Dynamic selection of evolutionary operators based on online learning and fitness landscape analysis10.1007/s00500-016-2126-x ↗
47. El, N., and Hassan, H. (2011). Topologie Générale et Espaces Normés, Dunod. ZI des Hauts, no. Édition, 54692.
48. Paty, F.P., and Cuturi, M. (2019, January 9–15). Subspace robust Wasserstein distances. Proceedings of the International Conference on Machine Learning, PMLR, Long Beach, CA, USA.