Please use this identifier to cite or link to this item:
|Title:||Consistent vehicle routing problem with service level agreements: A case study in the pharmaceutical distribution sector|
Fábio Silva Moreira
|Abstract:||In this paper, a mathematical model is developed to tackle a Consistent Vehicle Routing Problem, which considers customers with multiple daily deliveries and different service level agreements such as time windows, and release dates. In order to solve this problem, an instance size reduction algorithm and a mathematical programming based decomposition approach are developed. This solution approach is benchmarked against a commercial solver. Results indicate that the method solves instances of large size, enabling its application to real-life scenarios. A case study in a pharmaceutical distribution company is analyzed. Consistent routes are planned for several warehouses, comprising hundreds of orders. A simulation model evaluates the performance of the generated route plans. Significant improvements in terms of the total distance traveled and the total travel times are obtained when compared to the company's current planning process. © 2018 Elsevier B.V.|
|Appears in Collections:||CEGI - Articles in International Journals|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.