|
Vehicle routing with load dependent objective: a case study in supermarket fulfillment |
|---|---|
| รหัสดีโอไอ | |
| Title | Vehicle routing with load dependent objective: a case study in supermarket fulfillment |
| Creator | Jirapat Povorasin |
| Contributor | Pham Duc Tai, Advisor |
| Publisher | Thammasat University |
| Publication Year | 2568 |
| Keyword | Vehicle routing problem (VRP), Mixed integer linear programming (MILP), Route optimization, Load-dependent routing |
| Abstract | In supermarket delivery operations, routing decisions are not only influenced by distance but also by the weight of the load carried, which directly impacts transportation costs. This study develops a Mixed Integer Linear Programming (MILP) model to address the Load-Dependent Vehicle Routing Problem (LD-VRP). Unlike conventional VRP models, the proposed formulation incorporates the effect of vehicle load on travel distances and costs, offering a more realistic representation of logistics operations. The model was tested on delivery scenarios involving supermarket customers, where it successfully handled instances of up to X customers with a computational time of about Y minutes/seconds. Results show that accounting for load improves route optimization, leading to more accurate cost estimation and better resource utilization. The findings suggest that the model can be applied to real-world supermarket fulfillment systems to support efficient and sustainable logistics planning. |
