Full-Text Search:
Home|Journal Papers|About CNKI|User Service|FAQ|Contact Us|中文
《Journal of Highway and Transportation Research and Development》 2006-07
Add to Favorite Get Latest Update

Study on a Heuristic Arithmetic for Vehicle Scheduling Problem of Non-full Loads with Time Windows

LI Zuo-qiu,WANG Guo-lin(School of Automobile and Traffic Engineering,Jiangsu University,Jinagsa Zhenjiang 212013,China)  
In this article,the authors design a heuristic arithmetic for non-fully loaded vehicle dispatchment with time window restraint.Firstly,it groups those points which are in the route,then make use of the Clark-Wright saving arithmetic to arrange the route.At last,it gives a practical example to show the theory and the procedure of this arithmetic.It is shown that this arithmetic is a concise,comprehensible and easy operate.It can resolve the non-fully loaded vehicle dispatchment problem with time window to restraint.
【CateGory Index】: U492
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