抄録
Continuous-valued Hopfield neural network (CHN) is a popular method of metaheuristics. However, it is not guaranteed that obtained solutions by CHN are always feasible. To obtain a high-quality feasible solution, appropriate penalty parameters of CHN are required. Matsuda has shown the theoretical relationship between penalty parameters and the qualities of obtained solutions of CHN for traveling salesman problem (TSP) In this paper, we show the similar theoretical relationship of CHN for the quadratic assignment problem (QAP) and the limitation of CHP. On other hand, K. Smith et al. proposed the projection method to obtain a high-quality feasible solution, which projects modified solution onto two constraints, by turns. Thus, this method is not efficient and does not necessarily find a feasible solution at each iteration. Therefore, in this paper, we propose new method whith the projection of modified solution onto the entire feasible region at once. Moreover, we show convergence properties of a proposed method and the conditions of penalty parameters which guarantees that CHN for QAP always finds the feasible solution. Finally, we verify the efficiency of the methods through numerical experiments.
