Vehicle routing problem. Literature review and case study using the parallel Clarke and Wright savings algorithm

The Vehicle Routing Problem (VRP) constitutes a fundamental operational challenge in supply chain management and logistics, directly impacting efficiency and cost-effectiveness. This study investigates algorithmic approaches to VRP through a comprehensive literature review, with particular emphasis on heuristic and metaheuristic strategies, notably the Clarke and Wright Savings Algorithm. A Parallel Clarke and Wright Savings Algorithm is implemented in the context of an agricultural cooperative responsible for collecting fruit from its multiple suppliers. The objective is to minimize transportation costs while ensuring compliance with all supplier requirements. The analytical methodology encompasses the construction of a distance matrix, computation of savings, and comparative evaluation of results, thereby providing insights into the practical applicability and performance of the proposed approach.