Hybrid Multi-Objective Particle Swarm Optimization for Flexible Job Shop Scheduling Problem
| Autor: | Sandeep U. Mane, S. V. Kamble, A. J. Umbarkar |
|---|---|
| Rok vydání: | 2015 |
| Předmět: |
Mathematical optimization
Control and Optimization Job shop scheduling Computer Networks and Communications business.industry Computer science Tardiness Particle swarm optimization Flow shop scheduling Hybrid algorithm Multi-objective optimization Computer Science Applications Human-Computer Interaction Artificial Intelligence Modeling and Simulation Signal Processing Simulated annealing Local search (optimization) business |
| Zdroj: | International Journal of Intelligent Systems and Applications. 7:54-61 |
| ISSN: | 2074-9058 2074-904X |
| DOI: | 10.5815/ijisa.2015.04.08 |
| Popis: | Hybrid algorithm based on Particle Swarm Optimization (PSO) and Simulated annealing (SA) is proposed, to solve Flexible Job Shop Scheduling with five objectives to be minimized simultaneously: makespan, maximal machine workload, total workload, machine idle time & total tardiness. Rescheduling strategy used to shuffle workload once the machine breakdown takes place in proposed algorithm. The hybrid algorithm combines the high global search efficiency of PSO with the powerful ability to avoid being trapped in local minimum of SA. A hybrid multi-objective PSO (MPSO) and SA algorithm is proposed to identify an approximation of the pareto front for Flexible job shop scheduling (FJSSP). Pareto front and crowding distance is used for identify the fitness of particle. MPSO is significant to global search and SA used to local search. The proposed MPSO algorithm is experimentally applied on two benchmark data set. The result shows that the proposed algorithm is better in term quality of non-dominated solution compared to the other algorithms in the literature. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|