التفاصيل البيبلوغرافية
| العنوان: |
Metaheuristic approach to solving U-shaped assembly line balancing problems using a rule-base coded genetic algorithm |
| المؤلفون: |
Martinez-Contreras, Ulises, author, Duff, William S., advisor, Troxell, Wade O., committee member, Labaide, John W., committee member, Sampath, Walajabad S., committee member |
| بيانات النشر: |
Colorado State University. Libraries |
| سنة النشر: |
2015 |
| المجموعة: |
Digital Collections of Colorado (Colorado State University) |
| مصطلحات موضوعية: |
U-shaped assembly line balancing, genetic algorithm |
| الوصف: |
Includes bibliographical references. ; 2015 Summer. ; The need to achieve line balancing for a U-shaped production line to minimize production time and cost is a problem frequently encountered in industry. This research presents an efficient and quick algorithm to solve the U-shape line-balancing problem. Heuristic rules used to solve a straight line-balancing problem (LBP) were modified and adapted so they could be applied in a U-shape line-balancing problem model. By themselves, the heuristic rules, which were adapted from straight-line systems, can produce good solutions for the U-shape LBP, however, there is nothing that guarantees that this will be the case. One way to achieve improved solutions using heuristic rules can be accomplished by using a number of rules simultaneously to break ties during the task assignment process. In addition to the use of heuristic and simultaneous heuristic rules, basic genetic operations were used to further improve the performance of the assignment process and thus obtain better solutions. Two genetic algorithms are introduced in this research: a direct-coded and an indirect-coded model. The newly introduced algorithms were compared with well-known problems from literature and their performance as compared to other heuristic approaches showed that they perform well. The indirect-coded genetic algorithm uses the adapted heuristic rules from the LBP as genes to find the solutions to the problem. In the direct-coded algorithm, each gene represents an operation in the LBP and the position of the gene in the chromosome represents the order in which an operation, or task, will be assigned to a workstation. The indirect-coded genetic algorithm introduces sixteen heuristic rules adapted from the straight LBP for use in a U-shape LBP. Each heuristic rule was represented inside the chromosome as a gene. The rules were implemented in a way that precedence is preserved and at the same time, facilitate the use of genetic operations. Comparing the algorithm’s results with known results ... |
| نوع الوثيقة: |
text |
| وصف الملف: |
born digital; doctoral dissertations; application/pdf |
| اللغة: |
English |
| العلاقة: |
MartinezContreras_colostate_0053A_13209.pdf; http://hdl.handle.net/10217/167226Test |
| الإتاحة: |
http://hdl.handle.net/10217/167226Test |
| حقوق: |
Copyright and other restrictions may apply. User is responsible for compliance with all applicable laws. For information about copyright law, please see https://libguides.colostate.edu/copyrightTest. |
| رقم الانضمام: |
edsbas.EBABB862 |
| قاعدة البيانات: |
BASE |
