Comparing Fast VRP Algorithms for Collaborative Urban Freight Transport Systems : A Solution Probleming Analysis

This paper proposes a comparison between two fast heuristic algorithms to solve a multi-carrier 2E-VRP (Two-Echelon Vehicle Routing Problem) in city logistics under realistic conditions. We propose a cluster-first route-second algorithm to compare the performance of two route construction and post-optimization algorithms on real-size test cases. The clustering phase is made by a sweep algorithm, which defines the number of used vehicles and assigns a set of customers to it. Then, for each cluster, which represents a vehicle, we build a min-cost route by the following two methods. The first is a semi-greedy algorithm. The second is a genetic algorithm that includes post-optimization at the level of each route. In this study, we make the route construction and post-optimization without any possible exchange of routes to guarantee a pertinent comparison between both the algorithms. After presenting both the approaches, we apply them, first to classical 2E-CVRP (Two-Echelon Capacitated Vehicle Routing Problem) instances to state on the algorithm capabilities, then on real-size instances to compare them. Computational results are presented and discussed. Finally, practical implications are addressed