Differential lévy-flights bat algorithm for minimization makespan in permutation flow shops

Authors:
Jian Xie;Yongquan Zhou;Zhonghua Tang
Affiliations:
College of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi, China;College of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi, China,Guangxi Key Laboratory of Hybrid Computation and IC Design Analysis, Nanning, Guangxi, ...;College of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi, China
Venue:
ICIC'13 Proceedings of the 9th international conference on Intelligent Computing Theories and Technology
Year:
2013

Citing 1
Cited 0

An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

The permutation flow shop problem (PFSP) is an NP-hard problem with wide engineering and theoretical background. In this paper, a differential Lévy-flights bat algorithm (DLBA) is proposed to improve basic bat algorithm for PFSP. In DLBA, LOV rule is introduced to convert the continuous position in DLBA to the discrete job permutation, the combination of NEH heuristic and random initialization is used to initialize the population with certain quality and diversity, and a virtual population neighborhoods search is used to enhance the global optimal solution and help the algorithm to escape from local optimal. Experimental results and comparisons show the effectiveness of the proposed DLBA for PFSP.