Presentation 2010-08-02
Slide-and-Insert Assignment Method with Chaotic Dynamics for Quadratic Assignment Problems
Yusuke SAKAMOTO, Yoshihiko HORIO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A quadratic assignment problem (QAP) is an NP-hard combinatorial optimization problem. Some heuristic algorithms for the QAPs are proposed in order to find the sub-optimum solutions efficiently. In this paper, we propose a novel heuristic algorithm for the QAPs. The proposed method introduces a slide-and-insert operation for the assignments of the elements in the QAP. Furthermore, we improve the proposed algorithm by combining it with the 2-opt algorithm. We use random numbers and chaotic dynamics in the slide-and-insert assignment method. Numerical simulation results, which compare the solving performance of the proposed algorithms with the random numbers and the chaotic dynamics, are shown.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) slide-and-insert assignment method / quadratic assignment problem / chaotic neural network
Paper # CAS2010-35,NLP2010-51
Date of Issue

Conference Information
Committee CAS
Conference Date 2010/7/26(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Circuits and Systems (CAS)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Slide-and-Insert Assignment Method with Chaotic Dynamics for Quadratic Assignment Problems
Sub Title (in English)
Keyword(1) slide-and-insert assignment method
Keyword(2) quadratic assignment problem
Keyword(3) chaotic neural network
1st Author's Name Yusuke SAKAMOTO
1st Author's Affiliation Graduate School of Engineering, Tokyo Denki University()
2nd Author's Name Yoshihiko HORIO
2nd Author's Affiliation Graduate School of Engineering, Tokyo Denki University
Date 2010-08-02
Paper # CAS2010-35,NLP2010-51
Volume (vol) vol.110
Number (no) 165
Page pp.pp.-
#Pages 6
Date of Issue