文献
J-GLOBAL ID:202102254462928032
整理番号:21A2956391
多次元ナップサック問題のための自己学習に基づくバイナリーガ探索アルゴリズム【JST・京大機械翻訳】
A binary moth search algorithm based on self-learning for multidimensional knapsack problems
著者 (6件):
Feng Yanhong
(School of Information Engineering, Hebei GEO University, Shijiazhuang, 050031, China)
,
Feng Yanhong
(Intelligent Sensor Network Engineering Research Center of Hebei Province, Hebei GEO University, Shijiazhuang, 050031, China)
,
Feng Yanhong
(Hebei Center for Ecological and Environmental Geology Research, Hebei GEO University, Shijiazhuang 050031, China)
,
Wang Gai-Ge
(Department of Computer Science and Technology, Ocean University of China, 266100 Qingdao, China)
,
Wang Gai-Ge
(College of Information Technology, Jilin Agricultural University, Changchun 130118, China)
,
Wang Gai-Ge
(Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun, 130012, China)
資料名:
Future Generation Computer Systems
(Future Generation Computer Systems)
巻:
126
ページ:
48-64
発行年:
2022年
JST資料番号:
A0620C
ISSN:
0167-739X
資料種別:
逐次刊行物 (A)
記事区分:
原著論文
発行国:
オランダ (NLD)
言語:
英語 (EN)