Territory Design for Dynamic Multi-Period Vehicle Routing Problem with Time Windows
From MaRDI portal
Publication:6356478
DOI10.1016/J.COR.2022.105866arXiv2012.10506MaRDI QIDQ6356478FDOQ6356478
Authors: Hernán Lespay, Karol Suchan 
Publication date: 18 December 2020
Abstract: This study introduces the Territory Design for Dynamic Multi-Period Vehicle Routing Problem with Time Windows (TD-DMPVRPTW), 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 dynamically 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.
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
This page was built for publication: Territory Design for Dynamic Multi-Period Vehicle Routing Problem with Time Windows
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6356478)
