Full-Text Search:
Home|About CNKI|User Service|中文
Add to Favorite Get Latest Update

Model and Algorithms for Mixed Fleet Vehicle Routing Problem with Soft Time Windows

YUAN Qing-da, DU Wen, ZHOU Zai-ling (School of Traffic and Transp., Southwest Jiaotong University, Chengdu 610031, China)  
The typical vehicle routing problem is expanded to the situation that customers have the restriction of soft time windows and a depot has various kinds of vehicles to distribute. After constructing a mathematical model for the problem, this paper focuses on the introduction of the design procedure of TS algorithm for solving the problem. And then, combined with the adaptive memory procedure, the pseudo-code description of rs algorithm and an example are presented.
Download(CAJ format) Download(PDF format)
CAJViewer7.0 supports all the CNKI file formats; AdobeReader only supports the PDF format.
©CNKI All Rights Reserved