Implementation of a new matheuristic to solve the vehicle routing problem with simultaneous deliveries and pick-ups -VRPSPD

The objective of this articleis to present a new methodology for the solution of the homogeneous vehicle routing problem with simultaneous pickups and deliveries (VRPSPD) incorporating a matheuristic integrated by the Chu-Beasley genetic algorithm and mixed integer linear programming, based on the Branch-and-Bound procedure, applied to the best configuration obtained from the genetic algorithm with the support of constructive heuristic methods in the determination of the sub problems, which make part of the generation of the initial population, necessary in the stage of local improvement. The problem is that, from a group of geographically dispersed customers, with known pick-up and delivery demands, minimum cost routes must be established that guarantee the satisfaction of customer demand, considering the restrictions of the system and the number of vehicles required to provide the service.The methodology developed is implemented in C++, and a solver CPLEX software is used to find the solution. It is demonstrated in this article that the efficiency of the application of this new hybrid model is evidenced using test instances disclosed in the specialized literature, achieving good results in very short computation times.This article is one of the scientific products derived from my doctoral thesis in Engineering and from the presentation of similar topics in international congresses, therefore, for obvious reasons there is a certain similarity in the bibliographical references consulted. El objetivo de este artículo es presentar una nueva metodología para la solución del problema de ruteo homogéneo de vehículos con recogidas y entregas simultáneas (VRPSPD) incorporando una matheurística integrada por el algoritmo genético de Chu-Beasley y programación lineal entera mixta, basada en el método Branch-Procedimiento and-Bound, aplicado a la mejor configuración obtenida del algoritmo genético con apoyo de métodos heurísticos constructivos en la determinación de los sub problemas, que hacen parte de la generación de la población inicial, necesaria en la etapa de mejoramiento local. El problema es que, a partir de un grupo de clientes dispersos geográficamente, con demandas conocidas de retiro y entrega, se deben establecer rutas de costo mínimo que garanticen lasatisfacción de la demanda de los clientes, considerando las restricciones del sistema y la cantidad de vehículos requeridos para atender. el servicio. La metodología desarrollada está implementada en C++