Research on Vehicle Routing Problem with Soft Time Windows based on Tabu Search Algorithm

摘要：

A kind of vehicle routing problem about one point provides services to multipoint that contains the constraint conditions of operation time and soft time windows was studied, a minimum cost objective function model was constructed, the thoughts of full arrangement searching and minimum cost of each single route were added to the tabu search algorithm which could obtain the integral optimal solution in all combinations of routing based on the high-speed arithmetic capability of computer, then a practical problem by the program written in Visual Basic was analyzed and solved, it is an effective way to solve the VRP and achieve the production efficiency by working out the artificially intelligent algorithm through the computer.

作者: Xiao-cheng FAN Nai-liang LI Bai-yu ZHANG Zhen-hua LIU

作者单位: School of Mine, China University of Mining and Technology, Xuzhou,Jiangsu,221116

会议类型: 国际会议

会议名称: 2011 IEEE 18th International Conference on Industrial Engineering and Engineering Management(2011 IEEE 第十八届工业工程与工程管理国际会议 IEEM2011)

会议地点: 长春

会议语种:英文

页码: 420-423

在线出版日期: 2011-09-03（万方平台首次上网日期，不代表论文的发表时间）