摘要： 将通常用于配送领域路线优化的节约法(C-W算法)运用于采购物流领域，研究运输过程中可能出现的突发任务，采用多Agent技术及时予以解决。针对装配企业采购物流中运输产品的特点，将任务分为初始任务和突发任务，初始任务采用插入车辆载重量、容积双重约束条件的C-W算法，突发任务采用车辆Agent自主竞标的方式，获得最优解的同时及时智能地解决突发任务。用一个实例验证了C-W算法对初始任务的分配和Agent车辆对突发任务竞标的适用性。

关键词: 采购物流, 节约法, 智能代理, 车辆调度

Abstract: An attempt is made to apply C-W algorithm, which is usually used in routed optimization in the domain of distribution, to purchase logistics，and the research focuses on unexpected tasks that may be occurred in the process of transportation timely and intellectually. In view of the characteristic of transported products in the purchase logistics of assembly enterprises, the task is divided into initial tasks and unexpected tasks. The former adopted C-W algorithm to vehicle capacity and volume as dual constraints is inserted. The latter is used autonomous vehicles competitive bidding independently, which can obtain the optimal solution and solve unexpected tasks timely and intellectually. An example is given to confirm the service ability of C-W algorithm in distributing the initial tasks and autonomous vehicles competitive bidding independently and a good result is obtained.

Key words: purchase logistics, C-W algorithm, intelligent Agent, vehicle schedule

中图分类号: 

• TP18