|
|
|
题名
|
作者
|
年代
|
出处
|
被引量
|
| 1 | A Review on Swarm Intelligence and Evolutionary Algorithms for Solving Flexible Job Shop Scheduling Problems显示文摘Flexible job shop scheduling problems(FJSP)have received much attention from academia and industry for many years.Due to their exponential complexity,swarm intelligence(SI)and evolutionary algorithms(EA)are developed,employed and improved for solving them.More than 60%of the publications are related to SI and EA.This paper intents to give a comprehensive literature review of SI and EA for solving FJSP.First,the mathematical model of FJSP is presented and the constraints in applications are summarized.Then,the encoding and decoding strategies for connecting the problem and algorithms are reviewed.The strategies for initializing algorithms?population and local search operators for improving convergence performance are summarized.Next,one classical hybrid genetic algorithm(GA)and one newest imperialist competitive algorithm(ICA)with variables neighborhood search(VNS)for solving FJSP are presented.Finally,we summarize,discus and analyze the status of SI and EA for solving FJSP and give insight into future research directions. | Kaizhou Gao Zhiguang Cao Le Zhang Zhenghua Chen Yuyan Han Quanke Pan | 2019 | IEEE/CAA Journal of Automatica Sinica2019，6，4： | 32 |
| 2 | An improved artificial bee colony algorithm for steelmaking–refining–continuous casting scheduling problem显示文摘Steelmaking–refining–Continuous Casting(SCC) scheduling is a worldwide problem, which is NP-hard. Effective SCC scheduling algorithms can help to enhance productivity, and thus make significant monetary savings. This paper develops an Improved Artificial Bee Colony(IABC) algorithm for the SCC scheduling. In the proposed IABC, charge permutation is employed to represent the solutions. In the population initialization, several solutions with certain quality are produced by a heuristic while others are generated randomly. Two variable neighborhood search neighborhood operators are devised to generate new high-quality solutions for the employed bee and onlooker bee phases, respectively. Meanwhile, in order to enhance the exploitation ability, a control parameter is introduced to conduct the search of onlooker bee phase. Moreover, to enhance the exploration ability,the new generated solutions are accepted with a control acceptance criterion. In the scout bee phase, the solution corresponding to a scout bee is updated by performing three swap operators and three insert operators with equal probability. Computational comparisons against several recent algorithms and a state-of-the-art SCC scheduling algorithm have demonstrated the strength and superiority of the IABC. | Kunkun Peng Quanke Pan Biao Zhang | 2018 | Chinese Journal of Chemical Engineering2018，26，8： | 11 |
| 3 | Discrete Artificial Bee Colony Algorithm for Lot-streaming Flowshop with Total Flowtime Minimization显示文摘Unlike a traditional flowshop problem where a job is assumed to be indivisible, in the lot-streaming flowshop problem, a job is allowed to overlap its operations between successive machines by splitting it into a number of smaller sub-lots and moving the completed portion of the sub-lots to downstream machine. In this way, the production is accelerated. This paper presents a discrete artificial bee colony (DABC) algorithm for a lot-streaming flowshop scheduling problem with total flowtime criterion. Unlike the basic ABC algorithm, the proposed DABC algorithm represents a solution as a discrete job permutation. An efficient initialization scheme based on the extended Nawaz-Enscore-Ham heuristic is utilized to produce an initial population with a certain level of quality and diversity. Employed and onlooker bees generate new solutions in their neighborhood, whereas scout bees generate new solutions by performing insert operator and swap operator to the best solution found so far. Moreover, a simple but effective local search is embedded in the algorithm to enhance local exploitation capability. A comparative experiment is carried out with the existing discrete particle swarm optimization, hybrid genetic algorithm, threshold accepting, simulated annealing and ant colony optimization algorithms based on a total of 160 randomly generated instances. The experimental results show that the proposed DABC algorithm is quite effective for the lot-streaming flowshop with total flowtime criterion in terms of searching quality, robustness and effectiveness. This research provides the references to the optimization research on lot-streaming flowshop. | SANG Hongyan GAO Liang PAN Quanke | 2012 | Chinese Journal of Mechanical Engineering2012，25，5： | 7 |
| 4 | Solving Multi-Area Environmental/Economic Dispatch by Pareto-Based Chemical-Reaction Optimization Algorithm显示文摘In this study, we present a Pareto-based chemicalreaction optimization(PCRO) algorithm for solving the multiarea environmental/economic dispatch optimization problems.Two objectives are minimized simultaneously, i.e., total fuel cost and emission. In the proposed algorithm, each solution is represented by a chemical molecule. A novel encoding mechanism for solving the multi-area environmental/economic dispatch optimization problems is designed to dynamically enhance the performance of the proposed algorithm. Then, an ensemble of effective neighborhood approaches is developed, and a selfadaptive neighborhood structure selection mechanism is also embedded in PCRO to increase the search ability while maintaining population diversity. In addition, a grid-based crowding distance strategy is introduced, which can obviously enable the algorithm to easily converge near the Pareto front. Furthermore,a kinetic-energy-based search procedure is developed to enhance the global search ability. Finally, the proposed algorithm is tested on sets of the instances that are generated based on realistic production. Through the analysis of experimental results, the highly effective performance of the proposed PCRO algorithm is favorably compared with several algorithms, with regards to both solution quality and diversity. | Junqing Li Quanke Pan Peiyong Duan Hongyan Sang Kaizhou Gao | 2019 | IEEE/CAA Journal of Automatica Sinica2019，6，5： | 6 |
| 5 | Distributed Flow Shop Scheduling with Sequence-Dependent Setup Times Using an Improved Iterated Greedy Algorithm显示文摘To meet the multi-cooperation production demand of enterprises,the distributed permutation flow shop scheduling problem(DPFSP)has become the frontier research in the field of manufacturing systems.In this paper,we investigate the DPFSP by minimizing a makespan criterion under the constraint of sequence-dependent setup times.To solve DPFSPs,significant developments of some metaheuristic algorithms are necessary.In this context,a simple and effective improved iterated greedy(NIG)algorithm is proposed to minimize makespan in DPFSPs.According to the features of DPFSPs,a two-stage local search based on single job swapping and job block swapping within the key factory is designed in the proposed algorithm.We compare the proposed algorithm with state-of-the-art algorithms,including the iterative greedy algorithm(2019),iterative greedy proposed by Ruiz and Pan(2019),discrete differential evolution algorithm(2018),discrete artificial bee colony(2018),and artificial chemical reaction optimization(2017).Simulation results show that NIG outperforms the compared algorithms. | Xue Han Yuyan Han Qingda Chen Junqing Li Hongyan Sang Yiping Liu Quanke Pan Yusuke Nojima | 2021 | Complex System Modeling and Simulation2021，1，3： | 4 |
| 6 | An effective shuffled frog-leaping algorithm for lot-streaming flow shop scheduling problem显示文摘 | PAN Quanke WANG Ling GAO Liang | 2010 | The International Journal of Advanced Manufacturing Technology2010，52，69： | 1 |
| 7 | A Differential Evolution Algorithm with Self-adapting Strategy and Control Parameters显示文摘 | Pan Quanke Suganthan P N Wang Ling | 2011 | Computers&Operations Research2011，38，1： | 1 |
| 8 | A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem 显示文摘 | Wang Ling Pan Quanke Tasgetiren M F | 2011 | Computers Indus- trial Engineering2011，61，1： | 1 |
| 9 | An effective iterated greedy algorithm for the mixed no-idle permutation flow shop scheduling problem显示文摘 | Pan Quanke Ruiz R | 2014 | Omega2014，44，4： | 1 |
| 10 | A novel differential evolution algorithm for the no-idle permutation flow shop scheduling problems 显示文摘 | PAN Quanke WANG Ling | 2008 | European Journal of Industrial Engineering2008，2，3： | 1 |
| 11 | A novel differential evolution algorithm for no-idle permutation flow shop scheduling problems 显示文摘 | PAN Quanke WANG Ling | 2008 | European Journal of Industrial Engineering2008，2，3： | 1 |
| 12 | Minimi- zing the total flow time in a flow shop with blocking by using hybrid harmonysearch algorithms显示文摘 | WANG Ling PAN Quanke TASGETIREN M F | 2010 | Expert Systems with Applications2010，37，12： | 1 |
| 13 | Effective hybrid discrete artificial bee colony algorithm for the total flow time minimization in the blocking flow shop problem显示文摘 | HAN Y Y LIANG J J PAN Quanke | 2013 | Interna- tional Journal of Advanced Manufacturing Technology2013，67，14： | 1 |
| 14 | A high performing memetic algorithm for the flowshop scheduling problem with blocking显示文摘 | PAN Quanke WANG Ling SANG Hongyan | 2013 | IEEE Transaction on Automation Science and Engineering2013，10，3： | 1 |
| 15 | A no- vel hybrid discrete differenti evolution algorithm for bloekingflow shop scheduling problems显示文摘 | WANG IJng PAN Quanke SUGANFHAN P N | 2010 | Computers & Operations Research2010，37，3： | 1 |
| 16 | A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems显示文摘 | WANG L PAN Quanke SUGANTH P N | 2010 | Computers & Operations Research2010，37，3： | 1 |
| 17 | A novel La- grangian relaxation approach for a hybrid flowshop scheduling problem in the steelmaking-continuous casting process显示文摘 | MAO Kun PAN Quanke PANG Xinfu | 2014 | Eu- ropean Journal of Operational Research2014，236，1： | 1 |
| 18 | A hybrid Pareto- based local search algorithm for multi-objective flexible job shop scheduling problems 显示文摘 | Li Junqing Pan Quanke CHEN Jing | 2012 | International Journal of Production Research2012，50，4： | 1 |
| 19 | A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems显示文摘 | Pan Quanke Wang Ling Qian Bin | 2009 | Computers & Operations Research2009，36，8： | 1 |
| 20 | A differential evolution algorithm with self adapting strategy and control parameters显示文摘 | PAN Quanke SUGANTHAN P N WANG Ling | 2011 | Computers and Operations Research2011，38，1： | 1 |
您所在的机构暂未开通此部分的功能，请联系管理员