Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling
A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introd...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2014-01-01
|
| Series: | The Scientific World Journal |
| Online Access: | http://dx.doi.org/10.1155/2014/630280 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832551570116444160 |
|---|---|
| author | Qifang Luo Yongquan Zhou Jian Xie Mingzhi Ma Liangliang Li |
| author_facet | Qifang Luo Yongquan Zhou Jian Xie Mingzhi Ma Liangliang Li |
| author_sort | Qifang Luo |
| collection | DOAJ |
| description | A discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem. |
| format | Article |
| id | doaj-art-e3ca543dc5e144268f39a66c02aac1ba |
| institution | Kabale University |
| issn | 2356-6140 1537-744X |
| language | English |
| publishDate | 2014-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | The Scientific World Journal |
| spelling | doaj-art-e3ca543dc5e144268f39a66c02aac1ba2025-02-03T06:01:13ZengWileyThe Scientific World Journal2356-61401537-744X2014-01-01201410.1155/2014/630280630280Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop SchedulingQifang Luo0Yongquan Zhou1Jian Xie2Mingzhi Ma3Liangliang Li4College of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi 530006, ChinaCollege of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi 530006, ChinaCollege of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi 530006, ChinaCollege of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi 530006, ChinaCollege of Information Science and Engineering, Guangxi University for Nationalities, Nanning, Guangxi 530006, ChinaA discrete bat algorithm (DBA) is proposed for optimal permutation flow shop scheduling problem (PFSP). Firstly, the discrete bat algorithm is constructed based on the idea of basic bat algorithm, which divide whole scheduling problem into many subscheduling problems and then NEH heuristic be introduced to solve subscheduling problem. Secondly, some subsequences are operated with certain probability in the pulse emission and loudness phases. An intensive virtual population neighborhood search is integrated into the discrete bat algorithm to further improve the performance. Finally, the experimental results show the suitability and efficiency of the present discrete bat algorithm for optimal permutation flow shop scheduling problem.http://dx.doi.org/10.1155/2014/630280 |
| spellingShingle | Qifang Luo Yongquan Zhou Jian Xie Mingzhi Ma Liangliang Li Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling The Scientific World Journal |
| title | Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling |
| title_full | Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling |
| title_fullStr | Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling |
| title_full_unstemmed | Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling |
| title_short | Discrete Bat Algorithm for Optimal Problem of Permutation Flow Shop Scheduling |
| title_sort | discrete bat algorithm for optimal problem of permutation flow shop scheduling |
| url | http://dx.doi.org/10.1155/2014/630280 |
| work_keys_str_mv | AT qifangluo discretebatalgorithmforoptimalproblemofpermutationflowshopscheduling AT yongquanzhou discretebatalgorithmforoptimalproblemofpermutationflowshopscheduling AT jianxie discretebatalgorithmforoptimalproblemofpermutationflowshopscheduling AT mingzhima discretebatalgorithmforoptimalproblemofpermutationflowshopscheduling AT liangliangli discretebatalgorithmforoptimalproblemofpermutationflowshopscheduling |