Mathematical model for the vehicle routing problem with pick-up and delivery of packages using electronic Lockers

Abstract

The present work proposes a mathematical model that generates routes for the pick-up and delivery of packages within a network of electronic Lockers that operate with each other, determining the sequence of locker visits that guarantees the attention of the requested packages and that, in turn, minimize the distance traveled, associated with the distribution of said packages. For this objective, a variant of the mathematical model of the vehicle routing problem with simultaneous collection and delivery (VRPSPD) has been proposed and used to solve the study case of the Kandoo company from Guayaquil, Ecuador, analyzing the results obtained, and pointing towards future lines of research in this field.