Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/C9E5977A-118C-424C-828A-12B6600E8E29 | - |
| Identifier | https://doi.org/10.1007/978-1-4614-5134-1_6 | - |
| Language | en | - |
| Title | A hybrid particle swarm optimization algorithm for the permutation flowshop scheduling problem | en |
| Creator | Marinakis Ioannis | en |
| Creator | Μαρινακης Ιωαννης | el |
| Creator | Marinakis Ioannis | en |
| Creator | Μαρινακης Ιωαννης | el |
| Publisher | Springer Verlag | en |
| Content Summary | This paper introduces a new hybrid algorithmic nature inspired approach based on Particle Swarm Optimization, for successfully solving one of the most computationally complex problems, the Permutation Flowshop Scheduling Problem. The Permutation Flowshop Scheduling Problem (PFSP) belongs to the class of combinatorial optimization problems characterized as NP-hard and, thus, heuristic and metaheuristic techniques have been used in order to find high quality solutions in reasonable computational time. The proposed algorithm for the solution of the PFSP, the Hybrid Particle Swarm Optimization (HybPSO), combines a Particle Swarm Optimization (PSO) Algorithm, the Variable Neighborhood Search (VNS) Strategy and a Path Relinking (PR) Strategy. In order to test the effectiveness and the efficiency of the proposed method we use a set of benchmark instances of different sizes. | en |
| Type of Item | Περίληψη Δημοσίευσης σε Συνέδριο | el |
| Type of Item | Conference Paper Abstract | en |
| License | http://creativecommons.org/licenses/by/4.0/ | en |
| Date of Item | 2015-10-28 | - |
| Date of Publication | 2013 | - |
| Bibliographic Citation | Y. Marinakis and M. Marinaki, “Combinatorial Neighborhood Topology Particle Swarm Optimization Algorithm for the Vehicle Routing Problem”, in The 13th European Conference on Evolutionary Computation in Combinatorial Optimization, 2013, pp. 133–144. DOI: 10.1007/978-1-4614-5134-1_6 | en |
Copyright © DIAS 2013
