Computational Intelligence Algorithms for Dynamic Multiobjective Optimization Problems

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

Deadline for manuscript submissions: closed (31 December 2022) | Viewed by 3173

Special Issue Editors


E-Mail Website
Guest Editor
School of ICT, Griffith University, Gold Coast campus, Southport, QLD 4214, Australia
Interests: dynamic multiobjective optimization; many-objective optimization; constraint handling; decision making; visualization; computational intelligence algorithms and metaheuristics

grade E-Mail Website
Guest Editor
BEACON Center for the Study of Evolution in Action, Department of Computer Science and Engineering, Department of Mechanical Engineering, Michigan State University, East Lansing, MI 48864, USA
Interests: nonlinear optimization; many- and multiobjective optimization; metamodeling; constraint handling; engineering design; evolutionary algorithms and metaheuristics; innovization; neural networks; data mining and machine learning

Special Issue Information

Dear Colleagues,

Most optimization problems have more than one objective, with at least two objectives in conflict with one another. Due to the conflicting objectives of the optimization problem, a single solution does not exist. Instead, a set of optimal trade-off solutions exist, referred to as the Pareto-optimal front (POF) or Pareto frontier. These optimization problems are referred to as multiobjective optimization problems (MOPs).

In many real-world situations, the optimization problem does not remain static but is dynamic and changes over time. However, in recent years, most research has focused on either static MOPs or dynamic single-objective optimization problems (DSOPs). When solving dynamic multiobjective optimization (DMOO) problems (DMOPs), an algorithm must track the changing POF over time by finding solutions as close as possible to the POF and maintaining a diverse set of solutions.  

This Special Issue aims to highlight the latest developments in DMOO, and to bring together researchers from both academia and industry to address challenges in the field. 

Topics of particular interest are:

  • Theoretical analysis of computational intelligence DMOO algorithms (DMOAs);
  • New approaches to compare and analyse the performance of DMOAs (performance measures, benchmarks, visualization);
  • Fitness landscape analysis of DMOPs;
  • Dealing with uncertainty when solving DMOPs;
  • Decision making and incorporating decision maker preferences when solving DMOPs;
  • Applying DMOAs to real-world DMOPs;
  • Comparing the performance of DMOAs to non-CI approaches on real-world DMOPs.

Dr. Marde Helbig
Prof. Dr. Kalyanmoy Deb
Guest Editors

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

  • Dynamic multiobjective optimization
  • Computational intelligence algorithms
  • Fitness landscape analysis
  • Decision making
  • Uncertainty
  • Real-world problems

Published Papers (1 paper)

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

Research

17 pages, 3816 KiB  
Article
A Multi-Agent Motion Prediction and Tracking Method Based on Non-Cooperative Equilibrium
by Yan Li, Mengyu Zhao, Huazhi Zhang, Yuanyuan Qu and Suyu Wang
Mathematics 2022, 10(1), 164; https://doi.org/10.3390/math10010164 - 05 Jan 2022
Cited by 1 | Viewed by 2440
Abstract
A Multi-Agent Motion Prediction and Tracking method based on non-cooperative equilibrium (MPT-NCE) is proposed according to the fact that some multi-agent intelligent evolution methods, like the MADDPG, lack adaptability facing unfamiliar environments, and are unable to achieve multi-agent motion prediction and tracking, although [...] Read more.
A Multi-Agent Motion Prediction and Tracking method based on non-cooperative equilibrium (MPT-NCE) is proposed according to the fact that some multi-agent intelligent evolution methods, like the MADDPG, lack adaptability facing unfamiliar environments, and are unable to achieve multi-agent motion prediction and tracking, although they own advantages in multi-agent intelligence. Featured by a performance discrimination module using the time difference function together with a random mutation module applying predictive learning, the MPT-NCE is capable of improving the prediction and tracking ability of the agents in the intelligent game confrontation. Two groups of multi-agent prediction and tracking experiments are conducted and the results show that compared with the MADDPG method, in the aspect of prediction ability, the MPT-NCE achieves a prediction rate at more than 90%, which is 23.52% higher and increases the whole evolution efficiency by 16.89%; in the aspect of tracking ability, the MPT-NCE promotes the convergent speed by 11.76% while facilitating the target tracking by 25.85%. The proposed MPT-NCE method shows impressive environmental adaptability and prediction and tracking ability. Full article
Show Figures

Figure 1

Back to TopTop