Integer and combinatorial optimization
Integer and combinatorial optimization
Exploiting Similarity for Supporting Data Analysis and Problem Solving
IDA '99 Proceedings of the Third International Symposium on Advances in Intelligent Data Analysis
| Hi-index | 0.00 |
This paper presents numerical results from the application of acase-based reasoning approach to several repetitive operationsresearch problems. These experiments are applications of the ideaspresented in the previous framework paper, Part I. The threecombinatorial optimization problems explored in this paper are theknapsack problem, the travelling salesman problem and theuncapacitated plant location problem. These numerical experimentspermit a comparison of the performance of this technique across thesethree problem classes as well as with the traditional solutionalgorithms.