|
|||||
|
|
| 基于遗传算法的钻机调度路线最优化 | |
| 引用本文： | 兰凯,杨建林,鄢泰宁.基于遗传算法的钻机调度路线最优化[J].地质科技情报,2005,24(Z1):40-42. |
| 作者姓名： | 兰凯 杨建林 鄢泰宁 |
| 作者单位： | 1. 中国地质大学研究生院,武汉,430074 2. 中国地质大学研究生院,武汉,430074;江西省地质工程总公司,南昌,330002 3. 中国地质大学工程学院,武汉,430074 |
| 摘 要： | 在实际桩基施工过程中,由施工管理人员根据自己的经验和现场的基本要求对钻机调度路线做出安排的方法不能做到对工期的有效控制和对钻机路线的优化调度.将钻机的调度问题转换成多旅行商的巡回问题并进一步分割,以求解硬时间约束的单旅行商问题.为了求得优化解,引入遗传算法,采用MATLAB编制了相应的程序.通过对上海黄埔体育中心桩基工程的应用分析,并与实际施工对照,结果表明遗传算法思想应用到实际施工中是可行的. |
| 关 键 词： | 遗传算法 旅行商问题 调度 最优化 |
| 文章编号： | 1000-7849(2005)S0-0040-03 |
| 修稿时间： | 2005年3月4日 |
Optimization of Rig's Route Scheduling Based on Genetic Algorithm |
|
| LAN Kai,YANG Jian-lin,YAN Tai-ning.Optimization of Rig''''s Route Scheduling Based on Genetic Algorithm[J].Geological Science and Technology Information,2005,24(Z1):40-42. | |
| Authors: | LAN Kai YANG Jian-lin YAN Tai-ning |
| Abstract: | Practioners in the management of an engineering project usually make rig's route scheduling in pile foundation according to their experience and basic requirements, which can neither control the engineering process or optimize the route. This paper takes the optimization problem as a multi-traveling salesman problem and divides the problem into different operators. Then it changes the problem into a single traveling salesman problem with hard time restraints. To solve this problem,the genetic algorithm(GA) is introduced and a MATLAB program is written on this GA. The scheduling result of Huangpu Sports Centre pile foundation project shows that GA is feasible for rig's route scheduling. |
| Keywords: | MATLAB |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |