Load-dependent vehicle routing problem with route time constraint: a heuristic approach
This article explores a vehicle routing problem originating from the delivery operations of an e-commerce retailer in Thailand. The problem requires consideration of load-dependent distance objective and route time restriction. A mathematical model is formulated for the problem to minimize the total...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2025-12-01
|
| Series: | Cogent Engineering |
| Subjects: | |
| Online Access: | https://www.tandfonline.com/doi/10.1080/23311916.2025.2533415 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849251816672329728 |
|---|---|
| author | Nguyen Thuy Trang Parthana Parthanadee Jirachai Buddhakulsomsiri Pham Duc Tai |
| author_facet | Nguyen Thuy Trang Parthana Parthanadee Jirachai Buddhakulsomsiri Pham Duc Tai |
| author_sort | Nguyen Thuy Trang |
| collection | DOAJ |
| description | This article explores a vehicle routing problem originating from the delivery operations of an e-commerce retailer in Thailand. The problem requires consideration of load-dependent distance objective and route time restriction. A mathematical model is formulated for the problem to minimize the total load-dependent distance subject to the time limit of a route. To take the last leg of a delivery route, where a vehicle returns empty, into consideration, a base load is placed on the vehicle. In addition, a heuristic algorithm is developed to solve large problem instances, with which the mathematical cannot be solved. The heuristic features a customized saving algorithm for route construction in combination with a series of route improvement mechanisms. The performance of the proposed mathematical model and the heuristic algorithm is evaluated by using adapted problem instances, where different combinations of capacity, route time limitations, and base loads are included. The results show that for instances with known optimal solutions, the heuristic algorithm can reach solutions with small gaps to the optimal. For those with only lower bounds, the heuristic algorithm can produce solutions close to these bounds. Moreover, the results reveal that choosing an appropriate base load improves the performance of the heuristic. |
| format | Article |
| id | doaj-art-e69885edeb3b4e3e95d21be966da59f7 |
| institution | Kabale University |
| issn | 2331-1916 |
| language | English |
| publishDate | 2025-12-01 |
| publisher | Taylor & Francis Group |
| record_format | Article |
| series | Cogent Engineering |
| spelling | doaj-art-e69885edeb3b4e3e95d21be966da59f72025-08-20T03:56:49ZengTaylor & Francis GroupCogent Engineering2331-19162025-12-0112110.1080/23311916.2025.2533415Load-dependent vehicle routing problem with route time constraint: a heuristic approachNguyen Thuy Trang0Parthana Parthanadee1Jirachai Buddhakulsomsiri2Pham Duc Tai3School of Manufacturing Systems and Mechanical Engineering, Sirindhorn International Institute of Technology, Thammasat University, Khlong Luang, ThailandDepartment of Agro-Industrial Technology, Faculty of Agro-Industry, Kasetsart University, Bangkok, ThailandSchool of Manufacturing Systems and Mechanical Engineering, Sirindhorn International Institute of Technology, Thammasat University, Khlong Luang, ThailandSchool of Manufacturing Systems and Mechanical Engineering, Sirindhorn International Institute of Technology, Thammasat University, Khlong Luang, ThailandThis article explores a vehicle routing problem originating from the delivery operations of an e-commerce retailer in Thailand. The problem requires consideration of load-dependent distance objective and route time restriction. A mathematical model is formulated for the problem to minimize the total load-dependent distance subject to the time limit of a route. To take the last leg of a delivery route, where a vehicle returns empty, into consideration, a base load is placed on the vehicle. In addition, a heuristic algorithm is developed to solve large problem instances, with which the mathematical cannot be solved. The heuristic features a customized saving algorithm for route construction in combination with a series of route improvement mechanisms. The performance of the proposed mathematical model and the heuristic algorithm is evaluated by using adapted problem instances, where different combinations of capacity, route time limitations, and base loads are included. The results show that for instances with known optimal solutions, the heuristic algorithm can reach solutions with small gaps to the optimal. For those with only lower bounds, the heuristic algorithm can produce solutions close to these bounds. Moreover, the results reveal that choosing an appropriate base load improves the performance of the heuristic.https://www.tandfonline.com/doi/10.1080/23311916.2025.2533415Vehicle routing problemload-dependent distanceroute time limitmixed-integer linear programingheuristic approachTransport & Vehicle Engineering |
| spellingShingle | Nguyen Thuy Trang Parthana Parthanadee Jirachai Buddhakulsomsiri Pham Duc Tai Load-dependent vehicle routing problem with route time constraint: a heuristic approach Cogent Engineering Vehicle routing problem load-dependent distance route time limit mixed-integer linear programing heuristic approach Transport & Vehicle Engineering |
| title | Load-dependent vehicle routing problem with route time constraint: a heuristic approach |
| title_full | Load-dependent vehicle routing problem with route time constraint: a heuristic approach |
| title_fullStr | Load-dependent vehicle routing problem with route time constraint: a heuristic approach |
| title_full_unstemmed | Load-dependent vehicle routing problem with route time constraint: a heuristic approach |
| title_short | Load-dependent vehicle routing problem with route time constraint: a heuristic approach |
| title_sort | load dependent vehicle routing problem with route time constraint a heuristic approach |
| topic | Vehicle routing problem load-dependent distance route time limit mixed-integer linear programing heuristic approach Transport & Vehicle Engineering |
| url | https://www.tandfonline.com/doi/10.1080/23311916.2025.2533415 |
| work_keys_str_mv | AT nguyenthuytrang loaddependentvehicleroutingproblemwithroutetimeconstraintaheuristicapproach AT parthanaparthanadee loaddependentvehicleroutingproblemwithroutetimeconstraintaheuristicapproach AT jirachaibuddhakulsomsiri loaddependentvehicleroutingproblemwithroutetimeconstraintaheuristicapproach AT phamductai loaddependentvehicleroutingproblemwithroutetimeconstraintaheuristicapproach |