Data-Driven or AI-Driven Optimization Algorithms and Their Applications

A special issue of Mathematics (ISSN 2227-7390).

Deadline for manuscript submissions: 31 July 2026 | Viewed by 5348

Special Issue Editors


E-Mail Website
Guest Editor
School of Economics and Management, Fuzhou University, Fuzhou 350108, China
Interests: machine scheduling; railway scheduling; healthcare scheduling; robotics scheduling; mine production scheduling; metaheuristics; machine learning
Special Issues, Collections and Topics in MDPI journals
School of Mathematics and Statistics, Yunnan University, Kunming 650106, China
Interests: combinatorial optimization; theoretic computer science; algorithmic game theory
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
School of Mathematics and Information Science, North Minzu University, Yinchuan 750030, China
Interests: supply chain management; variational inequalities; numerical approximations; convex optimization

E-Mail Website
Guest Editor
Department of Industrial Engineering, School of Mechanical and Electrical Engineering, Shihezi University, Shihezi 832003, China
Interests: logistics; experimental design optimization; multi-mode transportation scheduling; container scheduling; inventory management; combinatorial optimization; machine learning

Special Issue Information

Dear Colleagues,

Optimization is concerned with developing a set of modeling frameworks and solution techniques that allow practitioners to derive the best performance from a complex system. It is based on interdisciplinary expertise and skills in operations research, management science, industrial and systems engineering, and computer science. Optimization models and algorithms have been widely applied to industries such as manufacturing, mining, robotics, transportation, agriculture, energy grids, e-commerce, and healthcare.

This Special Issue will focus on recent theoretical and applied studies of data-driven optimization problems, models, analysis, algorithms, and real-world implementations. We expect to receive papers that reflect the integration of advanced optimization techniques, technologies, and applications to address increasingly complex problems across various fields.

Topics include—but are not limited to—the following:

  • Data-driven or AI-driven optimization with perdition, simulation, and digital twins.
  • Planning and scheduling optimization algorithms.
  • Optimization algorithms for supply chain management and operations management.
  • Reinforcement Learning for Optimization: applying reinforcement learning (RL), which learns to make sequential decisions in complex environments by receiving feedback from interactions with the environment.
  • Bayesian Optimization: using Bayesian inference (e.g., for hyperparameter tuning in machine learning models) to build a surrogate objective function model, enabling efficient and effective exploration of the entire solution space.
  • New Metaheuristics: development of new metaheuristic algorithms inspired by natural processes, such as social behaviors or physical phenomena.
  • Memetic Algorithms: combining local search techniques with population-based ones to enhance performance in solving complex optimization problems.
  • Explainable and Interpretable Optimization: a growing trend focuses on making optimization processes and their outcomes more transparent and interpretable because understanding the decision-making process is crucial for fields like healthcare, finance, and autonomous systems.
  • Hybrid Optimization Algorithms: combining different optimization methods with local search techniques or gradient-based methods with metaheuristics to leverage the strengths of each approach and overcome their weaknesses.
  • Stochastic Optimization: incorporating randomness and uncertainty into the optimization process, particularly in environments where data are incomplete, noisy, or uncertain.
  • Robust Optimization: developing algorithms that perform well under various conditions or scenarios, ensuring solutions are not overly sensitive to variations in input data.
  • Real-time and Online Optimization: optimize systems in real-time or on the fly by using streaming data for applications such as online advertising, production re-scheduling, emergent patient scheduling, grid network optimization, and real-time pricing in e-commerce.
  • Optimization for sustainability: growing emphasis on optimizing systems for sustainability, e.g., minimizing carbon footprints, reducing waste, or optimizing renewable energy systems.
  • Distributed Optimization: optimizing large-scale problems across multiple computers or nodes in a network driven by big data and cloud computing growth.
  • Queuing theory: the study of queuing phenomena of objects (e.g., people, objects, or packets) waiting for service to optimize the service process.
  • Graph Neural Networks: application of Graph Neural Networks (GNN) to explore innovative solutions to combinatorial optimization problems with enhanced consistency and robustness through self-attention mechanisms.
  • Contextual optimization: in-depth analysis and consideration of the specific characteristics of the decision environment to customize the optimization strategy to solve the optimization problem in dynamic environments.
  • Variational Inequalities and Numerical Approximations with Convex Optimization:  Variational inequalities provide a powerful framework for modeling and solving a wide range of problems in optimization, equilibrium, and game theory. Numerical approximations are key in solving VIs, particularly large-scale convex optimization problems.
  • Cross-disciplinary Applications: implementation of optimization techniques in novel fields and various sectors, such as biology, medicine, urban, mining, healthcare, agriculture, ecology, etc.

