An iterative vertex coloring algorithm for vehicle routing problems with soft time windows for reverse logistics

摘要

This paper describes the development of an iterative heuristic algorithm utilizing graph coloring theory and cost minimization strategy to solve the vehicle routing problem with soft time windows (VRPSTWs) for a reverse logistic. The purpose of the proposed algorithm is to improve the computational efficiency and find the routing combinations graphically by applying the vertex coloring technique. Linkage among vertices was performed iteratively, taking the model's constraints into consideration. A Taiwanese waste collection network was utilized to demonstrate the implementation of the algorithm. Computational results revealed that the algorithm was efficient and effective.