Loading...
 
Skip to main content

Analysing algorithmic behaviour of optimisation heuristics

Webpage: https://aaboh.nl/

Description

Optimisation and Machine Learning tools are among the most used tools in the modern world with their omnipresent computing devices. Yet, while both these tools rely on search processes (search for a solution or a model able to produce solutions), their dynamics have not been fully understood. This scarcity of knowledge on the inner workings of heuristic methods is largely attributed to the complexity of the underlying processes, which cannot be subjected to a complete theoretical analysis. However, this is also partially due to a superficial experimental setup and, therefore, a superficial interpretation of numerical results. In fact, researchers and practitioners typically only look at the final result produced by these methods. Meanwhile, a great deal of information is wasted in the run. In light of such considerations, it is now becoming more evident that such information can be useful and that some design principles should be defined that allow for online or offline analysis of the processes taking place in the population and their dynamics.
Hence, with this workshop, we call for both theoretical and empirical achievements, identifying the desired features of optimisation and machine learning algorithms, quantifying the importance of such features, spotting the presence of intrinsic structural biases and other undesired algorithmic flaws, studying the transitions in algorithmic behaviour in terms of convergence, any-time behaviour, traditional and alternative performance measures, robustness, exploration vs exploitation balance, diversity, algorithmic complexity, etc., with the goal of gathering the most recent advances to fill the aforementioned knowledge gap and disseminate the current state-of-the-art within the research community. Thus, we encourage submissions exploiting carefully designed experiments or data-heavy approaches that can come to help in analysing primary algorithmic behaviours and modelling internal dynamics causing them.
Workshop format: invited talks, paper presentations, and a panel discussion.

Submission format

Full papers and extended abstracts:

  • Full papers (8 pages + references): Must cover the ACM Open APC (see below for more information)
  • Extended Abstracts (up to 4 pages): Are not eligible for APC - no fee paid by the authors for ACM Open Access. An Extended Abstract provides a summary of a work-in-progress, typically just enough for readers to understand the idea, scope, and potential impact. It often lacks full methodology, detailed results, or extensive references.

Important dates

  • Submission opening: February 2, 2026
  • Submission deadline: March 27, 2026 April 03, 2026
  • Notification: April 24, 2026
  • Camera-ready: May 5, 2026
  • Author's mandatory registration: May 11, 2026

ACMs new Open Access publishing model for 2026 ACM Conferences

Starting January 1, 2026, ACM will fully transition to Open Access. All ACM publications, including those from ACM-sponsored conferences, will be 100% Open Access. Authors will have two primary options for publishing Open Access articles with ACM: the ACM Open institutional model or by paying Article Processing Charges (APCs). With over 2,600 institutions already part of ACM Open, the majority of ACM-sponsored conference papers will not require APCs from authors or conferences (currently, around 76%).

Authors from institutions not participating in ACM Open will need to pay an APC to publish their papers, unless they qualify for a financial waiver. To find out whether an APC applies to your article, please consult the list of participating institutions in ACM Open and review the APC Waivers and Discounts Policy. Keep in mind that waivers are rare and are granted based on specific criteria set by ACM.

Understanding that this change could present financial challenges, ACM has approved a temporary subsidy for 2026 to ease the transition and allow more time for institutions to join ACM Open. The subsidy will offer:

  • $250 APC for ACM/SIG members
  • $350 for non-members

This represents a 65% discount, funded directly by ACM. Authors are encouraged to help advocate for their institutions to join ACM Open during this transition period.

This temporary subsidized pricing will apply to all conferences scheduled for 2026.

Additionally, SIGEVO will provide an additional subsidy of $125 to papers accepted to GECCO 2026 (and only for 2026) that are subject to APCs. This will make the final amounts to be paid:

  • $125 (USD) for SIGEVO members
  • $225 (USD) for non-members

It is IMPORTANT to mention that both forms of subsidy (by ACM and by SIGVO) only apply to GECCO 2026. Moreover, it is still to be determined how the SIGEVO subsidy will be implemented, either directly to the APC or in other forms.

Finally, we note that APC charges apply to accepted Full Papers, but Abstracts (1-2 pages), Extended Abstracts (1-4 pages) and Tutorials ARE NOT APC Eligible; i.e., an APC will not have to be paid for these types of contributions.

