.png){kind=icon}
.png){kind=icon}
Return
Generalisation of unidirectional loop layout problem and solution by a genetic algorithm
.png){kind=icon}
PRE
AI
DOI：10.1080/00207540903496673.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Unidirectional loop layouts (ULLs) are the preferred layouts in manufacturing systems owing to their relative low investment costs, high material handling elasticity and routing flexibility. Existing formulations of the unidirectional loop layout problem are concentrated on the arrangement of workstations under the assumption that the number and location of loading and unloading stations are known. In this study, the unidirectional loop layout problem is generalised by consideration of potentially attachable loading/unloading equipment to each workstation and releasing of the predetermined number of loading and unloading stations. Thus, more efficient and effective loop layout designs are allowed by eliminating some artificial restrictions. The present ULL model is generalised and a genetic algorithm is developed to solve the problem. Solutions obtained by the genetic algorithm outperformed those obtained by conventional methods. Additionally, comparisons of the generalised model with existing models on randomly generated test problems yielded encouraging results.
Keywords:
unidirectional loop layout problem
loading
unloading station
location-allocation problem
genetic algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.3
Papers:
1.1W
Citations:
3.7W