Abstract
Based on the Proximate Optimality Principle in metaheuristics, a Population Based Guided Local Search (P-GLS) framework for dealing with difficult combinatorial optimization problems is suggested in this paper. In P-GLS, several guided local search (GLS) procedures (agents) run in a parallel way. These agents exchange information during some time points in the search. The information exchanged is the best solutions found so far by these agents. Each agent use such information to adjust its search behavior for moving to a more promising search region. Some preliminary experiments have been conducted on the traveling salesman problem to study the effectiveness of P-GLS. © 2010 IEEE.
| Original language | English |
|---|---|
| Title of host publication | 2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010 |
| DOIs | |
| Publication status | Published - 2010 |
| Externally published | Yes |
| Event | 2010 6th IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010 - Barcelona, Spain Duration: 18 Jul 2010 → 23 Jul 2010 |
Conference
| Conference | 2010 6th IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010 |
|---|---|
| Place | Spain |
| City | Barcelona |
| Period | 18/07/10 → 23/07/10 |
Fingerprint
Dive into the research topics of 'Population-Based Guided Local Search: Some preliminary experimental results'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver