Szczegóły publikacji

Opis bibliograficzny

Territory design for the multi-period vehicle routing problem with time windows / Hernán Lespay, Karol SUCHAN // Computers & Operations Research ; ISSN 0305-0548. — 2022 — vol. 145 art. no. 105866, s. 1–13. — Bibliogr. s. 13, Abstr. — Publikacja dostępna online od: 2022-05-07. — K. Suchan - pierwsza afiliacja: Universidad Diego Portales, Santiago, Chile

Autorzy (2)

Słowa kluczowe

last-mile logisticsterritory designmulti-period routingdistribution logisticsvehicle routingheuristics

Dane bibliometryczne

ID BaDAP140605
Data dodania do BaDAP2023-10-18
Tekst źródłowyURL
DOI10.1016/j.cor.2022.105866
Rok publikacji2022
Typ publikacjiartykuł w czasopiśmie
Otwarty dostęptak
Czasopismo/seriaComputers & Operations Research

Abstract

This study introduces the Territory Design for the Multi-Period Vehicle Routing Problem with Time Windows (TD-MPVRPTW) problem, motivated by a real-world application at a food company's distribution center. This problem deals with the design of contiguous and compact territories for delivery of orders from a depot to a set of customers, with time windows, over a multi-period planning horizon. Customers and their demands vary over time. The problem is modeled as a mixed-integer linear program (MILP) and solved by a proposed heuristic. The heuristic solutions are compared with the proposed MILP solutions on a set of small artificial instances and the food company's solutions on a set of real-world instances. Computational results show that the proposed algorithm can yield high-quality solutions within moderate running times. A methodology is proposed in which the territories computed by the proposed heuristic on the past demand of one month are used for the operational routing during the following month, in which the demand is known only one day in advance. An evaluation shows that the territories obtained with our methodology would have led to levels of service significantly better than the ones that were experienced by the company, using a significantly lower number of vehicles to execute the deliveries.

Publikacje, które mogą Cię zainteresować

artykuł
#132297Data dodania: 23.6.2021
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
artykuł
#53072Data dodania: 1.9.2010
Sequential simulated annealing for the Vehicle Routing Problem with Time Windows / Marcin WOCH, Piotr ŁEBKOWSKI // Decision Making in Manufacturing and Services ; ISSN 1896-8325. — 2009 — vol. 3 no. 1–2, s. 87–100. — Bibliogr. s.  98–100, Abstr.