λ-Opt neural approaches to quadratic assignment problems

Shin Ishii, Hirotaka Niitsuma

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In this article, we propose new analog neural approaches to combinatorial optimization problems, in particular, quadratic assignment problems (QAPs). Our proposed methods are based on an analog version of the λ-opt heuristics, which simultaneously changes assignments for λ elements in a permutation. Since we can take a relatively large λ value, our new methods can achieve a middle-range search over possible solutions, and this helps the system neglect shallow local minima and escape from local minima. In experiments, we have applied our methods to relatively large-scale (N = 80-150) QAPs. Results have shown that our new methods are comparable to the present champion algorithms; for two benchmark problems, they are obtain better solutions than the previous champion algorithms.

Original languageEnglish
Pages (from-to)2209-2225
Number of pages17
JournalNeural Computation
Volume12
Issue number9
Publication statusPublished - Sep 2000
Externally publishedYes

Fingerprint

Combinatorial optimization
Benchmarking
Experiments
Assignment
Champions
Neglect
Benchmark
Heuristics
Experiment

ASJC Scopus subject areas

  • Artificial Intelligence
  • Control and Systems Engineering
  • Neuroscience(all)

Cite this

Ishii, S., & Niitsuma, H. (2000). λ-Opt neural approaches to quadratic assignment problems. Neural Computation, 12(9), 2209-2225.

λ-Opt neural approaches to quadratic assignment problems. / Ishii, Shin; Niitsuma, Hirotaka.

In: Neural Computation, Vol. 12, No. 9, 09.2000, p. 2209-2225.

Research output: Contribution to journalArticle

Ishii, S & Niitsuma, H 2000, 'λ-Opt neural approaches to quadratic assignment problems', Neural Computation, vol. 12, no. 9, pp. 2209-2225.
Ishii S, Niitsuma H. λ-Opt neural approaches to quadratic assignment problems. Neural Computation. 2000 Sep;12(9):2209-2225.
Ishii, Shin ; Niitsuma, Hirotaka. / λ-Opt neural approaches to quadratic assignment problems. In: Neural Computation. 2000 ; Vol. 12, No. 9. pp. 2209-2225.
@article{6dd55b370875415fac87e329693f87e5,
title = "λ-Opt neural approaches to quadratic assignment problems",
abstract = "In this article, we propose new analog neural approaches to combinatorial optimization problems, in particular, quadratic assignment problems (QAPs). Our proposed methods are based on an analog version of the λ-opt heuristics, which simultaneously changes assignments for λ elements in a permutation. Since we can take a relatively large λ value, our new methods can achieve a middle-range search over possible solutions, and this helps the system neglect shallow local minima and escape from local minima. In experiments, we have applied our methods to relatively large-scale (N = 80-150) QAPs. Results have shown that our new methods are comparable to the present champion algorithms; for two benchmark problems, they are obtain better solutions than the previous champion algorithms.",
author = "Shin Ishii and Hirotaka Niitsuma",
year = "2000",
month = "9",
language = "English",
volume = "12",
pages = "2209--2225",
journal = "Neural Computation",
issn = "0899-7667",
publisher = "MIT Press Journals",
number = "9",

}

TY - JOUR

T1 - λ-Opt neural approaches to quadratic assignment problems

AU - Ishii, Shin

AU - Niitsuma, Hirotaka

PY - 2000/9

Y1 - 2000/9

N2 - In this article, we propose new analog neural approaches to combinatorial optimization problems, in particular, quadratic assignment problems (QAPs). Our proposed methods are based on an analog version of the λ-opt heuristics, which simultaneously changes assignments for λ elements in a permutation. Since we can take a relatively large λ value, our new methods can achieve a middle-range search over possible solutions, and this helps the system neglect shallow local minima and escape from local minima. In experiments, we have applied our methods to relatively large-scale (N = 80-150) QAPs. Results have shown that our new methods are comparable to the present champion algorithms; for two benchmark problems, they are obtain better solutions than the previous champion algorithms.

AB - In this article, we propose new analog neural approaches to combinatorial optimization problems, in particular, quadratic assignment problems (QAPs). Our proposed methods are based on an analog version of the λ-opt heuristics, which simultaneously changes assignments for λ elements in a permutation. Since we can take a relatively large λ value, our new methods can achieve a middle-range search over possible solutions, and this helps the system neglect shallow local minima and escape from local minima. In experiments, we have applied our methods to relatively large-scale (N = 80-150) QAPs. Results have shown that our new methods are comparable to the present champion algorithms; for two benchmark problems, they are obtain better solutions than the previous champion algorithms.

UR - http://www.scopus.com/inward/record.url?scp=0034267720&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034267720&partnerID=8YFLogxK

M3 - Article

C2 - 10976144

AN - SCOPUS:0034267720

VL - 12

SP - 2209

EP - 2225

JO - Neural Computation

JF - Neural Computation

SN - 0899-7667

IS - 9

ER -