Browsing by Author "Wang, Ling"

Now showing 1 - 4 of 4

Citation - Scopus: 17
A Discrete Artificial Bee Colony Algorithm for the Permutation Flow Shop Scheduling Problem with Total Flowtime Criterion
(IEEE, 2010) M. Fatih Tasgetiren; Quan-Ke Pan; P. Nagaratnam Suganthan; Angela H-L Chen; Tasgetiren, M. Fatih; Suganthan, P. Nagaratnam; Karabulut, Korhan; Pan, Quan-Ke; Ince, Yavuz; Chen, Angela H.-L.; Wang, Ling
Very recently Jarboui et al. [1] (Computers & Operations Research 36 (2009) 2638-2646) and Tseng and Lin [2] (European Journal of Operational Research 198 (2009) 84-92) presented a novel estimation distribution algorithm (EDA) and a hybrid genetic local search (hGLS) algorithm for the permutation flowshop scheduling (PFSP) with the total flowtime (TFT) criterion respectively. Both algorithms generated excellent results thus improving all the best known solutions reported in the literature so far. However in this paper we present a discrete artificial bee colony (DABC) algorithm hybridized with an iterated greedy (IG) and iterated local search (ILS) algorithms embedded in a variable neighborhood search (VNS) procedure based on swap and insertion neighborhood structures. We also present a hybrid version of our previous discrete differential evolution (hDDE) algorithm employing the IG and VNS structure too. The performance of the DABC and hDDE is highly competitive to the EDA and hGLS algorithms in terms of both solution quality and CPU times. Ultimately 43 out of 60 best known solutions provided very recently by the EDA and hGLS algorithms are further improved by the DABC and hDDE algorithms with short-term search.
Citation - WoS: 125
Citation - Scopus: 158
A hybrid harmony search algorithm for the blocking permutation flow shop scheduling problem
(Pergamon-Elsevier Science Ltd, 2011) Ling Wang; Quanke Pan; M. Fatih Tasgetiren; Tasgetiren, M. Fatih; Pan, Quan-Ke; Wang, Ling
This paper proposes a hybrid modified global-best harmony search (hmgHS) algorithm for solving the blocking permutation flow shop scheduling problem with the makespan criterion. First of all the largest position value (LPV) rule is proposed to convert continuous harmony vectors into job permutations. Second an efficient initialization scheme based on the Nawaz-Enscore-Ham (NEH) heuristic is presented to construct the initial harmony memory with a certain level of quality and diversity. Third harmony search is employed to evolve harmony vectors in the harmony memory to perform exploration whereas a local search algorithm based on the insert neighborhood is embedded to enhance the local exploitation ability. Moreover a new pitch adjustment rule is developed to well inherit good structures from the global-best harmony vector. Computational simulations and comparisons demonstrated the superiority of the proposed hybrid harmony search algorithm in terms of solution quality. © 2011 Elsevier Ltd. All rights reserved. © 2011 Elsevier B.V. All rights reserved.
Citation - WoS: 16
Citation - Scopus: 19
An Iterated Greedy Algorithm for the Hybrid Flowshop Problem with Makespan Criterion
(IEEE, 2014) Damla Kizilay; M. Fatih Tasgetiren; Quan-Ke Pan; Ling Wang; Kizilay, Damla; Tasgetiren, M. Fatih; Pan, Quan-Ke; Hu, XiaoLu; Wang, Ling; Chen, Shuai
The main contribution of this paper is to present some novel constructive heuristics for the the hybrid flowshop scheduling (HFS) problem with the objective of minimizing the makespan for the first time in the literature. We developed the constructive heuristics based the profile fitting heuristic by exploiting the waiting time feature of the HFS problem. In addition we also developed an IG algorithm with a simple insertion based local search for the first time in the literature too. The benchmark suite developed for the HFS problem are used to test the performance of the constructive heuristics and the IG algorithm. The computational results show that constructive heuristics developed were able to further improve the traditional NEH heuristics for the HFS problem with makespan criterion. Furthermore with a very short CPU times of 50nm miliseconds the performance of the IG algorithm was very competitive to the PSO and AIS algorithms that were run for 1600 seconds.
Citation - WoS: 113
Citation - Scopus: 136
Minimizing the total flow time in a flow shop with blocking by using hybridm harmony search algorithms
(Elsevier Ltd, 2010) Ling Wang; Quanke Pan; M. Fatih Tasgetiren; Tasgetiren, M. Fatih; Pan, Quan-Ke; Wang, Ling
In this paper three hybrid harmony search (HS) algorithms namely hybrid harmony search (hHS) algorithm hybrid globalbest harmony search (hgHS) algorithm and hybrid modified globalbest harmony search (hmgHS) algorithm are developed for solving the flow shop scheduling with blocking to minimize the total flow time. Firstly a largest position value (LPV) rule is proposed to convert continuous harmony vectors into job permutations. Secondly an initialization scheme based on a variant of the NEH heuristic is presented to construct the initial harmony memory with certain quality and diversity. Thirdly HS is employed to evolve harmony vectors in the harmony memory to perform exploration whereas a local search algorithm based on the insert neighborhood is embedded to enhance the local exploitation ability. In addition some new pitch adjustment rules are developed to well inherit good structures from the globalbest harmony vector. Based on a set of well-known benchmark instances extensive computational experiments are carried out. Computational results show the effectiveness of the hybrid harmony search algorithms especially the (hmgHS) algorithm in solving the blocking flow shop scheduling with total flow time criterion. © 2010 Elsevier Ltd. All rights reserved. © 2017 Elsevier B.V. All rights reserved.