| 水果运输调度问题的优化 |
| |
| 引用本文： | 朱君,蔡延光,汤雅连.水果运输调度问题的优化[J].北京联合大学学报(自然科学版),2014,28(2):79-84. |
| |
| 作者姓名： | 朱君 蔡延光 汤雅连 |
| |
| 作者单位： | 广东工业大学自动化学院,广州,510006;广东工业大学自动化学院,广州,510006;广东工业大学自动化学院,广州,510006 |
| |
| 基金项目： | 国家自然科学基金项目（61074147,61074185）,广东省自然科学基金项目（S2011010005059,8351009001000002）,广东省教育厅产学研结合项目（2012B091000171,2011B090400460）,广东省科技计划项目（2012B050600028,2010B090301042）. |
| |
| 摘 要： | 针对带硬时间窗的水果运输调度问题(Fruits in Vehicle Routing Problem with Hard Time Windows,FVRPHTW),联系实际应用中水果易腐的特性及运输途中的路况因素,采用蚁群算法、模拟退火算法和禁忌搜索算法来对FVRPHTW求解,并分析3种算法的优缺点。实例证明,这些算法对求解水果运输调度问题是可行的,模拟退火算法略优于其他两种算法。
|
| 关 键 词： | 硬时间窗 水果运输调度问题 蚁群算法 模拟退火 禁忌搜索 |
Optimization of Vehicle Routing Problem for Fruits |
| |
| ZHU Jun,CAI Yan-guang,TANG Ya-lian.Optimization of Vehicle Routing Problem for Fruits[J].Journal of Beijing Union University,2014,28(2):79-84. |
| |
| Authors: | ZHU Jun CAI Yan-guang TANG Ya-lian |
| |
| Institution: | ( School of Automation, Guangdong University of Technology, Guangzhou 510006, China) |
| |
| Abstract: | Aiming at FVRPHTW practical problem of fruit decay annealing） and TS （tabu search） algorithms were made. The result than the other two algorithms. （Fruits in Vehicle Routin as well as the road con g Problem with Hard Time Windows） , the fundamental principle of considering the SA （ simulated were introduced, and analysis on the advantages and disadvantages of these shows that these algorithms are flexible to solve FVRPHTW, and SA is better |
| |
| Keywords: | Hard time windows FVRPHTW Ant colony algorithm Simulated annealing Tabu search |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
