ThaiScience
ThaiScience
ENGINEERING JOURNAL CHIANG MAI UNIVERSITY
Volume 25, No. 02, Month AUGUST, Year 2018, Pages 79 - 88
Multi-objective mixed-model multi-manned assembly line balancing problem using extended combinatorial optimization with local search
Krit Prasert and Parames Chutima
Abstract Download PDF
A multi-objective mixed-model multi-man assembly line balancing problem is classified as an NP-hard problems; hence, using heuristics might be a suitable approach to effectively solve the problem. The Extended Combinatorial Optimization with Local Search (COIN-E) algorithm is developed for tackling this problem to optimize four objectives simultaneously, i.e. number of worker, number of workstations, balance workload between workstations, and work relatedness. The experimental results show that COIN-E outperforms the well-known algorithm, biogeography-based optimization (BBO), in terms of convergence, spread, number of non-dominated solutions, and CPU time.
Keywords
NoneENGINEERING JOURNAL CHIANG MAI UNIVERSITY
Published by : Faculty of Engineering Chiang Mai University
Contributions welcome at : http://researchs.eng.cmu.ac.th/?name=journal
