Presentation 2013-10-28
Discrete Firefly Algorithm Using Familiarity Degree and Its Application to QAP
Mami ISHIKAWA, Haruna MATSUSHITA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This study modifies Discrete Firefly Algorithm (DFA) and proposes a DFA using Familiarity Degree (FDFA).We apply FDFA to various Quadratic Assignment Problems (QAPs),which are well-known discrete optimization problems, and confirm the effectiveness of FDFA.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) familiarity degree / Discrete Firefly Algorithm / QAP
Paper # NLP2013-89
Date of Issue

Conference Information
Committee NLP
Conference Date 2013/10/21(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 Nonlinear Problems (NLP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Discrete Firefly Algorithm Using Familiarity Degree and Its Application to QAP
Sub Title (in English)
Keyword(1) familiarity degree
Keyword(2) Discrete Firefly Algorithm
Keyword(3) QAP
1st Author's Name Mami ISHIKAWA
1st Author's Affiliation Dept. of Reliability-based Information Systems Engineering, Kagawa University()
2nd Author's Name Haruna MATSUSHITA
2nd Author's Affiliation Dept. of Reliability-based Information Systems Engineering, Kagawa University
Date 2013-10-28
Paper # NLP2013-89
Volume (vol) vol.113
Number (no) 271
Page pp.pp.-
#Pages 4
Date of Issue