Welcome to the InfoSci Platform
Reference Hub8
A Bat Algorithm with Generalized Walk for the Two-Stage Hybrid Flow Shop Problem

A Bat Algorithm with Generalized Walk for the Two-Stage Hybrid Flow Shop Problem

Latifa Dekhici, Khaled Belkadi
Copyright: © 2015 |Volume: 7 |Issue: 3 |Pages: 16
ISSN: 1941-6296|EISSN: 1941-630X|EISBN13: 9781466677234|DOI: 10.4018/IJDSST.2015070101
Cite Article Cite Article

MLA

Dekhici, Latifa, and Khaled Belkadi. "A Bat Algorithm with Generalized Walk for the Two-Stage Hybrid Flow Shop Problem." IJDSST vol.7, no.3 2015: pp.1-16. http://doi.org/10.4018/IJDSST.2015070101

APA

Dekhici, L. & Belkadi, K. (2015). A Bat Algorithm with Generalized Walk for the Two-Stage Hybrid Flow Shop Problem. International Journal of Decision Support System Technology (IJDSST), 7(3), 1-16. http://doi.org/10.4018/IJDSST.2015070101

Chicago

Dekhici, Latifa, and Khaled Belkadi. "A Bat Algorithm with Generalized Walk for the Two-Stage Hybrid Flow Shop Problem," International Journal of Decision Support System Technology (IJDSST) 7, no.3: 1-16. http://doi.org/10.4018/IJDSST.2015070101

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

In the last years, a set of bio-inspired metaheuristics has proved their efficiencies in combinational and continues optimization areas. This paper intends to hybrid a discrete version of Bat Algorithm (BA) with Generalized Evolutionary Walk Algorithm (GEWA) to solve the mono-processors two stages Hybrid Flow Shop scheduling. The authors compare the modified bat algorithm with the original one, with Particle Swarm Optimization (PSO) and with others results taken from literature. Computational results on a standard two-stage hybrid flow shop benchmark of 70 cases, and about 1700 instances, indicate that the proposed algorithm finds the best makespan (Cmax) in a good processing time comparing to the original bat algorithm and other algorithms.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.