Hybridization of Particle Swarm Optimization with Variable Neighborhood Search and Simulated Annealing for Improved Handling of the Permutation Flow-Shop Scheduling Problem.
Iqbal HayatAdnan TariqWaseem ShahzadManzar MasudShahzad AhmedMuhammad Umair AliAmad ZafarPublished in: Syst. (2023)
Keyphrases
- variable neighborhood search
- metaheuristic
- simulated annealing
- particle swarm optimization
- tabu search
- hybrid algorithm
- neighborhood search
- genetic algorithm
- ant colony optimization
- search procedure
- pso algorithm
- vehicle routing problem
- particle swarm optimization pso
- scatter search
- benchmark instances
- path relinking
- feasible solution
- evolutionary algorithm
- combinatorial optimization
- combinatorial optimization problems
- heuristic methods
- combinatorial problems
- memetic algorithm
- multi objective
- benchmark problems
- global optimization
- optimization method
- traveling salesman problem
- search space
- solution space
- genetic algorithm ga
- flowshop
- hybrid method
- differential evolution
- hill climbing
- optimization problems
- minimum spanning tree
- solution quality
- search algorithm
- np hard
- optimal solution
- neural network