Szczegóły publikacji
Opis bibliograficzny
A case study of consistent vehicle routing problem with time windows / Hernán Lespay, Karol SUCHAN // International Transactions in Operational Research ; ISSN 0969-6016. — 2021 — vol. 28 iss. 3, s. 1135–1163. — Bibliogr. s. 1161-1163, Abstr. — K. Suchan - dod. afiliacja: Universidad Diego Portales, Chile
Autorzy (2)
- Lespay Hernán
- AGHSuchan Karol
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 132297 |
|---|---|
| Data dodania do BaDAP | 2021-06-23 |
| Tekst źródłowy | URL |
| DOI | 10.1111/itor.12885 |
| Rok publikacji | 2021 |
| Typ publikacji | artykuł w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | International Transactions in Operational Research |
Abstract
We develop a heuristic for the consistent vehicle routing problem with time windows (ConVRPTW), which is motivated by a real‐world application at a food company's distribution center. Besides standard VRPTW restrictions, ConVRPTW assigns each customer just one driver to fulfill his or her orders during the whole multiperiod planning horizon. For each driver and period, a route is sought to serve all their customers with positive demand. For each customer, the number of periods between consecutive orders and the ordered quantities is highly irregular. This causes difficulties in the daily routing, negatively impacting the service level of the company. Similar problems have been studied as ConVRP, where the number of drivers is fixed a priori, and only the total travel time is minimized. Moreover, the clients present no time window constraints, but the visits should be scheduled with a small arrival time variation. In our model, the objective is to minimize the number of drivers. We impose hard time windows but do not consider time consistency in more detail. We compare solutions given by the heuristic with solutions of a mixed‐integer linear programming model on a set of small artificial instances and solutions used by the food company on real‐world instances. The results show the effectiveness of the heuristic. For the company, we obtain significant improvements in the routing plans, with a lower number of vehicles and a higher rate of orders delivered within the prescribed time window.
