CALL FOR PAPERS
***********************************************************
GECCO 2023 Workshop on
Strict Box-Constraint Optimization Studies (SBOX-COST)
The Genetic and Evolutionary Computation Conference (GECCO 2023)
July 15-19, 2023, Lisbon, Portugal.
Webpage: https://sbox-cost.github.io
***********************************************************
## About the workshop
Benchmarking plays a critical role in the design and development of
optimization algorithms. The way in which benchmark suites are set up thus
influences the set of algorithms recommended to practitioners and biases the
goals of algorithm designers. The focus of this workshop is on benchmarking
algorithms on problems with box constraints (i.e. upper and lower limits on
the input variables defining the domain of the search space). In practical
applications, evaluating points outside of the domain is often impossible,
or not sensible, and as such, should be avoided. However, in benchmarking as
practiced today, problems are well-defined even outside of the stated
parameter ranges, which translates to the algorithms being able to safely
ignore these ranges and operate on infeasible solutions.
Setting up box constraints represents the simplest type of constraints and
gives rise to the so-called box-constrained problems. In this workshop, we
will discuss in more detail how the presence of box-constraints impacts the
performance of optimization algorithms and provide participants with a new
variant of the BBOB suite called SBOX-COST for continuous, single-objective,
noiseless optimization.
Two types of submissions will be accepted for this workshop:
1. Short papers (up to 4 pages) reporting results of new or existing
algorithms on the provided BBOB SBOX-COST suite of (box-constrained) test
functions. Please refer to the following link for the data and instructions
on how to use it: https://github.com/sbox-cost/Examples
2. Longer papers (up to 8 pages) discussing aspects related to the presence
of box-constraints.
Topics of interest (but not limited to) include:
. New insights of existing algorithms when applied to box-constrained
problems
. Performance analysis and visualization of algorithms on the provided BBOB
SBOX-COST suite of test functions
. Algorithm design for box-constrained problems
. Metrics for benchmarking algorithm performance on and complexity of
box-constrained problems
. Other aspects of box-constrained benchmarking optimization algorithms
## Submission
For paper submission instructions and templates, please see the submission
instructions https://gecco-2023.sigevo.org/Paper-Submission-Instructions
## Important (STRICT) deadline dates (preliminary)
Submission opening: February 13, 2023
Submission deadline: April 14, 2023
Notification to authors: May 3, 2023
Camera-ready papers: May 10, 2023
Author's mandatory registration: May 10, 2023
## Workshop organizers
Anna V. Kononova (Leiden University, NL), Olaf Mersmann (TH Koeln, GER),
Diederick Vermetten (Leiden University, NL), Manuel Lopez-Ibanez (The
University of Manchester, UK), Richard Allmendinger (The University of
Manchester, UK), Youngmin Kim (The University of Manchester, UK)
More information about the organizers can be found on the workshop webpage
https://sbox-cost.github.io
## Contact
Please feel free contact a.kononova@liacs.leidenuniv.nl
in case of questions.
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************
Posts
