检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]海军装备研究院,北京100161
出 处:《计算机仿真》2010年第4期4-7,44,共5页Computer Simulation
摘 要:针对战时舰船抢修问题,研究在维修资源有限的情况下,如何合理地安排维修活动,以最短的时间、最少的手段使装备至少具有完成部分任务的能力,其目标是从整体上高效分配资源,缩短维修所需的时间。根据规划调度理论,采用基于人工智能的规划调度方法,提出了贪婪随机变邻域搜索算法,该算法求解速度快、解质量稳定。在此基础上建立了舰船抢修任务规划约束优化模型,并研究了战时舰船抢修任务的启发式求解框架和启发式构造规则。模型及算法在战时维修保障决策支持系统得到了实际应用,经证明该算法是一种非常实用的求解途径。Aimed at the problem of rush to repair of ship in the wartime, with the limited maintain resources, it is researched that how to plan the maintaining in reason in the shortest time and with the least resorts to make the equip capable of accomplishing part of tasks at least. Its target is assigning resources effectively from the integer, shortening maintaining time. According to layout attempering theory, the layout auempering algorithm based on artificial intelli- gence is adopted, and the greedy randomized variable neighborhood search algorithm is brought forward. The Algo- rithm speed is fast and the result is stable. Based on it, the task programming constraint optimization model of rush to repair of the ship is established, and the heuristic explainable frame and heuristic conformation rule of rush to repair task of the ship in the wartime is researched. The model and the algorithm is applied in maintaining and supporting decision -making system in the wartime, and the algorithm proves an applied approach.
分 类 号:O221[理学—运筹学与控制论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.145