A PSO-Based Hybrid Metaheuristic for Permutation Flowshop Scheduling Problems
This paper investigates the permutation flowshop scheduling problem (PFSP) with the objectives of minimizing the makespan and the total flowtime and proposes a hybrid metaheuristic based on the particle swarm optimization (PSO). To enhance the exploration ability of the hybrid metaheuristic, a simul...
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/902950 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832564002995044352 |
|---|---|
| author | Le Zhang Jinnan Wu |
| author_facet | Le Zhang Jinnan Wu |
| author_sort | Le Zhang |
| collection | DOAJ |
| description | This paper investigates the permutation flowshop scheduling problem (PFSP) with the objectives of minimizing the makespan and the total flowtime and proposes a hybrid metaheuristic based on the particle swarm optimization (PSO). To enhance the exploration ability of the hybrid metaheuristic, a simulated annealing hybrid with a stochastic variable neighborhood search is incorporated. To improve the search diversification of the hybrid metaheuristic, a solution replacement strategy based on the pathrelinking is presented to replace the particles that have been trapped in local optimum. Computational results on benchmark instances show that the proposed PSO-based hybrid metaheuristic is competitive with other powerful metaheuristics in the literature. |
| format | Article |
| id | doaj-art-a22ef0f8eaca41f3b19b97420a001bc8 |
| 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-a22ef0f8eaca41f3b19b97420a001bc82025-02-03T01:12:08ZengWileyThe Scientific World Journal2356-61401537-744X2014-01-01201410.1155/2014/902950902950A PSO-Based Hybrid Metaheuristic for Permutation Flowshop Scheduling ProblemsLe Zhang0Jinnan Wu1School of Information Engineering, Shenyang University, Shenyang 110044, ChinaSchool of Information Engineering, Shenyang University, Shenyang 110044, ChinaThis paper investigates the permutation flowshop scheduling problem (PFSP) with the objectives of minimizing the makespan and the total flowtime and proposes a hybrid metaheuristic based on the particle swarm optimization (PSO). To enhance the exploration ability of the hybrid metaheuristic, a simulated annealing hybrid with a stochastic variable neighborhood search is incorporated. To improve the search diversification of the hybrid metaheuristic, a solution replacement strategy based on the pathrelinking is presented to replace the particles that have been trapped in local optimum. Computational results on benchmark instances show that the proposed PSO-based hybrid metaheuristic is competitive with other powerful metaheuristics in the literature.http://dx.doi.org/10.1155/2014/902950 |
| spellingShingle | Le Zhang Jinnan Wu A PSO-Based Hybrid Metaheuristic for Permutation Flowshop Scheduling Problems The Scientific World Journal |
| title | A PSO-Based Hybrid Metaheuristic for Permutation Flowshop Scheduling Problems |
| title_full | A PSO-Based Hybrid Metaheuristic for Permutation Flowshop Scheduling Problems |
| title_fullStr | A PSO-Based Hybrid Metaheuristic for Permutation Flowshop Scheduling Problems |
| title_full_unstemmed | A PSO-Based Hybrid Metaheuristic for Permutation Flowshop Scheduling Problems |
| title_short | A PSO-Based Hybrid Metaheuristic for Permutation Flowshop Scheduling Problems |
| title_sort | pso based hybrid metaheuristic for permutation flowshop scheduling problems |
| url | http://dx.doi.org/10.1155/2014/902950 |
| work_keys_str_mv | AT lezhang apsobasedhybridmetaheuristicforpermutationflowshopschedulingproblems AT jinnanwu apsobasedhybridmetaheuristicforpermutationflowshopschedulingproblems AT lezhang psobasedhybridmetaheuristicforpermutationflowshopschedulingproblems AT jinnanwu psobasedhybridmetaheuristicforpermutationflowshopschedulingproblems |