An Improved Bat Algorithm and its Application in Permutation Flow Shop Scheduling Problem

Autor:	Yue Guang Li, Jian Jun Zhang
Rok vydání:	2014
Předmět:	Mathematical optimization Permutation Global optimum Job shop scheduling Computer science General Engineering Flow shop scheduling Computer Science::Operating Systems Computer Science::Computers and Society Bat algorithm
Zdroj:	Advanced Materials Research. :1359-1362
ISSN:	1662-8985
DOI:	10.4028/www.scientific.net/amr.1049-1050.1359
Popis:	Permutation flow shop scheduling problem is a complicated global optimum problem. In this paper, according to the characteristics of permutation flow shop scheduling problem, an improved bat algorithm was used to solve permutation flow shop scheduling problem. The algorithm was experimented and the experimental results show that the improved bat algorithm has better feasibility and validity for solving permutation flow shop scheduling problem.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::1ee6475ff29db9d64daa714aabb7d26e https://doi.org/10.4028/www.scientific.net/amr.1049-1050.1359 Zobrazit plný text záznamu