Evolutional solutions by using PSO for 0-1 combinatorial optimization problems with constraints

Naoaki Ogawa, Eitaro Aiyoshi

研究成果: Article査読

抄録

In this paper, as one of global optimization methods for 0-1 combinatorial optimization problems with constraints, a continuous relaxation approach is presented, in which the continuous variables are transformed into binary variables through a sorting procedure of continuous variables taking the constraints into consideration. The new type of relaxation approach enables us to apply Particle Swarm Optimization, which is effective heuristic method for global optimization with continuous variables. Here, our presented approach is interpreted as one of evolutional computing methods because the transformation of continuous variables into binary ones corresponds to transform genotype into phenotype, which is reverse to a relation in usual evolutional computing.

本文言語English
ページ(範囲)1136-1143
ページ数8
ジャーナルIEEJ Transactions on Electronics, Information and Systems
132
7
DOI
出版ステータスPublished - 2012

ASJC Scopus subject areas

  • 電子工学および電気工学

フィンガープリント

「Evolutional solutions by using PSO for 0-1 combinatorial optimization problems with constraints」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル