摘要
给出了带时间窗的多重运输调度问题 ( MVRPTW)的转换模型 ,基于该模型提出一台车辆的自适应 Tabu Search算法 ,该算法对搜索过程进行综合记忆、自动确定施行强化和多样化策略的时机 .
Multiple demands vehicle routing problems with time windows(MVRPTW) are proposed by the organization of transportation in industrial production process. In MVRPTW, goods, such as raw and processed materials, are sent to their destinations at the scheduled time. By giving its transformed model, this paper presents a self\|adaptive tabu search for MVRPTW with one vehicle. Our algorithm can memory the search process comprehensively, and applies automatically intensification and diversification in proper time. The algorithm converges rapidly from our computing experiences.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2000年第12期42-50,共9页
Systems Engineering-Theory & Practice
关键词
多重运输调度问题
TabuSearch算法
时间窗
vehicle routing
tabu search
multiple demands vehicle routing
multiple demands vehicle routing with time windowx
