Combining local search into non-dominated sorting for multi-objective line-cell conversion problem
Multi-objective decision-making is often used in line-cell conversion problem. It is the key issue of developing line-cell conversion successfully. In this article, a multi-objective optimisation model is proposed to investigate two line-cell conversion performances: the total throughput
time and the total labour hours. It is proved that the model is a non-deterministic polynomial (NP)-hard problem and its Pareto-optimal front is non-convex. Owing to the properties of cell formation and cell loading in line-cell conversions, an approach of combining local search into non-dominated
sorting genetic algorithm II is proposed to obtain better non-dominated solutions. Several numerical simulation experiments are performed to show the utility and performance of our approach.
No Reference information available - sign in for access.
No Citation information available - sign in for access.
No Supplementary Data.
No Article Media
non-dominated sorting genetic algorithm
Document Type: Research Article
Institute of Systems Engineering, State Key Laboratory of Synthetic Automation for Process Industries, Northeastern University, Shenyang,110819, P.R. China
College of Business Administration, Liaoning University, Shenyang,110136, P.R. China
Department of Economics and Business Management,Yamagata University, Yamagata,990-8560, Japan
Faculty of Environmental and Information Studies,Tokyo City University, Yokohama,224-8551, Japan
April 1, 2013
More about this publication?