Prof. Dr. Shiqiang Liu
Dr. Weidong Li
Prof. Dr. Lijun Zhu
Prof. Dr. Yongman Zhao
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 250 words) can be sent to the Editorial Office for assessment.

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

  • planning and scheduling
  • supply chain management
  • construction heuristics
  • metaheuristics
  • approximation and randomized algorithms
  • mixed integer programming
  • algorithmic game theory
  • deep reinforcement learning
  • graph neural networks
  • simulation and digital twins
  • real-time and online optimization
  • explainable and interpretable optimization
  • optimization for sustainability
  • stochastic optimization
  • robust optimization
  • contextual optimization
  • distributed optimization
  • variational inequalities and numerical approximations
  • cross-disciplinary applications

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 (4 papers)

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

Research

Jump to: Review

38 pages, 9992 KB  
Article
Learning-Based Multi-Objective Optimization of Parametric Stadium-Type Tiered-Seating Configurations
by Metin Arel and Fikret Bademci
Mathematics 2026, 14(3), 410; https://doi.org/10.3390/math14030410 - 24 Jan 2026
Viewed by 532
Abstract
Parametric tiered-seating design can be framed as a constrained multi-objective optimization problem in which a low-dimensional decision vector is evaluated by a deterministic operator with sequential feasibility rejection and visibility constraints. This study introduces an oracle-preserving, learning-assisted screening workflow, where a multi-output multilayer [...] Read more.
Parametric tiered-seating design can be framed as a constrained multi-objective optimization problem in which a low-dimensional decision vector is evaluated by a deterministic operator with sequential feasibility rejection and visibility constraints. This study introduces an oracle-preserving, learning-assisted screening workflow, where a multi-output multilayer perceptron (MLP) is used only to prioritize candidates for evaluation. Here, multi-output denotes a single network trained to predict the full objective vector jointly. Candidates are sampled within bounded decision ranges and evaluated by an operator that propagates section-coupled geometric state and enforces hard clearance thresholds through a Vertical Sightline System (VSS), i.e., a deterministic row-wise sightline/clearance evaluator that enforces hard clearance thresholds. The oracle-evaluated set is reduced to its mixed-direction Pareto-efficient subset and filtered by feature-space proximity to a fixed validation reference using nearest-neighbor distances in standardized 11-dimensional features, yielding a robustness-oriented pool. A compact shortlist is derived via TOPSIS (Technique for Order Preference by Similarity to an Ideal Solution; used here strictly as a post-Pareto decision-support ranking rule), and preference uncertainty is assessed by Monte Carlo weight sampling from a symmetric Dirichlet distribution. In an archived run under a fixed oracle budget, 1235 feasible designs are evaluated, producing 934 evaluated Pareto solutions; proximity filtering retains 187 robust candidates and TOPSIS reports a traceable top-30 shortlist. Stability is supported by concentrated top-k frequencies under weight perturbations and by audits under single-feature-drop ablations and tested rounding precisions. Overall, the workflow enables reproducible multi-objective screening and reporting for feasibility-dominated seating design. Full article
Show Figures

Figure 1

