Year: 2019
Type: article
Abstract: The Steiner tree problem in graphs is an NP-hard combinatorial optimization problem. To solve the NP-hard combinatorial optimization problems, such as the traveling salesman problems, the quadratic assignment problems, and the vehicle routing problems, an algorithm for searching solutions by chaotic dynamics, or the chaotic search, exhibits good performance. From this viewpoint, this paper proposes an algorithm for solving the Steiner tree problem in graphs with chaotic dynamics. Comparing the performance of the chaotic search with that of the tabu search, we analyze the searching characteristics of the chaotic search. From the results of numerical experiments, we found that if parameters of the chaotic search are set to appropriate values, the chaotic search exhibits good performance and the chaotic search outputs optimal solutions more frequently than the tabu search during the searching processes, which implies that the chaotic search has higher ability than the tabu search as metaheuristics.
DOI: 10.1587/nolta.11.90
Authors: Misa Fujita, Takayuki Kimura, Tohru Ikeguchi
Institutions: Tokyo University of Science, Nippon Institute of Technology
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
Awards: Network Dynamical System Theory and its Application to Big Data analysis, A Routing Method Using Nonlinear Dynamical Theory for Large-scale Ride-share Systems, A Routing Method Using Deterministic Chaos for Large-scale Communication Network Models, Solving the Steiner tree problem in graphs using the chaotic neural network
OpenAlex ID: W2996973883