Name
Title | ||
|---|---|---|
A Cooperative Framework Based on Local Search and Constraint Programming for Solving Discrete Global Optimisation |
Abstract | ||
|---|---|---|
Our research has been focused on developing cooperation techniques for solving large scale combinatorial optimisation problems using Constraint Programming with Local Search. In this paper, we introduce a framework for designing cooperative strategies. It is inspired from recent research carried out by the Constraint Programming community. For the tests that we present in this work we have selected two well known techniques: Forward Checking and Iterative Improvement. The set of benchmarks for the Capacity Vehicle Routing Problem shows the advantages to use this framework. |
Year | DOI | Venue |
|---|---|---|
2004 | 10.1007/978-3-540-28645-5_10 | ADVANCES IN ARTIFICIAL INTELLIGENCE - SBIA 2004 |
Keywords | Field | DocType |
local search,vehicle routing problem,forward checking,constraint programming | Constraint satisfaction,Mathematical optimization,Vehicle routing problem,Computer science,Iterative method,Constraint programming,Look-ahead,Combinatorial optimization,Concurrent constraint logic programming,Local search (optimization) | Conference |
Volume | ISSN | Citations |
3171 | 0302-9743 | 6 |
PageRank | References | Authors |
0.56 | 14 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Carlos Castro | 1 | 255 | 29.05 |
| Michael Moossen | 2 | 6 | 0.90 |
| María Cristina Riff | 3 | 200 | 23.91 |