The double-assignment method for the exponential chaotic tabu search in quadratic assignment problems

• Shibata Kazuaki

  Graduate of School of Engineering, Tokyo Denki University

• Horio Yoshihiko

  Graduate of School of Engineering, Tokyo Denki University

• Aihara Kazuyuki

  Institute of Industrial Science, The University of Tokyo

Abstract

The quadratic assignment problem (QAP) is one of the NP-hard combinatorial optimization problems. An exponential chaotic tabu search using a 2-opt algorithm driven by chaotic neuro-dynamics has been proposed as one heuristic method for solving QAPs. In this paper we first propose a new local search, the double-assignment method, suitable for the exponential chaotic tabu search, which adopts features of the Lin-Kernighan algorithm. We then introduce chaotic neuro-dynamics into the double-assignment method to propose a novel exponential chaotic tabu search. We further improve the proposed exponential chaotic tabu search with the double-assignment method by enhancing the effect of chaotic neuro-dynamics.

Journal

• Nonlinear Theory and Its Applications, IEICE

  Nonlinear Theory and Its Applications, IEICE 2 (4), 472-484, 2011

  The Institute of Electronics, Information and Communication Engineers

Keywords

• double-assignment method
• exponential chaotic tabu search
• chaotic neural network
• quadratic assignment problem
• Lin-Kernighan algorithm

Details

• CRID: 1390282680322962432
• NII Article ID: 130001225017
• DOI: 10.1587/nolta.2.472
• ISSN: 21854106
• Web Site: https://www.jstage.jst.go.jp/article/nolta/2/4/2_4_472/_pdf
• Text Lang: en
• Data Source:
  • JaLC
  • Crossref
  • CiNii Articles
• Abstract License Flag: Disallowed