{"id":652,"date":"2021-12-15T16:53:31","date_gmt":"2021-12-15T16:53:31","guid":{"rendered":"http:\/\/www.gecad.isep.ipp.pt\/ERM-competitions\/?page_id=652"},"modified":"2023-12-14T10:36:11","modified_gmt":"2023-12-14T10:36:11","slug":"2022-2","status":"publish","type":"page","link":"https:\/\/www.gecad.isep.ipp.pt\/ERM-competitions\/2022-2\/","title":{"rendered":"Call for Competition on Evolutionary Computation in the Energy Domain: Risk-based Energy Scheduling"},"content":{"rendered":"\n

GECCO 2022<\/a> & IEEE WCCI 2022<\/a> (Joint competition)<\/p>\n\n\n\n

9-13 July – Boston, USA (GECCO 2022) | 18-23 July – Padua, Italy (WCCI 2022) <\/p>\n\n\n\n

Organized<\/strong> by Jo\u00e3o Soares, Fernando Lezama, Jos\u00e9 Almeida, Bruno Canizes, Zita Vale<\/p>\n\n\n\n

Final results have been published<\/strong> – 03 August 2022<\/strong><\/p>\n\n\n\n

\n\n\n\n

Final Rank Results<\/h2>\n\n\n\n

<\/p>\n\n\n\n

Final Rank<\/strong><\/td>Name<\/strong><\/td>Affiliation, Country<\/strong><\/td>Algorithm<\/strong><\/td>Rank Index<\/strong><\/td><\/tr>
1
IEEE CIS Prize \u2013 500 $<\/span><\/strong><\/td>		Mengyuan Zhang, Mengchang Wang, and Wotao Yin<\/td>Decision Intelligence Lab @ Alibaba DAMO Academy, China<\/td>ReSaDE

Presentation<\/a>
Algorithm (link)<\/a><\/td>		\u200b14951<\/td><\/tr>
2<\/td>Ansel Y. Rodr\u00edguez Gonz\u00e1lez, \u00c1ngel D\u00edaz Pacheco, Ram\u00f3n Aranda, Miguel \u00c1. \u00c1lvarez-Carmona, Yoan Mart\u00ednez L\u00f3pez, and Julio Madera<\/td>Unidad de Transferencia Tecnol\u00f3gica Tepic del Centro de Investigaci\u00f3n Cient\u00edfica y de Educaci\u00f3n Superior de Ensenada, Mexico;
Consejo Nacional de Ciencia y Tecnolog\u00eda, Mexico;
Universidad de Camag\u00fcey, Cuba<\/td>		RCEDUMDA2022

Presentation<\/a>
Algorithm (link)<\/a><\/td>		\u200b15255<\/td><\/tr>
3<\/td>Dharmesh Dabhi and Kartik Pandya<\/td>Dept. of Electrical Engineering, CSPIT, CHARUSAT, India<\/td>CHAOTIC LEVY HC2RCEDUMDA

Presentation<\/a>
Algorithm (link)<\/a><\/td>		\u200b15777<\/td><\/tr>
4<\/td>Ricardo Faia, John Fredy, Tiago Pinto, and Juan Corchado<\/td>University of Salamanca (USAL), Spain; UTAD, Portugal; UNESP, Brazil<\/td>Mod-WHO<\/td>\u200b17387<\/td><\/tr>
5<\/td>Carolina Gil Marcelino, Gabriel Matos Cardoso Leite, Silvia Jimenez-Fernandez, Sancho Salcedo-Sanz<\/td>Federal University of Rio de Janeiro (UFRJ), Brazil; University of Alcal\u00e1 (UAH), Spain<\/td>C-DEEPSO_Mod<\/td>\u200b18115<\/td><\/tr>
6<\/td>Carolina Gil Marcelino, Gabriel Matos Cardoso Leite, Silvia Jimenez-Fernandez, and Sancho Salcedo-Sanz<\/td>Federal University of Rio de Janeiro (UFRJ), Brazil; University of Alcal\u00e1 (UAH), Spain<\/td>C-DEEPSO<\/td>\u200b18233<\/td><\/tr>
7<\/td>Yoan Mart\u00ednez L\u00f3pez, Miguel Bethencourt, Julio Madera Quintana, and Ansel Rodr\u00edguez Gonz\u00e1lez,<\/td>University Camag\u00fcey, Cuba; CICESE-UT3, M\u00e9xico.<\/td>VIEDA<\/td>\u200b18494<\/td><\/tr>
8<\/td>Xiang-Ling Chen and Wei-Neng Chen<\/td>South China University of Technology, China<\/td>PSO-KnnEDA<\/td>\u200b18543<\/td><\/tr>
9<\/td>Sergio Rivera and Pedro Julian Garcia<\/td>Universidade Nacional de Colombia (UNAL), Colombia<\/td>MDEEPSO<\/td>\u200b18545<\/td><\/tr>
10<\/td>Dr. Vasundhara Mahajan, Mr. Abhishek Saini, Mr. Shreyas More, and Mr. Suraj Hajari<\/td>Department of Electrical Engineering, Sardar Vallabhbhai National Institute of Technology, India<\/td>DE-TLBO<\/td>\u200b63365<\/td><\/tr>
11<\/td>Dr. Vasundhara Mahajan, Mr. Abhishek Saini, Mr. Shreyas More, and Mr. Suraj Hajari<\/td>Department of Electrical Engineering, Sardar Vallabhbhai National Institute of Technology, India<\/td>GA-PSO<\/td>\u200b81440<\/td><\/tr>
12<\/td>Dr. Vasundhara Mahajan, Mr. Abhishek Saini, Mr. Shreyas More, and Mr. Suraj Hajari<\/td>Department of Electrical Engineering, Sardar Vallabhbhai National Institute of Technology, India<\/td>ABC<\/td>\u200b87749<\/td><\/tr>
13<\/td>Gabriel Figueiredo Puerta, Enielma Cunha da Silva, Leonardo Henrique Faria Macedo Possagnolo, Norberto Abrante Martinez, John Fredy Franco Baquero, and Ruben Augusto Romero Lazaro<\/td>UNESP, LaPSEE, Brazil<\/td>PSO<\/td>\u200b173796<\/td><\/tr>
N\/A<\/td>Huwenhao, Wuyiling, Sunyue, and Chenzhen<\/td>University of Chinese Academy of Sciences (UCAS), China<\/td>Univariate Search<\/td>N\/A<\/td><\/tr>
N\/A<\/td>Wuyiling, Huwenhao, Sunyue, and Chenzhen<\/td>Nankai University, China<\/td>DRLR_DE<\/td>N\/A<\/td><\/tr><\/tbody><\/table><\/figure>\n\n\n\n

IEEE CIS PRIZE: <\/strong><\/strong>500$ IEEE Computational Intelligence Society (CIS) prize for the first ranked contestant. Good luck and stay tuned. Thanks! <\/p>\n\n\n\n

\n\n\n\n

Competition Outline<\/h2>\n\n\n\n

Following the success of the previous editions at IEEE PES; CEC; GECCO, WCCI, we are launching another challenging edition of the competition at major conferences in the field of computational intelligence. This edition of the WCCI\/GECCO 2022 competition proposes one track in the energy domain:<\/p>\n\n\n\n

Track 1) Risk-based optimization of aggregators\u2019 day-ahead energy resource management (ERM) considering uncertainty associated with the high penetration of distributed energy resources (DER). This testbed is constructed under the same framework of past competitions (therefore, former competitors can adapt their algorithms to this new track), representing a centralized day-ahead ERM in a smart grid with a 13-bus distribution network using a 15-scenario case study with 3 scenarios considering extreme events (high impact, and low probability). A conditional value-at-risk (CVaR) mechanism is used to measure the risk associated with the extreme events for a confidence level (\u03b1) of 95%. We also add some restrictions to the initialization of the initial solution and the allowed repairs and tweak heuristics.<\/p>\n\n\n\n

Note: The track is developed to run under the same framework of the past competitions.<\/p>\n\n\n\n

\n\n\n\n

Competition goals<\/h2>\n\n\n\n
\n\n\n\n

The WCCI\/GECCO 2022 competition on \u201cEvolutionary Computation in the Energy Domain: Risk-based Energy Scheduling\u201d has the purpose of bringing together and testing the more advanced Computational Intelligence (CI) techniques applied to energy domain problems, namely the risk-based optimal day-ahead ERM considering the uncertainty associated with high penetration of DER. The competition provides a coherent framework where participants and practitioners of CI can test their algorithms to solve a real-world optimization problem in the energy domain. The participants have the opportunity to evaluate if their algorithms can rank well in the proposed problem since we understand the validity of the \u201cno-free lunch theorem\u201d, making this contest a unique opportunity worth exploring the applicability of the developed approaches in a real-world problem beyond the typical benchmark and standardized CI problems.<\/p>\n\n\n\n

\n\n\n\n

Rules<\/h2>\n\n\n\n

– Participants will propose and implement metaheuristic algorithms (e.g., evolutionary algorithms, swarm intelligence, estimation of distribution algorithm, etc.) to solve complex problems in the energy domain by offering two distinct tracks. <\/p>\n\n\n\n

– The organizers provide a framework, implemented in MATALAB\u00a9 2018a 64 bits (Download here)<\/a>, in which participants can easily test their algorithms (we also provide a differential evolution algorithm implementation as an example). The guidelines  (<\/a>Download <\/a>here<\/a>)<\/a> include the necessary information to understand the problems, how the solutions are represented, and how the fitness function is evaluated. Those elements are common for all participants.<\/p>\n\n\n\n

– Since the proposed algorithms might have distinct sizes of population and run for a variable number of iterations, a maximum number of \u201c5,000 function evaluations\u201d is allowed for track 1. The convergence properties of the algorithms are not a criterion to be qualified in this competition.<\/p>\n\n\n\n

– The initial solutions should be initialized randomly between the upper and lower bounds of the variables. However, one solution can be initialized with the variable’s lower bounds since we found it can significantly help to find a better solution in this problem. Heuristics and special tweaks for initial solutions are not accepted.<\/p>\n\n\n\n

– 20 independent trials should be performed in the framework by each participant.
<\/p>\n\n\n\n

\n\n\n\n

How to submit an entry<\/h2>\n\n\n\n

–The winner will be the participant with the minimum ranking index<\/strong>, which is calculated as the average value over the 20 trials of the expected fitness value plus.<\/p>\n\n\n\n

– Each participant is kindly requested to put the text files corresponding to final results (see guideline document), as well as the implementation files (codes), obtained by using a specific optimizer, into a .zip named: WCCI2022_trackX_AlgorithmName<\/em>_ParticipantName<\/em>.zip (e.g. WCCI2022_track2_DE<\/em>_JoaoSoares<\/em>.zip).<\/p>\n\n\n\n

\n\n\n\n

Important Remarks<\/h2>\n\n\n\n

– Notice that submission of papers or assistance to WCCI and GECCO by competition participants is not mandatory.<\/p>\n\n\n\n

– You can submit a paper to the special session on Evolutionary Algorithms for Complex Optimization in the Energy Domain (WCCI SS-20). Submit it here<\/a> – select SS-20 as the primary subject area.<\/p>\n\n\n\n

– You are also welcome to submit short descriptions of your algorithms and results as 2-page papers to be included in the GECCO Companion. This is voluntary \u2014 The submission deadline is April 11, 2022<\/strong>. Submit it here<\/a> (Competition Entry Submissions<\/strong>)<\/p>\n\n\n\n

Submit your results by June 30<\/strong> 2022<\/strong> (anywhere on earth)<\/p>\n\n\n\n

<\/p>\n\n\n\n

\n\n\n\n

Further related bibliography<\/h3>\n\n\n\n