06064094

j

06064094 Jeng, Wei-Min Yu, Min-Chun Liao, Yi-Hsiang An iterative vertex coloring algorithm for vehicle routing problems with soft time windows for reverse logistics. J. Inf. Optim. Sci. 32, No. 6, 1425-1442 (2011). 2011 Taru Publications, New Delhi, Delhi, India EN vertex coloring algorithm vehicle routing time window reverse logistics

http://www.connectjournals.com/file_html_pdf/1269506H_13_JIOS_T097_32-6_pp1425-1442a.pdf

Summary: 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 is performed iteratively, taking the model's constraints into consideration. A Taiwanese waste collection network is utilized to demonstrate the implementation of the algorithm. Computational results reveal that the algorithm is efficient and effective.