A Study on the Taboo Search Algorithm for the Open Vehicle Routing Problem with Hard Time Windows

摘要：

　　In this paper studying open vehicle routing problem,a taboo search algorithm for the open vehicle routing problem with hard time windows is proposed.After constructing a mathematical model for the problem,this paper focuses on the introduction of the design procedure of TS algorithm for solving the problem.In the searching process of this algorithm,infeasible solution is allowed by adding a penalizing factor,to reduce the probability of local optimal.The computational results are provided.It shows that in most of cases this algorithm can find better solutions.

关键词： open vehicle routing problem hard time windows taboo search algorithm

作者: Wang Shuxia Xiongying Wang Zengqiang

作者单位: Department of computer science Tonghua Normal University Tonghua, china Qinghe Middle School in Jian Jian,china

会议类型: 国际会议

会议名称: 2012 2nd International Conference on Computer Application and System Modeling(2012第二届计算机应用与系统建模国际会议)(ICCASM-2012)

会议地点: 沈阳

会议语种:英文

页码: 415-418

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