A case based approach for an intelligent route optimization technology
Masaki Suzuki, Taro Matsumaru, Setsuo Tsuruta, Rainer Knauf, Takaaki Motomura, Yoshitaka Sakurai · 2014
The paper introduces a Case Based Approximation method to solve large scale Traveling Salesman Problems in a short time with a low error rate. It is useful for domains with most solutions being similar to solutions that have been created. Thus, a solution can be derived by (1) selecting a most similar TSP from a library of former TSP solutions, (2) removing the locations that are not part of the current TSP and (3) adding the missing locations of the current TSP by mutation, namely Nearest Insertion (NI). This way of creating solutions by Case Based Reasoning (CBR) avoids the computational costs to create new solutions from scratch.