Hits:
Indexed by:期刊论文
Date of Publication:2017-10-01
Journal:COMPUTERS & INDUSTRIAL ENGINEERING
Included Journals:Scopus、SCIE、EI
Volume:112
Page Number:616-633
ISSN No.:0360-8352
Key Words:Combinatorial optimization problem; Multiobjective optimization problem; Hybrid evolutionary algorithms; Genetic algorithm; AGV dispatching; Assembly line balancing; Flowshop scheduling model; TFT-LCD module assembly model; Process planning and scheduling model
Abstract:In real manufacturing systems there are many combinatorial optimization problems (COP) imposing on more complex issues with multiple objectives. However it is very difficult for solving the intractable COP problems by the traditional approaches because of NP-hard problems. For developing effective and efficient algorithms that are in a sense "good," i.e., whose computational time is small as within 3 min, we have to consider three issues: quality of solution, computational time and effectiveness of the nondominated solutions for multiobjective optimization problem (MOP).
In this paper, we focus on recent hybrid evolutionary algorithms (HEA) to solve a variety of single or multiobjective scheduling problems in manufacturing systems to get a best solution with a smaller computational time. Firstly we summarize multiobjective hybrid genetic algorithm (Mo-HGA) and hybrid sampling strategy-based multiobjective evolutionary algorithm (HSS-MoEA) and then propose HSS-MoEA combining with differential evolution (HSS-MoEA-DE). We also demonstrate those hybrid evolutionary algorithms to bicriteria automatic guided vehicle (B-AGV) dispatching problem, robot-based assembly line balancing problem (R-ALB), bicriteria flowshop scheduling problem (B-FSP), multiobjective scheduling problem in thin-film transistor-liquid crystal display (TFT-LCD) module assembly and bicriteria process planning and scheduling (B-PPS) problem. Also we demonstrate their effectiveness of the proposed hybrid evolutionary algorithms by several empirical examples. (C) 2017 Elsevier Ltd. All rights reserved.
