Database

Creator

Date

Thumbnail

Search results

7 records were found.

Comment: 5 pages, 5 figures, final version. More information at http://www.physik.uni-kl.de/eggert/papers/index.html
Comment: Accepted version. 6 pages, 5 figures. The latest pdf-file can be found at http://www.physik.uni-kl.de/eggert/papers/index.html
This paper proposes a hybrid particle swarm optimization algorithm for solving Flow-Shop Scheduling Problems (FSSP) to minimize the maximum makespan. A new hybrid heuristic, based on Particle Swarm Optimization (PSO), Tabu Search (TS) and Simulated Annealing (SA), is presented. PSO combines local search (by self-experience) with global search (by neighboring experience), achieving a high search efficiency. TS uses a memory function to avoid being trapped at a local minimum, and has emerged as an effective algorithmic approach for the FSSP. This method can also be referred to as calculation of the horizontal direction. SA employs certain probability to avoid becoming trapped in a local optimum and the search process can be controlled by the cooling schedule (also known as calculation of vertical direction). By reasonably combining these...
Want to know more?If you want to know more about this cutting edge product, or schedule a demonstration on your own organisation, please feel free to contact us or read the available documentation at http://www.keep.pt/produtos/retrievo/?lang=en