학술논문

Population-Based Guided Local Search: Some preliminary experimental results
Document Type
Conference
Source
IEEE Congress on Evolutionary Computation Evolutionary Computation (CEC), 2010 IEEE Congress on. :1-5 Jul, 2010
Subject
Computing and Processing
Collaboration
Cities and towns
Traveling salesman problems
Optimization
Search problems
Computer science
Educational institutions
Language
ISSN
1089-778X
1941-0026
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.