کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482245 | 1446211 | 2006 | 27 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: Solving machine-loading problem of a flexible manufacturing system with constraint-based genetic algorithm Solving machine-loading problem of a flexible manufacturing system with constraint-based genetic algorithm](/preview/png/482245.png)
Machine-loading problem of a flexible manufacturing system is known for its complexity. This problem encompasses various types of flexibility aspects pertaining to part selection and operation assignments along with constraints ranging from simple algebraic to potentially very complex conditional constraints. From the literature, it has been seen that simple genetic-algorithm-based heuristics for this problem lead to constraint violations and large number of generations. This paper extends the simple genetic algorithm and proposes a new methodology, constraint-based genetic algorithm (CBGA) to handle a complex variety of variables and constraints in a typical FMS-loading problem. To achieve this aim, three new genetic operators—constraint based: initialization, crossover, and mutation are introduced. The methodology developed here helps avoid getting trapped at local minima. The application of the algorithm is tested on standard data sets and its superiority is demonstrated. The solution approach is illustrated by a simple example and the robustness of the algorithm is tested on five well-known functions.
Journal: European Journal of Operational Research - Volume 175, Issue 2, 1 December 2006, Pages 1043–1069