首页 | 本学科首页   官方微博 | 高级检索  
     

一种多车场多车型VSP问题的求解算法
引用本文:骆正清,肖鸿庆. 一种多车场多车型VSP问题的求解算法[J]. 物流科技, 2007, 30(10): 37-40
作者姓名:骆正清  肖鸿庆
作者单位:合肥工业大学,安徽,合肥,230009
摘    要:论文考虑了一种具有模糊指派功能、车辆具有车型利用水平约束和容量约束、顾客有Hard时间窗的多车场车辆调度问题。同时设计出两阶段的求解算法,第一阶段考虑将各个客户需求点模糊指派给各个车场;第二阶段安排优化子路线时,增加了多车型、车型利用水平、硬时间窗的约束。最后给出一个算例。

关 键 词:VSP问题  排序链  模糊指派  H盯d时间窗
文章编号:1002-3100(2007)10-0037-04
收稿时间:2007-03-19
修稿时间:2007-03-19

An Algorithm for Vehicle Scheduling Problem with Multi-depots and Multi-type Vehicles
LUO Zheng-qing,XIAO Hong-qing. An Algorithm for Vehicle Scheduling Problem with Multi-depots and Multi-type Vehicles[J]. Logistics Management, 2007, 30(10): 37-40
Authors:LUO Zheng-qing  XIAO Hong-qing
Affiliation:Hefei University of Technology; Hefei 230009, China
Abstract:This paper concerns the multi-depots vehicle scheduling problem with the function of fuzzy assignment and with the constraints of vehicle-type-utilize level, vehicle capacity and the constraint of had-time window of customer. This paper also proposes a two-phase algorithm, in the first phase, we assign the customer nodes to the appropriate depot by a fuzzy method. In the second phase, in the process of arranging and optimizing the son-routes, we add the constraints of multi-type vehicle and vehicle-type-utilize level and hard time window. At last, an example is given.
Keywords:
本文献已被 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号