Search for Articles:
Title / Keyword
Author / Affiliation / Email
Journal
Article Type
 
 
Advanced Search
 
Section
Special Issue
Volume
Issue
Number
Page
 
4.6
2.2
Journals
Mathematics
Special Issues
Advances in Operations Research for Logistic and Operations Management of...
share announcement

Advances in Operations Research for Logistic and Operations Management of Supply Chain Management

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "D2: Operations Research and Fuzzy Decision Making".

Deadline for manuscript submissions: 30 November 2026 | Viewed by 6288

Special Issue Editor

Prof. Dr. John Willmer Escobar

E-Mail Website
Guest Editor
School of Industrial Engineering, Faculty of Engineering, Universidad del Valle, Cali 760001, Colombia
Interests: vehicle routing problem; logistics; supply chain optimization; financial sustainability
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

A supply chain considers different echelons, ranging from suppliers of raw materials, carriers, depots, small suppliers, manufacturers or producers, distribution centers, intermediaries, and end customers—all of which include advanced operations research techniques for solving different strategic, tactical, and operational aspects of the supply chain. These optimization techniques include exact, heuristic, and metaheuristic approaches that consider linear and non-linear supply chain problems. These tools seek to establish viable supply chains, including sustainable aspects, resilience robustness, and agility issues, by considering modern technology aspects based on big data. Viability is the supply chain's ability to survive disruptions due to multiple factors, including environmental, social, and economic aspects. Different works with the triple-bottom line aligned with economic, social, and environmental issues, such as those mentioned in the Sustainable Development Goals (SDG), considering the sustainable aspects of the supply chain. Resilience and robustness are faced with the property of chain recovery due to failures related to disruptions. Finally, agility is the supply chain characteristic that includes technological issues for the recovery of the entire network. All of these aspects for different levels are solved under the framework of the present Special Issue.  

This Special Issue aims to collate original research papers that offer the latest and different advanced operations research techniques aimed toward the development and application of different levels of supply chain management and logistics in a broad range of fields.

Prof. Dr. John Willmer Escobar
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 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

  • heuristic and metaheuristic approaches for supply chain management and logistics
  • possibilistic approaches for supply chain management and logistics
  • viability of supply chain management
  • supply chain optimization and logistics management
  • robust approaches for supply chain management
  • resilient supply chain optimization
  • sustainable supply chains
  • green supply chains
  • agility supply chains in supply chain management
  • operations management in supply chains
  • sustainable vehicle routing problems
  • social aspects for vehicle routing problems
  • economic aspects of vehicle routing problems
  • resilient, robust, and stochastic vehicle routing problems

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)

Download All Papers
Order results
Result details
Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:

Research

31 pages, 1953 KB  
Article
Pre-Sale Strategies Considering Consumer Anticipated Regret
by Wei Yao, Yudong Li and Yan Chen
Mathematics 2026, 14(4), 692; https://doi.org/10.3390/math14040692 - 15 Feb 2026
Viewed by 498
Abstract
Pre-sale mechanisms are widely used by e-tailers to manage demand uncertainty and stimulate early purchases, yet existing research has largely emphasized economic incentives while giving limited attention to consumers’ psychological responses to early commitment. This study examines how anticipated regret shapes the relative [...] Read more.
Pre-sale mechanisms are widely used by e-tailers to manage demand uncertainty and stimulate early purchases, yet existing research has largely emphasized economic incentives while giving limited attention to consumers’ psychological responses to early commitment. This study examines how anticipated regret shapes the relative performance of two prevalent pre-sale strategies—advance discounts and deposit expansion—across different market structures. We develop game-theoretic models of monopolistic and duopolistic markets in which consumers anticipate post-purchase regret and incorporate this behavioral concern into their pre-sale decisions. Our analysis shows that deposit expansion consistently attracts higher demand than advance discounts by offering post-decision flexibility, and this demand advantage increases with consumers’ regret sensitivity. However, the profitability implications are non-monotonic. While deposit expansion dominates advance discounts when anticipated regret is low to moderate, advance discounts become more profitable once regret is sufficiently strong. Competition further moderates these effects by amplifying demand differences while compressing profit margins, without altering the regret threshold at which profit dominance reverses. Full article
(This article belongs to the Special Issue Advances in Operations Research for Logistic and Operations Management of Supply Chain Management)
►▼ Show Figures

Figure 1

