02. Logistics and Supply Chain Management
The Vehicle Routing Problem (VRP) is a classic well-known combinatorial problem. This paper introduces a factor in the VRP mathematical optimization model considering restrictions that address probability of cargo theft in the regions visited, beyond the traditional constraints such as the number of vehicles, time windows, the capacity of the vehicle and the vehicle's cycle time. The paper proposes a mixed integer linear model that minimizes total transportation costs and cargo theft costs. The model is tested in a real-life case study, a company that distributes pharmaceutical products in Rio de Janeiro. The route solutions with and without cargo theft risk are compared. The model is solved using the AIMMS software.
PALAVRAS-CHAVE: logistics, vehicle routing problem, cargo theft, mixed integer linear programming, aimms.