ACM Authorship and Peer Review Policies on Generative AI

GECCO follows the official ACM policies on authorship and peer review, including the use of generative AI tools.

Under ACM's Authorship policy, generative AI tools and technologies cannot be listed as authors of an ACM published Work. The use of generative AI tools and technologies for assistance must be fully disclosed in the manuscript's Acknowledgments section. Authors are fully accountable for the originality, accuracy, and integrity of all submitted material.

In accordance with ACM's Peer Review policy, reviewers must not upload or share submitted manuscripts or review materials with generative AI systems. Reviewers may use generative AI or tools with the sole purpose of improving the quality and readability of reviewer reports for the author.

ACM is actively developing tools to help identify improper AI use in submissions, and GECCO may employ available detection methods. Submissions found to violate ACM policies may be rejected.


-

Organizers

Anna V Kononova

Anna V. Kononovais an Assistant Professor at the Leiden Institute of Advanced ComputerScience. She received her MSc degree in Applied Mathematics from Yaroslavl State University (Russia) in 2004 and PhD degree in Computer Science from University of Leeds (UK) in 2010. After a total of 5 years of postdoctoral experiences at Technical University Eindhoven (The Netherlands) and Heriot-Watt University (Edinburgh, UK), Anna has spent a number of years working as a mathematician in industry. Her current research interests include analysis of optimisation algorithms and machine learning.

Niki van Stein

Niki van Stein is an Associate Professor at the Leiden Institute of Advanced Computer Science (LIACS), Leiden University, specializing in Explainable Artificial Intelligence (XAI). Since January 2022, Dr. van Stein has led the XAI research group and is a member of the management team of the Natural Computing cluster. Her research focuses on the intersection of machine learning, LLMs, optimization, and XAI, with applications in predictive maintenance, time-series analysis, and engineering design. Dr. van Stein obtained a PhD in Computer Science from Leiden University in 2018, under the supervision of Prof. Dr. Thomas Bäck, with a thesis on data-driven modelling and optimization of industrial processes.
With over 90 peer-reviewed publications and multiple awards, including best paper recognitions at GECCO and the IEEE Symposium Series on Computational Intelligence, Dr. van Stein has made significant contributions to the fields of evolutionary computing and explainable artificial intelligence.

Thomas Bäck

Thomas Back received his Diploma and Ph.D. degrees in Computer Science from the University of Dortmund, Germany, in 1990 and 1994, respectively. He is a Professor of Computer Science at the Leiden Institute of Advanced Computer Science (LIACS), Leiden University, Netherlands, with research interests in evolutionary computation, machine learning, and their applications in sustainable industry and healthcare. He is a member of the Royal Netherlands Academy of Arts and Sciences (KNAW, 2021), IEEE Fellow (2022), and Academia Europaea (2022). He has received several awards, including the IEEE CIS Evolutionary Computation Pioneer Award (2015) and the best Ph.D. thesis award from the German Computer Science Society (1995). Dr. Bäck serves as Editor in Chief of the Evolutionary Computation Journal, and holds editorial roles with several other journals. He has co-edited major handbooks and authored notable works in evolutionary computation.

Daniela Zaharie

Daniela Zaharie is a Professor at the Department of Computer Science from the West University of Timisoara (Romania) with a PhD degree on a topic related to stochastic modelling of neural networks and a Habilitation thesis on the analysis of the behaviour of differential evolution algorithms. Her current research interests include analysis and applications of metaheuristic algorithms, interpretable machine learning models and data mining.

Fabio Caraffini

Fabio Caraffini is Associate Professor in Artificial Intelligence at Swansea University (UK). He received the BSc in Electronics Engineering' and the MSc in Telecommunications Engineering’ degrees from the University of Perugia (Italy) in 2008 and 2011, respectively and holds a PhD in Computer Science (De Montfort University, UK, 2014) and a PhD in Mathematical Information Technology (University of Jyväskylä, Finland, 2016). His research interests include fundamental and applied computational intelligence with a strong emphasis on metaheuristics for optimisation. Fabio actively contributes to the research community in Computational Intelligence by serving on the programme committee of several conferences and as an associate editor for journals such as Applied Intelligence (Springer) and the IEEE Transactions on Evolutionary Computation.