| 带时间窗的多重运输调度问题的自适应Tabu Search算法 |
| |
| 引用本文： | 蔡延光,钱积新,孙优贤.带时间窗的多重运输调度问题的自适应Tabu Search算法[J].系统工程理论与实践,2000,20(12):42-50. |
| |
| 作者姓名： | 蔡延光 钱积新 孙优贤 |
| |
| 作者单位： | (1)湖北汽车工业学院管理系;(2)浙江大学工业控制技术研究所 |
| |
| 摘 要： | 给出了带时间窗的多重运输调度问题 ( MVRPTW)的转换模型 ,基于该模型提出一台车辆的自适应 Tabu Search算法 ,该算法对搜索过程进行综合记忆、自动确定施行强化和多样化策略的时机 .大量的实际计算表明本文提出的算法能在较短的时间内求出问题的最优解.
|
| 关 键 词： | 运输调度 TabuSearch 多重运输调度 带时间窗的多重运输调度 |
| 修稿时间： | 1999-03-15 |
Self-adaptive Tabu Search for Multiple Demands Vehicle Routing and Scheduling Problems with Time Windows |
| |
| CAI Yan-guang,QIAN Ji-xin,SUN You-xian.Self-adaptive Tabu Search for Multiple Demands Vehicle Routing and Scheduling Problems with Time Windows[J].Systems Engineering —Theory & Practice,2000,20(12):42-50. |
| |
| Authors: | CAI Yan-guang QIAN Ji-xin SUN You-xian |
| |
| Institution: | (1)Department of Management Engineering,Hubei Automotive Industries Institute;(2)Institute of Industrial Control Techniques,Zhejiang University |
| |
| Abstract: | 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. |
| |
| Keywords: | vehicle routing tabu search multiple demands vehicle routing multiple demands vehicle routing with time windowx |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统工程理论与实践》浏览原始摘要信息 |
| 点击此处可从《系统工程理论与实践》下载免费的PDF全文 |
