A Hybrid Algorithm for Solving the General Vehicle Routing Problem in the Case of the Urban Freight Distribution

This chapter presents a hybrid algorithm based on metaheuristic methods (Variable Neighbourhood Search and Tabu Search) and local improvements to solve the problem of the distribution of goods in large urban areas taking into account the characteristics encountered in real life. The logistics of the short distance transport of goods has an essentially urban dimension so that distribution requires efficient algorithms and the process between warehouses and customers must be effective and clean. Therefore, it is necessary to efficiently optimize urban logistics and improve connections between urban and interurban freight transport in order to ensure effective distribution. Due to the great variety of constraints and complexities of the problem, known as the General Vehicle Routing Problem, the algorithm proposes feasible solutions in order to achieve the main objective of reducing costs based on minimizing distances and reducing the number of vehicles used as long as the service quality to customers is optimum and a load balance between vehicles is maintained. This article arises from a research project carried out for a large Spanish distribution company aiming to optimally manage its resources in urban areas by reducing as much as possible costs caused by inefficiency and ineffectiveness.