Incorporating domain-specific heuristics in a particle swarm optimization approach to the quadratic assignment problem
| Autor: | Ayah Helal, Ashraf M. Abdelbar |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Mathematical optimization
Control and Optimization General Computer Science business.industry Quadratic assignment problem MathematicsofComputing_NUMERICALANALYSIS Particle swarm optimization ComputingMethodologies_ARTIFICIALINTELLIGENCE Swarm intelligence Tabu search Local search (optimization) Multi-swarm optimization Heuristics business Metaheuristic Mathematics |
| Zdroj: | Memetic Computing. 6:241-254 |
| ISSN: | 1865-9292 1865-9284 |
| DOI: | 10.1007/s12293-014-0141-y |
| Popis: | We propose two variations on particle swarm optimization (PSO): the use of a heuristic function as an additional biasing term in PSO solution construction; and the use of a local search step in the PSO algorithm. We apply these variations to the hierarchical PSO model and evaluate them on the quadratic assignment problem (QAP). We compare the performance of our method to diversified-restart robust tabu search (DivTS), one of the leading approaches at present for the QAP. Our experimental results, using instances from the QAPLIB instance library, indicate that our approach performs competitively with DivTS. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink