.png){kind=icon}
返回
A portable and scalable algorithm for a class of constrained combinatorial optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2004.03.020.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a portable and scalable approach for a class of constrained combinatorial optimization problems (CCOPs) which requires to satisfy a set of constraints and to optimize and objective function simultaneously. In particular, this paper is focused on the class of CCOPs that admits a representation in terms of a square matrix of constraints C. The algorithm consists of a hybrid neural-genetic algorithm, formed by a Hopfield Neural Network (HNN) which solves the problem's constraints, and a Genetic Algorithm (GA) for optimizing the objective function. This separated management of constraints and optimization procedures makes the proposed algorithm scalable and robust. The portability of the algorithm is given by the fact that the HNN dynamics depends only on the matrix C of constraints. We show these proper-ties of scalability and portability by solving three different CCOPs with our algorithm, the frequency assignment problem in a mobile telecommunications network, the reduction of the interference in satellite systems and the design of FPGAs with segmented channel routing architecture. We compare our results with previous approaches to these problems, obtaining very good results in all of them. (c) 2004 Elsevier Ltd. All rights reserved.
Keyword:
combinatorial optimization
genetic algorithms
hopfield neural networks
hybrid algorithms
scalability
portability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
Horizontal structures of bow-shaped mountain wave trains seen in thermal infrared images of venusian clouds taken by Akatsuki LIR.png)
Icarus
OAAI
IcarusIF0
OAAI分享收藏分享收藏
查看更多内容