| 模拟退火算法求解最短路径填挖问题 |
| |
| 引用本文： | 周长峰,谭跃进,廖良才,刘燕. 模拟退火算法求解最短路径填挖问题[J]. 系统工程, 2005, 23(7): 109-112 |
| |
| 作者姓名： | 周长峰 谭跃进 廖良才 刘燕 |
| |
| 作者单位： | 国防科技大学,信息系统与管理学院,湖南,长沙,410073 |
| |
| 摘 要： | 在大型的工程和建筑项目中，经常要进行场地平整工作。这引出了一个最短路径填挖问题，目标是找到一个最小车辆路径，使得整个施工过程的总运输距离最短。该问题属于NP—hard问题。本文采用模拟退火算法求解该问题。最后通过算例计算，并同贪婪算法的求解结果进行比较，验证了模拟退火算法的高效性。
|
| 关 键 词： | 场地平整 最短路径问题 模拟退火算法 TSP |
| 文章编号： | 1001-4098（2005）07-0109-04 |
| 收稿时间： | 2005-04-06 |
| 修稿时间： | 2005-04-06 |
Solving the Shortest Route Cut and Fill Problem Using Simulated Annealing Algorithms |
| |
| ZHOU Chang-feng,TAN Yue-jin,LIAO Liang-cai,LIU Yan. Solving the Shortest Route Cut and Fill Problem Using Simulated Annealing Algorithms[J]. Systems Engineering, 2005, 23(7): 109-112 |
| |
| Authors: | ZHOU Chang-feng TAN Yue-jin LIAO Liang-cai LIU Yan |
| |
| Abstract: | Heavy engineering and construction projects often require terrain modifications. So the shortest cut and fill problem(SRCFP) is introduced. The objective of SRCFP is to find a vehicle route that minimizes the total distance traveled between cut and fill locations. It's a NP-hard problem. Simulated annealing algorithms are formulated to address the SRCFP. A greedy algorithm is constructed to assess the effectiveness of simulated annealing on the SRCFP. |
| |
| Keywords: | Terrain Leveling Shortest Route Problem Simulated Annealing TSP |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
