Multi-Objective Optimization and Evolutionary Computing with Applications

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "E1: Mathematics and Computer Science".

Deadline for manuscript submissions: 10 July 2025 | Viewed by 587

Special Issue Editor

Leiden Institute of Advanced Computer Science (LIACS) and Applied Quantum Algorithms Leiden (aQa), Leiden University, 2333 CA Leiden, The Netherlands
Interests: Bayesian optimization; multi-objective optimization; variational quantum algorithms; benchmarking; machine learning

Special Issue Information

Dear Colleagues,

In many real-world scenarios, we have to deal with multiple conflicting objectives. For such optimization scenarios, the goal is to find a set of pareto-optimal solutions representing the optimal trade-offs between different objectives. Solving this multi-objective optimization task is highly challenging when each objective function is nonlinear, discontinuous, or subject to constraints or when the decision vector consists of mixed-integer/categorical variables. Practically, evolutionary algorithms have been developed for multi-objective optimization problems, which, empirically, can find near-optimal solutions with acceptable running times. As an alternative, Bayesian optimization has been generalized to multi-objective optimization problems for expensive-to-evaluate objective functions, focusing on reducing the queries to the objective function.

This Special Issue aims to provide a platform for researchers and practitioners to share their advancements and applications in this area. We particularly welcome the authors to contribute to the following aspects: development of new evolutionary or Bayesian optimization algorithms, mathematical programming, theoretical foundations, novel formulation of real-world problems, constraint handling approaches, machine learning for multi-objective optimization, innovative applications of multi-objective optimization algorithms, benchmarking, and performance measures/assessment.

Dr. Hao Wang
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • multi-objective optimization
  • Bayesian optimization
  • evolutionary algorithms
  • evolution strategies
  • black-box optimization
  • performance measures/indicators
  • benchmarking
  • metaheuristics
  • mathematical optimization
  • machine learning

Benefits of Publishing in a Special Issue

  • Ease of navigation: Grouping papers by topic helps scholars navigate broad scope journals more efficiently.
  • Greater discoverability: Special Issues support the reach and impact of scientific research. Articles in Special Issues are more discoverable and cited more frequently.
  • Expansion of research network: Special Issues facilitate connections among authors, fostering scientific collaborations.
  • External promotion: Articles in Special Issues are often promoted through the journal's social media, increasing their visibility.
  • Reprint: MDPI Books provides the opportunity to republish successful Special Issues in book format, both online and in print.

Further information on MDPI's Special Issue policies can be found here.

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

28 pages, 5728 KiB  
Article
Reference Set Generator: A Method for Pareto Front Approximation and Reference Set Generation
by Angel E. Rodriguez-Fernandez, Hao Wang and Oliver Schütze
Mathematics 2025, 13(10), 1626; https://doi.org/10.3390/math13101626 - 15 May 2025
Viewed by 96
Abstract
In this paper, we address the problem of obtaining bias-free and complete finite size approximations of the solution sets (Pareto fronts) of multi-objective optimization problems (MOPs). Such approximations are, in particular, required for the fair usage of distance-based performance indicators, which are frequently [...] Read more.
In this paper, we address the problem of obtaining bias-free and complete finite size approximations of the solution sets (Pareto fronts) of multi-objective optimization problems (MOPs). Such approximations are, in particular, required for the fair usage of distance-based performance indicators, which are frequently used in evolutionary multi-objective optimization (EMO). If the Pareto front approximations are biased or incomplete, the use of these performance indicators can lead to misleading or false information. To address this issue, we propose the Reference Set Generator (RSG), which can, in principle, be applied to Pareto fronts of any shape and dimension. We finally demonstrate the strength of the novel approach on several benchmark problems. Full article
Show Figures

Figure 1

Back to TopTop