In this article, we introduce a new solving framework based on using alternatively two local-search algorithms to solve constraint satisfaction and optimization problems. The technique presented is based on the integration of local-search algorithm as a ...
Using constraint programming (CP) to explore a local-search neighbourhood was first tried in the mid 1990s. The advantage is that constraint propagation can quickly rule out uninteresting neighbours, sometimes greatly reducing the number actually ...
Display Omitted Meta-RaPS is a recent metaheuristic for optimization problems that is simple and effective.The time consuming local search phase of Meta-RaPS is replaced by Path Relinking as a learning module.The results show that the newly designed ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in
