Variants of VRP to Optimize Logistics Management Problems

Variants of VRP to Optimize Logistics Management Problems

Claudia Gómez Santillán (Instituto Tecnológico de Ciudad Madero, México), Laura Cruz Reyes (Instituto Tecnológico de Ciudad Madero, México), María Lucila Morales Rodríguez (Instituto Tecnológico de Ciudad Madero, México), Juan Javier González Barbosa (Instituto Tecnológico de Ciudad Madero, México), Oscar Castillo López (Instituto Tecnológico de Tijuana, México), Gilberto Rivera Zarate (Instituto Tecnológico de Ciudad Madero, México) and Paula Hernández (Instituto Tecnólogico de Ciudad Madero, México)
DOI: 10.4018/978-1-4666-0297-7.ch008


The Vehicle Routing Problem (VRP) is a key to the efficient transportation management and supply-chain coordination. VRP research has often been too focused on idealized models with non-realistic assumptions for practical applications. Nowadays the evolution of methodologies allows that the classical problems could be used to solve VRP problems of real life. The evolution of methodologies allows the creation of variants of the VRP which were considered too difficult to handle by their variety of possible restrictions. A VRP problem that includes the addition of restrictions, which represent the variants in the problem, is called Rich VRP. This work presents an algorithm to optimize the transportation management. The authors are including a case of study which solves a real routing problem applied to the distribution of bottled products. The proposed algorithm shows a saving in quantity of vehicles and reduces the operation costs of the company.
Chapter Preview


The section begins with the origin and description of VRP, we continue with a summary of the variants involved in this work, and with the formal definitions of the BPP and RoSLoP. To finish, we describe the basic elements that compose the ACS algorithm that will be used for the solution of the RoSLoP.

Complete Chapter List

Search this Book: