Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
Add to Favorite Get Latest Update

A Parallel Double Tabu Based Tabu Search for Multiple Demands Vehicle Routing Problems

Cai Yanguang 1\ Qian Jixin 2\ Sun Youxian 2 \ 1(Hubei Automotive Industries Institute, Shiyan Hubei 442002) \ 2(Institute of Industrial Control Technology, Zhejiang University, Hangzhou 310027)  
Transportation planning and implementation in industrial production process of large enterprise is generally formulated as multiple demands vehicle routing problems (MVRP). This paper presents a tabu search based on insertion and double tabu strategy for MVRP. A parallel tabu search is also designed. These algorithms have good performance in our computing experience.
【CateGory Index】: F512.1,N94
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©2006 Tsinghua Tongfang Knowledge Network Technology Co., Ltd.(Beijing)(TTKN) All rights reserved