Paper
Using Insertion Heuristic to Solve Dynamic Multi-Depot Vehicle Routing Problem
- Authors:
- Chi-Chang Wang; Yiyo Kuo
- Abstract
- For any dynamic vehicle routing problem, if new routes are planned in response to a new dynamic request, and the new routes are very different from the original ones, the whole process becomes more complicated. In order to reduce the changes in the routes, this research proposes an insertion heuristic for solving a dynamic multi-depot vehicle routing problem where pick-up and delivery requests are both considered. The insertion heuristic can also take the current positions of vehicles into account. Five instances provided by a specialist webpage were tested to analyze the difference between solutions that do or do not consider the current positions of vehicles. The results show that considering the vehicles’ current positions reduces the completion time by 11.79%, but increases the number of rejected requests by 10.23% on average.
- Keywords
- Dynamic Vehicle Routing; Multi-depot; Pick-up and Delivery
- StartPage
- 43
- EndPage
- 51
- Doi