期刊
COMPUTERS & OPERATIONS RESEARCH
卷 30, 期 1, 页码 117-138出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/S0305-0548(01)00085-5
关键词
facility layout problem; ship compartment layout problem; genetic algorithm; passage; inner structure wall; Dijkstra's algorithm
This study proposes an improved genetic algorithm (GA) to derive solutions for facility layouts that are to have inner walls and passages. The proposed algorithm models the layout of facilities on gene structures. These gene structures consist of a four-segmented chromosome. Improved solutions are produced by employing genetic operations known as selection, crossover, inversion, mutation, and refinement of these genes for successive generations. All relationships between the facilities and passages are represented as an adjacency graph. The shortest path and distance between two facilities is calculated using Dijkstra's algorithm of graph theory. Comparative testing shows that the proposed algorithm performs better than other existing algorithms for the optimal facility layout design. Finally, the proposed algorithm is applied to ship compartment layout problems with the computational results compared with an actual ship compartment layout.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据