A model for the multi-depot online vehicle routing problem with soft deadlines

Abstract

In many companies in the automotive industry there are challenges in some key processes in their logistic departments, mainly in internal logistics. These challenges happen due to poorly defined rules for the transportation of goods, resulting in a great cost associated with the time lost in the process. Also, the optimization of these processes, incrementing the efficiency of internal logistics can bring competitive advantages to the companies. For that matter, this study was developed at a major tire manufacturing company and proposes a model for the optimization of in-bound logistics, viewed as an online vehicle routing problem with soft deadlines (OVRPSD), using multiple depots. The main goal of this study is the increase of efficiency in logistic, optimizing the number of vehicles to supply the machines in order to reduce the stopping time of machines due to the lack of tires to consume.