抄録
In this paper, we will develop a new type of adaptive range genetic algorithms (ARange GAs) for scheduling problem. Within the scheduling problem, we wifl treat so called traveling salesman problems. These problems are very classic type of the problem but it is very important in bringing the product to the customers especially in the industry like daily use products. In TSP problem, GAs has been successfully used and its effectiveness is so well known. However, we need exhaustive computational time to obtain global optimum solution. Which means that it is only effective in some small case of the problem. In order to overcome such situation, we use the essence of ARange GAs that has been effectively developed for mixed valuable case. We applied the proposed method in some problem and showed the effectiveness of the method.
