文献
J-GLOBAL ID:202202266619633226
整理番号:22A1115587
連結性問題のための多車両賞収集アークルーティングのための欲張りランダム化適応探索手順(GRASP)【JST・京大機械翻訳】
A Greedy Randomized Adaptive Search Procedure (GRASP) for the multi-vehicle prize collecting arc routing for connectivity problem
著者 (4件):
Souza Almeida Luana
(Dalhousie University, Department of Industrial Engineering, Maritime Risk and Safety (MARS) Group, 5269 Morris Street, Halifax, Nova Scotia, B3H 4R2, Canada)
,
Goerlandt Floris
(Dalhousie University, Department of Industrial Engineering, Maritime Risk and Safety (MARS) Group, 5269 Morris Street, Halifax, Nova Scotia, B3H 4R2, Canada)
,
Pelot Ronald
(Dalhousie University, Department of Industrial Engineering, Maritime Risk and Safety (MARS) Group, 5269 Morris Street, Halifax, Nova Scotia, B3H 4R2, Canada)
,
Sorensen Kenneth
(University of Antwerp, Department of Engineering Management, ANT/OR - Operations Research Group, Prinsstraat 13, 2000 Antwerp, Belgium)
資料名:
Computers & Operations Research
(Computers & Operations Research)
巻:
143
ページ:
Null
発行年:
2022年
JST資料番号:
H0216B
ISSN:
0305-0548
CODEN:
CMORAP
資料種別:
逐次刊行物 (A)
記事区分:
原著論文
発行国:
オランダ (NLD)
言語:
英語 (EN)