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

Network Heuristics for Vehicle Scheduling Problem with Time Windows

Li Jun  
In this paper,based on the analysis for characteristics of vehicle scheduling problem with timw windows (TWVSP), a network optimum heuristics is presented. In the algorithm, the LOADED POINT is named, the TWVSP is transformed into several vehicle scheduling problem with specified time (STVSP). The STVSP is solved by the algorithm of the minimum-cost maximum flow,then the time is adjusted according to the increased objective function coefficient. An example is applied to this algorithm. Finally, the adaptability and more application of this method is discussed.
【Fund】: 国家自然科学基金资助目(编号79700019)
【CateGory Index】: O221
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