20 pages, 377 KB  
Article
An Enhanced Tuna Swarm Algorithm for Link Scheduling Strategies in Wireless Sensor Networks
by Sunyan Hong, Zhe Yang, Yang Shen and Yujian Wang
Mathematics 2025, 13(24), 3905; https://doi.org/10.3390/math13243905 - 6 Dec 2025
Cited by 1 | Viewed by 421
Abstract
In resource-constrained wireless sensor networks, efficient link scheduling is a well-studied challenge. This problem is NP-hard, indicating that NP (Nondeterministic Polynomial Time) refers to problems whose solutions can be verified in polynomial time but are computationally difficult to find, and traditional methods seldom [...] Read more.
In resource-constrained wireless sensor networks, efficient link scheduling is a well-studied challenge. This problem is NP-hard, indicating that NP (Nondeterministic Polynomial Time) refers to problems whose solutions can be verified in polynomial time but are computationally difficult to find, and traditional methods seldom yield optimal solutions within practical time limits. This research introduces an innovative novel link scheduling strategy based on the Tuna Swarm Optimization (TSO-LS) algorithm to optimize the link scheduling performance of wireless sensor networks. This work enhances the tuna swarm algorithm’s search process by incorporating characteristics of the link scheduling problem, resulting in specialized algorithmic improvements for this scenario. This research presents three principal improvements to the algorithm: first, optimizing the individual update mechanism to expedite scheduling solutions; second, refining the leading individual selection strategy to elevate global scheduling quality; and third, maintaining population diversity to prevent convergence on suboptimal scheduling schemes. In the experimental section, TSO-LS is compared with the Genetic Algorithm, Particle Swarm Optimization, Enhanced Particle Swarm Optimization and Ant Colony Optimization. The results show that TSO-LS achieves a 13.3% improvement in energy efficiency and a 12.5% decrease in average latency. Under different experimental conditions, the TSO-LS strategy shortens the average latency to 10.5 ms, demonstrating outstanding overall performance. Furthermore, this strategy reduces node consumption from 0.41 mJ to 0.32 mJ, significantly extending the overall lifespan of the network. Full article
Show Figures

Figure 1

17 pages, 760 KB  
Article
Max–Min Share-Based Mechanism for Multi-Resource Fair Allocation with Bounded Number of Tasks in Cloud Computing System
by Jie Li, Haoyu Wang, Jianzhou Wang and Yue Zhang
Mathematics 2025, 13(13), 2214; https://doi.org/10.3390/math13132214 - 7 Jul 2025
Viewed by 1037
Abstract
Finding a fair and efficient multi-resource allocation is a fundamental goal in cloud computing systems. In this paper, we consider the problem of multi-resource allocation with a bounded number of tasks. We propose a lexicographic max–min maximin share (LMM-MMS) fair allocation mechanism and [...] Read more.
Finding a fair and efficient multi-resource allocation is a fundamental goal in cloud computing systems. In this paper, we consider the problem of multi-resource allocation with a bounded number of tasks. We propose a lexicographic max–min maximin share (LMM-MMS) fair allocation mechanism and design a non-trivial polynomial-time algorithm to find an LMM-MMS solution. In addition, we prove that LMM-MMS satisfies Pareto efficiency, sharing incentive, envy-freeness, and group strategy-proofness properties. The experimental results showed that LMM-MMS could produce a fair allocation with a higher resource utilization and completion ratio of user jobs than previous known fair mechanisms; LMM-MMS also performed well in resource sharing. Full article
Show Figures

Figure 1

Review

Jump to: Research

30 pages, 599 KB  
Review
A Survey of Approximation Algorithms for the Power Cover Problem
by Jiaming Zhang, Zhikang Zhang and Weidong Li
Mathematics 2025, 13(15), 2479; https://doi.org/10.3390/math13152479 - 1 Aug 2025
Viewed by 2227
Abstract
Wireless sensor networks (WSNs) have attracted significant attention due to their widespread applications in various fields such as environmental monitoring, agriculture, intelligent transportation, and healthcare. In these networks, the power cost of a sensor node is closely related to the radius of its [...] Read more.
Wireless sensor networks (WSNs) have attracted significant attention due to their widespread applications in various fields such as environmental monitoring, agriculture, intelligent transportation, and healthcare. In these networks, the power cost of a sensor node is closely related to the radius of its coverage area, following a nonlinear relationship where power increases as the coverage radius grows according to an attenuation factor. This means that increasing the coverage radius of a sensor leads to a corresponding increase in its power cost. Consequently, minimizing the total power cost of the network while all clients are served has become a crucial research topic. The power cover problem focuses on adjusting the power levels of sensors to serve all clients while minimizing the total power cost. This survey focuses on the power cover problem and its related variants in WSNs. Specifically, it introduces nonlinear integer programming formulations for the power cover problem and its related variants, all within the specified sensor setting. It also provides a comprehensive overview of the power cover problem and its variants under both specified and unspecified sensor settings, summarizes existing results and approximation algorithms, and outlines potential directions for future research. Full article
Show Figures

Figure 1

Back to TopTop