PulseExploreJournal ClubDebatesTrendingResearchersJournals
Instagram
HomeExploreJournal ClubTrending
Synapse
⌘+K
Synapse
March 21, 2026Mathematics0 citationsOpen Access

A Stochastic Model Predictive Control Strategy for Vehicle Routing with Correlated Stochastic Service Times

View Full Paper
GHGuosong HeSouthwest Petroleum UniversityQLQ. Y. LiMacau University of Science and TechnologyXLXi LiDalian Ocean University

Key Points

  • The aim is to enhance vehicle routing efficiency by managing uncertainty in travel and service times using a stochastic model predictive control approach.
  • Developed a stochastic model predictive control strategy for the vehicle routing problem with time windows.
  • Integrated dynamic optimization with chance constraints to effectively manage service time variability.
  • Utilized mixed-integer programming to solve deterministic reformulations of the stochastic constraints.
  • Implemented a forecasting tool to adjust routes based on new information.
  • Achieved high probability of meeting customer time windows even under uncertainty.
  • Incured only modest increases in total costs while maintaining reliability levels.
  • Demonstrated flexibility in managing cost-risk tradeoff by adjusting between single and joint chance constraints.

Abstract

Uncertainty in travel and service times poses significant challenges for vehicle routing in logistics systems. This paper proposes a stochastic model predictive control (SMPC) strategy to manage a Vehicle Routing Problem with time windows (VRPTW) under stochastic service times with correlation across customers. The approach combines a dynamic optimization model with single and joint chance constraints and a forecasting tool for updating travel plans as new information becomes available. A deterministic reformulation of the stochastic constraints is developed so that the problem can be solved via mixed-integer programming. The aim of this paper is to demonstrate that the SMPC strategy can maintain a high level of time-window reliability (meeting customer time windows with high probability) at a reasonable cost by re-optimizing routes over a moving horizon. In numerical case studies, the SMPC approach achieves the desired reliability levels while incurring only modest increases in total cost, and it flexibly adjusts the cost–risk tradeoff by switching between single and joint chance constraints. These results illustrate the potential of the proposed method for real-time distribution routing under uncertainty and highlight the novel contribution of integrating chance-constrained optimization with Model Predictive Control in a VRPTW context.

Ask AI
Helpful
Bookmark
Share
View Full Paper

Cite This Study

He et al. (2026) studied this question.

synapsesocial.com/papers/69be37dd6e48c4981c677dbchttps://doi.org/10.3390/math14061032
Ask AI
Helpful
Bookmark
Share
View Full Paper

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

  1. 1On the stochastic vehicle routing problem with time windows, correlated travel times, and time dependency2021 · 6 citations
  2. 2Chance-Constrained Programming1959 · 2,746 citations
  3. 3The vehicle routing problem: An overview of exact and approximate algorithms1992 · 1,743 citations
  4. 4Stochastic Vehicle Routing Problem with Uncertain Demand and Travel Time and Simultaneous Pickups and Deliveries2010 · 17 citations
  5. 5A Vehicle Routing Problem with Stochastic Demand1992 · 402 citations