Optimization Algorithms for Operations Research and Scheduling Problems

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

Deadline for manuscript submissions: 31 October 2025 | Viewed by 653

Special Issue Editors


E-Mail Website
Guest Editor
Department of Data and Systems Engineering, Hong Kong University, Hong Kong
Interests: production planning; inventory; logistics; scheduling; inventory management; text mining; operations management; support vector machine; forecasting; econometrics
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Business School, Sichuan University, Chengdu 610065, China
Interests: business intelligence; big data mining; decision support systems; energy forecasting; financial management
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
School of Economics and Management, Xidian University, Xi’an 710162, China
Interests: energy finance; energy economics and policy analysis; macroeconomic model; investment and financing decision and risk management; Bayesian statistics
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Department of Industrial Engineering, Faculty of Engineering, Khon Kaen University, Khon Kaen 40002, Thailand
Interests: optimization; logistics; simulation; heuristics; modeling; scheduling; combinatorial optimization; discrete event simulation; discrete optimization; optimization modeling
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

The increasing complexity of operations research and scheduling problems in various industries requires advanced optimization algorithms to enhance efficiency, reduce costs, and improve decision-making. This Special Issue aims to explore the latest advancements in optimization algorithms applied to operations research and scheduling, focusing on transportation, logistics, supply chain management, manufacturing, healthcare, and energy systems, amongst possible others.

We welcome high-quality original research and review articles that contribute to the theoretical and practical aspects of optimization algorithms for operations research and scheduling problems. Topics of interest include, but are not limited to, the following:

  • Novel mathematical programming models for scheduling and resource allocation;
  • Combinatorial optimization techniques for production planning and logistics;
  • Metaheuristic and hybrid optimization approaches in large-scale scheduling problems;
  • Stochastic and robust optimization in uncertain environments;
  • Artificial intelligence and machine learning applications in scheduling;
  • Multi-objective and multi-criteria decision-making models;
  • Advances in vehicle routing, workforce scheduling, and project management;
  • Sustainable and green logistics optimization;
  • Real-world case studies and industrial applications of optimization algorithms.

We encourage submissions that introduce innovative methodologies, theoretical advancements, and real-world applications. We look forward to receiving your contributions to this Special Issue.

Prof. Dr. Kin Keung Lai
Prof. Dr. Lean Yu
Prof. Dr. Jian Chai
Prof. Dr. Kanchana Sethanan
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

  • mathematical programming
  • combinatorial optimization
  • metaheuristic algorithms
  • multi-objective decision making
  • stochastic and robust optimization
  • AI and machine learning in optimization
  • supply chain and logistics scheduling
  • vehicle routing and workforce scheduling
  • sustainable and green logistics
  • project and resource management

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

19 pages, 1159 KiB  
Article
A Biased–Randomized Iterated Local Search with Round-Robin for the Periodic Vehicle Routing Problem
by Juan F. Gomez, Antonio R. Uguina, Javier Panadero and Angel A. Juan
Mathematics 2025, 13(15), 2488; https://doi.org/10.3390/math13152488 - 2 Aug 2025
Viewed by 284
Abstract
The periodic vehicle routing problem (PVRP) is a well-known challenge in real-life logistics, requiring the planning of vehicle routes over multiple days while enforcing visitation frequency constraints. Although numerous metaheuristic and exact methods have tackled various PVRP extensions, real-world settings call for additional [...] Read more.
The periodic vehicle routing problem (PVRP) is a well-known challenge in real-life logistics, requiring the planning of vehicle routes over multiple days while enforcing visitation frequency constraints. Although numerous metaheuristic and exact methods have tackled various PVRP extensions, real-world settings call for additional features such as depot configurations, tight visitation frequency constraints, and heterogeneous fleets. In this paper, we present a two-phase biased–randomized algorithm that addresses these complexities. In the first phase, a round-robin assignment quickly generates feasible and promising solutions, ensuring each customer’s frequency requirement is met across the multi-day horizon. The second phase refines these assignments via an iterative search procedure, improving route efficiency and reducing total operational costs. Extensive experimentation on standard PVRP benchmarks shows that our approach is able to generate solutions of comparable quality to established state-of-the-art algorithms in relatively low computational times and stands out in many instances, making it a practical choice for real life multi-day vehicle routing applications. Full article
Show Figures

Figure 1

Back to TopTop