A Hybrid Tabu Search for Open Vehicle Routing Problem

摘要：

The open vehicle routing problem (OVRP) means that vehicles do not return to the depot after servicing the last customer, the OVRP is encountered in practice in the home delivery of packages and newspapers. In this paper we design a hybrid tabu search algorithm for OVRP to minimize vehicle number and travel costs, and we test the prposed approaches by the benchmarks, the experimental results show the effectiveness and performance of the proposed approaches.

关键词： tabu search open vehicle routing problem optimization

作者: Fuhua Huang Changshi Liu

作者单位: School of Management Hunan University of Commerce Hunan, Changsha, P.R.China, 410205

会议类型: 国际会议

会议名称: 2010 International Conference on Computer and Communication Technologies in Agriculture Engineering(计算机与通信技术在农业工程国际会议 CCTAE 2010)

会议地点: 成都

会议语种:英文

页码: 132-134

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