On Open Vehicle Routing Problem with Soft Time Windows and Tabu Search

摘要：

As a typical NP-hard problem,open vehicle routing problem with soft time windows (OVRPSTW) is a kind of basic open vehicle routing problem with time windows.By setting fit neighbourhood structure,evaluation solutions,tabu list,and stopping criterion,author constructed a tabu search (TS) to solve the OVRPSTW.TS shows its good computational performance by testing benchmark problems.

关键词： Vehicle Routing Problem Open Vehicle Routing Problem Soft Time Windows Tabu Search

作者: DUAN Fenghua HE Xiaonian

作者单位: School of the traffic & transport engineering,Central South University School of Electric & Information,hunan International Economics University,P.R.China,410000

会议类型: 国际会议

会议名称: 2008 International Conference on Lofistics Engineering and Supply Chain(2008物流与供应链管理国际研讨会)

会议地点: 长沙

会议语种:英文

页码: 295-299

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