Ｐａｒｔｉｃｌｅ　Ｓｗａｒｍ　Ｏｐｔｉｍｉｚａｔｉｏｎによる混合整数計画問題の一解法

DOI DOI Web Site Web Site Web Site ほか2件をすべて表示 一部だけ表示 被引用文献12件 参考文献36件 オープンアクセス

書誌事項

タイトル別名
  • A Method for Mixed Integer Programming Problems by Particle Swarm Optimization
  • Particle Swarm Optimization ニ ヨル コンゴウ セイスウ ケイカク モンダイ ノ イチカイホウ

この論文をさがす

説明

Particle Swarm Optimization (PSO) for mixed integer programming problems is proposed. PSO is mainly a method to find a global or quasi-minimum for a nonlinear and non-convex optimization problem, and few researches about optimization problems with discrete decision variables have been studied. In this paper, we present the treatment of discrete decision variables. To treat discrete decision variables as a penalty function, it is possible to treat all decision variables as a continuous decision variable. As a result, the penalty parameter for the penalty function is needed. In this paper, we also present how to determine the penalty parameter for the penalty function. Through mathematical and structural optimization problems, we examine the validity of PSO for the mixed decision variables.

収録刊行物

被引用文献 (12)*注記

もっと見る

参考文献 (36)*注記

もっと見る

関連プロジェクト

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