Kazuaki Masuda

Solution to combinatorial problems by using chaotic global optimization method on a simplex

The discretized maps of gradient models with Eulers method generate chaos, which can be used for global optimization by applying the chaotic annealing. In this paper, we apply this approach to solve the traveling salesman problem. We formulate it as continuous optimization problems with particular constraints, and newly derive. gradient projection dynamics whose discretized maps generate chaos on a simplex.

Global optimization method using chaos of discrete gradient dynamics

Abstract In this paper, we propose another method for continuous global optimization which makes use of the chaotic property of discrete gradient models as nonlinear dynamical systems. The deterministic randomness generated in chaotic phase improves the global searching ability of the gradient dynamics. Besides, the global optimizer can be found at high accuracy and ef ciency by applying the modi ed fichaotic annealing algorithmfl by us to the discrete gradient dynamics.