An optimization algorithm for solving the rich vehicle routing problem based on Variable Neighborhood Search and Tabu Search metaheuristics

Abstract

This paper presents a novel optimization algorithm that consists of metaheuristic processes to solve the problem of the capillary distribution of goods in major urban areas taking into consideration the features encountered in real life: time windows, capacity constraints, compatibility between orders and vehicles, maximum number of orders per vehicle, orders that depend on the pickup and delivery and not returning to the depot. With the intention of reducing the wide variety of constraints and complexities, known as the Rich Vehicle Routing Problem, this algorithm proposes feasible alternatives in order to achieve the main objective of this research work: the reduction of costs by minimizing distances and reducing the number of vehicles used as long as the service quality to customers is optimum and a load balance among vehicles is maintained.