33 pages, 2723 KB  
Article
Dynamic Generation of Cutting Patterns in Sawmills for Sustainable Planning
by Jorge Félix Mena-Reyes, Raúl Soto-Concha, Gustavo Gatica and Rodrigo Linfati
Mathematics 2026, 14(1), 10; https://doi.org/10.3390/math14010010 - 20 Dec 2025
Viewed by 629
Abstract
This study proposes two optimization models and a column-generation algorithm, applied at the root node, to support tactical planning in sawmills by dynamically generating log cutting patterns aligned with sustainability and efficiency objectives. Starting from an industrial dataset containing 160 cutting patterns, the [...] Read more.
This study proposes two optimization models and a column-generation algorithm, applied at the root node, to support tactical planning in sawmills by dynamically generating log cutting patterns aligned with sustainability and efficiency objectives. Starting from an industrial dataset containing 160 cutting patterns, the methodology iteratively incorporates new geometrically feasible configurations guided by the dual prices of a primary model, explicitly considering log supply, product demand, and alternative tactical criteria. Three computational experiments were conducted. The first assesses the convergence behavior of the algorithm and shows reductions in total log consumption of up to 31% as new patterns are generated. The second demonstrates that strategies aimed at minimizing log usage and residues can achieve near-optimal solutions with only 20–25 patterns, since additional configurations provide marginal improvements while increasing setup time and operational complexity. The third experiment confirms that near-optimal performance can be reached with a moderate number of active patterns, facilitating practical implementation in industrial settings. Overall, the proposed methodology offers a flexible and sustainability-oriented decision-support tool for sawmill tactical planning, improving raw-material utilization, reducing residues, and enhancing alignment between supply and demand while maintaining operational feasibility. Full article
(This article belongs to the Special Issue Advances in Operations Research for Logistic and Operations Management of Supply Chain Management)
►▼ Show Figures

Figure 1

29 pages, 870 KB  
Article
Deep Reinforcement Learning for Optimal Replenishment in Stochastic Assembly Systems
by Lativa Sid Ahmed Abdellahi, Zeinebou Zoubeir, Yahya Mohamed, Ahmedou Haouba and Sidi Hmetty
Mathematics 2025, 13(14), 2229; https://doi.org/10.3390/math13142229 - 9 Jul 2025
Cited by 2 | Viewed by 3065
Abstract
This study presents a reinforcement learning–based approach to optimize replenishment policies in the presence of uncertainty, with the objective of minimizing total costs, including inventory holding, shortage, and ordering costs. The focus is on single-level assembly systems, where both component delivery lead times [...] Read more.
This study presents a reinforcement learning–based approach to optimize replenishment policies in the presence of uncertainty, with the objective of minimizing total costs, including inventory holding, shortage, and ordering costs. The focus is on single-level assembly systems, where both component delivery lead times and finished product demand are subject to randomness. The problem is formulated as a Markov decision process (MDP), in which an agent determines optimal order quantities for each component by accounting for stochastic lead times and demand variability. The Deep Q-Network (DQN) algorithm is adapted and employed to learn optimal replenishment policies over a fixed planning horizon. To enhance learning performance, we develop a tailored simulation environment that captures multi-component interactions, random lead times, and variable demand, along with a modular and realistic cost structure. The environment enables dynamic state transitions, lead time sampling, and flexible order reception modeling, providing a high-fidelity training ground for the agent. To further improve convergence and policy quality, we incorporate local search mechanisms and multiple action space discretizations per component. Simulation results show that the proposed method converges to stable ordering policies after approximately 100 episodes. The agent achieves an average service level of 96.93%, and stockout events are reduced by over 100% relative to early training phases. The system maintains component inventories within operationally feasible ranges, and cost components—holding, shortage, and ordering—are consistently minimized across 500 training episodes. These findings highlight the potential of deep reinforcement learning as a data-driven and adaptive approach to inventory management in complex and uncertain supply chains. Full article
(This article belongs to the Special Issue Advances in Operations Research for Logistic and Operations Management of Supply Chain Management)
►▼ Show Figures

Figure 1

31 pages, 6941 KB  
Article
A Heuristic Approach for Last-Mile Delivery with Consistent Considerations and Minimum Service for a Supply Chain
by Esteban Santana Contreras, John Willmer Escobar and Rodrigo Linfati
Mathematics 2025, 13(10), 1553; https://doi.org/10.3390/math13101553 - 8 May 2025
Cited by 1 | Viewed by 1221
Abstract
This paper considers the problem of consistent routing with minimum service (ConVRPms). ConVRPms aims to determine the minimum cost routes for each day of a planning horizon. In particular, the goal is to satisfy all individual demands and serve every customer via a [...] Read more.
This paper considers the problem of consistent routing with minimum service (ConVRPms). ConVRPms aims to determine the minimum cost routes for each day of a planning horizon. In particular, the goal is to satisfy all individual demands and serve every customer via a single driver, with times that do not differ by more than L time units. There is a fleet of homogeneous vehicles that start from a single depot. In this paper, a heuristic algorithm for ConVRPms is proposed. The algorithm is based on classical constructive heuristics and the tabu search metaheuristic. The proposed algorithm has been tested on benchmark instances from the literature. The experimental results show that the proposed approach produces high-quality solutions within computing times considerably less than those observed with CPLEX. The proposed algorithm can optimally solve instances with 20 customers and a planning horizon of three days, producing more economical solutions in some of the larger instances and those requiring hourly consistency (L=1 h). Full article
(This article belongs to the Special Issue Advances in Operations Research for Logistic and Operations Management of Supply Chain Management)
►▼ Show Figures

Figure 1

Show export options expand_more Show export options expand_less
Select all
Export citation of selected articles as:
 
Displaying articles 1-4
Back to TopTop