Tackling the Subset Sum Problem with Fixed Size using an Integer Representation Scheme

Victor Parque*

*この研究の対応する著者

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

Addressing the subset sum problem is relevant to study resource management problems efficiently. In this paper, we study a new scheme to sample solutions for the subset sum problem based on swarm-based optimization algorithms with distinct forms of selection pressure, the balance of exploration-exploitation, the multimodality considerations, and a search space defined by numbers associated with subsets of fixed size. Our experiments show that it is feasible to find optimal subsets with few number of fitness evaluations, and that Particle Swarm Optimization with Fitness Euclidean Ratio converges faster to the global optima with zero variability over independent runs. Since the search space is one-dimensional and friendly to parallelization schemes, our work is potential to study further classes of combinatorial problems using swarm-based optimization algorithms and the representation based on numbers.

本文言語English
ホスト出版物のタイトル2021 IEEE Congress on Evolutionary Computation, CEC 2021 - Proceedings
出版社Institute of Electrical and Electronics Engineers Inc.
ページ1447-1453
ページ数7
ISBN(電子版)9781728183923
DOI
出版ステータスPublished - 2021
イベント2021 IEEE Congress on Evolutionary Computation, CEC 2021 - Virtual, Krakow, Poland
継続期間: 2021 6月 282021 7月 1

出版物シリーズ

名前2021 IEEE Congress on Evolutionary Computation, CEC 2021 - Proceedings

Conference

Conference2021 IEEE Congress on Evolutionary Computation, CEC 2021
国/地域Poland
CityVirtual, Krakow
Period21/6/2821/7/1

ASJC Scopus subject areas

  • モデリングとシミュレーション
  • 計算数学

フィンガープリント

「Tackling the Subset Sum Problem with Fixed Size using an Integer Representation Scheme」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル