检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]大连理工大学大连半导体技术学院,辽宁大连116024 [2]大连理工大学系统工程研究所,辽宁大连116024 [3]大连理工大学软件学院,辽宁大连116620
出 处:《大连理工大学学报》2012年第2期290-296,共7页Journal of Dalian University of Technology
基 金:国家杰出青年科学基金资助项目(70725004);国家自然科学基金资助项目(70801008)
摘 要:为解决物流配送过程中顾客时间窗变化而导致的物流配送计划无法实现的难题,运用干扰管理方法,以干扰事件发生时的问题状态为基础,提出了新车增派策略和多车协作策略及其实施条件,并在此基础上建立了问题扰动救援的一种启发式算法.该算法针对受扰车辆路线上的所有顾客,根据新车增派策略和多车协作策略,依次将每一顾客在原计划的送货车辆、其他在途车辆,以及增派的新车之间分配,并重新规划分配之后的车辆路线.最后在标准算例上使用该算法与文献遗传算法进行了比较分析,结果表明该算法对于干扰事件发生后的车辆路线重排结果在系统整体扰动程度方面明显优于文献算法.During the process of logistics distribution,disruption events caused by customer time window changing often lead to the infeasibility of the initial logistics distribution plan.For vehicle routing problems with time windows in logistics distribution,disruption management methodology is applied.Based on the problem state at the time when disruption event occurs,the strategies of dispatching a vehicle from the depot and arranging a running vehicle in order to rescue the disrupted customers are studied,and a heuristic method for problem logistics disruption rescue is presented.The method assigns the delivery tasks of every disrupted customer respectively to the planned vehicle,other running vehicles,or a new vehicle from the depot based on the proposed strategies,and then reroutes the vehicles.Finally,analysis and comparison between the heuristic method and a typical genetic algorithm from a reference are made on benchmark problems.The analytical results show the heuristic method is evidently better than the algorithm from a reference for rerouting of the vehicles after disruption events in the aspect of systemic disruption degree.
分 类 号:TP39[自动化与计算机技术—计算机应用技术] C93[自动化与计算机技术—计算机科学与技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.244