2008 | OriginalPaper | Buchkapitel
On the Effectiveness of Particle Swarm Optimization and Variable Neighborhood Descent for the Continuous Flow-Shop Scheduling Problem
verfasst von : Jens Czogalla, Andreas Fink
Erschienen in: Metaheuristics for Scheduling in Industrial and Manufacturing Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Recently population-based meta-heuristics under the cover of swarm intelligence have gained prominence. This includes particle swarm optimization (PSO), where the search strategy draws ideas from the social behavior of organisms. While PSO has been reported as an effective search method in several papers, we are interested in the critical success factors of PSO for solving combinatorial optimization problems. In particular, we examine the application of PSO with different crossover operators and hybridization with variable neighborhood descent as an embedded local search procedure. Computational results are reported for the continuous (nowait) flow-shop scheduling problem. The findings demonstrate the importance of local search as an element of the applied PSO procedures. We report new best solutions for a number of problem instances from the literature.