Multi-objective genetic algorithm and its applications to flowshop scheduling
Computers and Industrial Engineering
Issues in environmentally conscious manufacturing and product recovery: a survey
Computers and Industrial Engineering - Special issue on o/perational issues in environmentally conscious manufacturing
Assembly Line Design: The Balancing of Mixed-Model Hybrid Assembly Lines with Genetic Algorithms (Springer Series in Advanced Manufacturing)
A genetic algorithm approach for multi-objective optimization of supply chain networks
Computers and Industrial Engineering
Assembly line balancing with station paralleling
Computers and Industrial Engineering
Advances in Engineering Software
Computers and Industrial Engineering
Engineering Applications of Artificial Intelligence
Computers and Industrial Engineering
Computers and Industrial Engineering
Crew pairing optimization based on hybrid approaches
Computers and Industrial Engineering
A multi-objective genetic algorithm for mixed-model assembly line rebalancing
Computers and Industrial Engineering
Hi-index | 0.00 |
One of the major activities performed in product recovery is disassembly. Disassembly line is the most suitable setting to disassemble a product. Therefore, designing and balancing efficient disassembly systems are important to optimize the product recovery process. In this study, we deal with multi-objective optimization of a stochastic disassembly line balancing problem (DLBP) with station paralleling and propose a new genetic algorithm (GA) for solving this multi-objective optimization problem. The line balance and design costs objectives are simultaneously optimized by using an AND/OR Graph (AOG) of the product. The proposed GA is designed to generate Pareto-optimal solutions considering two different fitness evaluation approaches, repair algorithms and a diversification strategy. It is tested on 96 test problems that were generated using the benchmark problem generation scheme for problems defined on AOG as developed in literature. In addition, to validate the performance of the algorithm, a goal programming approach and a heuristic approach are presented and their results are compared with those obtained by using GA. Computational results show that GA can be considered as an effective and efficient solution algorithm for solving stochastic DLBP with station paralleling in terms of the solution quality and CPU time.