Sciweavers

4 search results - page 1 / 1
» On the use of CBR in optimisation problems such as the TSP
Sort
View
ICCBR
1995
Springer
13 years 8 months ago
On the use of CBR in optimisation problems such as the TSP
The particular strength of CBR is normally considered to be its use in weak theory domains where solution quality is compiled into cases and is reusable. In this paper we explore a...
Padraig Cunningham, Barry Smyth, Neil J. Hurley
ICTAI
2000
IEEE
13 years 9 months ago
Self-optimising CBR retrieval
One reason why Case-Based Reasoning (CBR) has become popular is because it reduces development cost compared to rule-based expert systems. Still, the knowledge engineering effort ...
Jacek Jarmulak, Susan Craw, Ray Rowe
COR
2008
95views more  COR 2008»
13 years 5 months ago
Good triangulations yield good tours
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
Adam N. Letchford, Nicholas A. Pearson
CEC
2008
IEEE
13 years 11 months ago
Evolutionary Multi-objective Simulated Annealing with adaptive and competitive search direction
— In this paper, we propose a population-based implementation of simulated annealing to tackle multi-objective optimisation problems, in particular those of combinatorial nature....
Hui Li, Dario Landa Silva