Case-based reasoning for repetitive combinatorial optimization problems, Part II: Numerical results

This paper presents numerical results from the application of a case-based reasoning approach to several repetitive operations research problems. These experiments are applications of the ideas presented in the previous framework paper, Part 1. The three combinatorial optimization problems explored in this paper are the knapsack problem, the travelling salesman problem and the uncapacitated plant location problem. These numerical experiments permit a comparison of the performance of this technique across these three problem classes as well as with the traditional solution algorithms.