造船厂
关键路径法
遗传算法
回溯
块(置换群论)
造船
调度(生产过程)
算法
路径(计算)
序列(生物学)
发电机(电路理论)
计算机科学
可控性
工程类
数学优化
模拟
数学
操作系统
几何学
量子力学
应用数学
系统工程
考古
功率(物理)
物理
遗传学
历史
生物
作者
Duck Young Yoon,Ranjan Varghese,Jingping Yang
标识
DOI:10.1533/saos.2005.0124
摘要
Abstract In order to attain soaring heights of production targets in stringent constraints, a computer program based on a genetic algorithm (GA) has been developed. The initial block is considered as a seed or parent and related blocks as children or offspring. The parent–child relation, which is predefined in a general database structure (sorted), is used to form genetic looping that keeps on producing children through downward generations. Customization can be done according to the shipyard layout to enhance the ease of operation. The GA enables avoiding heuristic considerations and makes the program self- reliant. Conventional scheduling applications depend on backtracking, which has certain shortcomings. To make scheduling realistic and competent, a virtual shipyard simulator is developed that complies with the proposed erection sequence generator. An evalution is done to track blocks lying on a critical path, by comparing equality of the starting and the ending day of erection of the concerned block. A simulated GA methodology is designed that generates the entire time-based erection sequence such that the blocks lying on the critical path are erected on a stipulated day.
科研通智能强力驱动
Strongly Powered by AbleSci AI