GRASP-ASP: An algorithm for the CVRP with route balancing

An extension of the capacitated vehicle routing problem is studied in this paper. In this version the difference between the individual route lengths is minimized simultaneously with the total length. The drivers’ workload and perhaps, income, may be affected by the route lengths; so adding this objective makes the problem closer to real-life than the original, single-objective problem. A heuristic based on GRASP is used to obtain an approximation of the Pareto set. The proposed heuristic is tested on instances from the literature, obtaining good approximations of the Pareto set.