Loading...

Solving VRP by using Sliding Horizon Distributed Cooperative Control

Zajkani, Mohammad Amin | 2025

44 Viewed
  1. Type of Document: Ph.D. Dissertation
  2. Language: Farsi
  3. Document No: 58792 (05)
  4. University: Sharif University of Technology
  5. Department: Electrical Engineering
  6. Advisor(s): Haeri, Mohammad
  7. Abstract:
  8. With the significant growth of online orders in recent years, companies have been compelled to reduce shipping and distribution costs in order to increase profitability. Many such companies, owing to the presence of multiple warehouses across the city, encounter not only the classical vehicle routing problem but also its multi-depot variant, which introduces substantial logistical and computational complexities. In this research, the classical vehicle routing problem is first examined while incorporating vehicle capacity constraints. Subsequently, to address the multi-depot scenario, a solution strategy is proposed based on problem dimension reduction and the introduction of a tuning parameter to manage the trade-off between the final routing cost and computational time. Considering the inherent dynamics of real-world environments—such as real-time variations in traffic conditions, sudden fluctuations in customer demand, and other sources of uncertainty—the study addresses the dynamic multi-depot vehicle routing problem using a distributed collaborative rolling horizon approach, wherein at least one of the problem’s key variables changes over time. In the next phase, the problem is made more realistic through the inclusion of multiple product types, leading to the formulation and solution of the multi-commodity vehicle routing problem. The core idea of the research is to decompose the problem into smaller, interacting subsystems and to design each subsystem separately while accounting for their mutual influences in the routing process. The central challenge of this approach lies in modeling and incorporating the effects of interactions among subsystems so as to contribute effectively to minimizing the overall cost function. Overall, the findings demonstrate that the proposed method can substantially reduce computational time and operational costs, while maintaining high flexibility and adaptability when facing the realities of the market and the dynamic nature of modern logistics environments
  9. Keywords:
  10. Vehicle Routing Problem ; Sliding Horizon ; Multi-Depot Vehicle Routing ; Dynamic Vehicle Routing ; Classical Vehicle Routing

 Digital Object List

 Bookmark

No TOC