A GRID-BASED MULTISTAGE ALGORITHM FOR PARAMETER SIMULATION-OPTIMIZATION OF COMPLEX SYSTEM

被引:0
|
作者
The-Nhan Ho [1 ]
Marilleau, Nicolas [2 ]
Philippe, Laurent [3 ]
Hong-Quang Nguyen [1 ]
Zucker, Jean-Daniel [2 ]
机构
[1] Vietnam Natl Univ, IFI, UMI UMMISCO 209, Hanoi, Vietnam
[2] UMMISCO, IRD, Inst Rech Pour Dev, UMI 209, Bondy, France
[3] Univ Franche Comte, FEMTO ST, UMR 6174, Besancon, France
来源
PROCEEDINGS OF 2013 IEEE RIVF INTERNATIONAL CONFERENCE ON COMPUTING AND COMMUNICATION TECHNOLOGIES: RESEARCH, INNOVATION, AND VISION FOR THE FUTURE (RIVF) | 2013年
关键词
parameter exploration; model optimization; high performance computing; SEARCH; MODELS;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Evolutionary algorithms (EA) are recently used to explore the parameter space of complex system simulations as the methodology sees models as black boxes. The first advantage is that these algorithms become independent from what kind of simulation has to be explored. The task is finding the parameter settings to optimize a given objective function. This optimization process evaluates the performance of possible parameter sets and converges towards the best alternatives. The evaluation needs to launch hundreds of thousands of simulation runs. This procedure copes with the combinatorial explosion of computation time and requires considerable computational resources. Furthermore, the original algorithms cannot guarantee the exploration in the search space uniformly and equally because the search is probabilistic. This work elaborates a multistage optimization process in a grid-enabled modeling and simulation platform. We propose a hybrid integration of various continuous optimization algorithms and optimize them for running with different Distributed Resource Management (DRM) systems. The performance of algorithm is compared to original algorithm in the optimization of Ants model.
引用
收藏
页码:221 / 226
页数:6
相关论文
共 50 条
  • [31] A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem
    Eshragh, Ali
    Filar, Jerzy A.
    Haythorpe, Michael
    ANNALS OF OPERATIONS RESEARCH, 2011, 189 (01) : 103 - 125
  • [32] A Grid-Based Density Peaks Clustering Algorithm
    Fang, Xintong
    Xu, Zhen
    Ji, Haifeng
    Wang, Baoliang
    Huang, Zhiyao
    IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2023, 19 (04) : 5476 - 5484
  • [33] GBHE: Grid-Based Cryptography with AES Algorithm
    Rad, Nima Behnood
    Shah-Hosseini, Hamed
    ICCEE 2008: PROCEEDINGS OF THE 2008 INTERNATIONAL CONFERENCE ON COMPUTER AND ELECTRICAL ENGINEERING, 2008, : 185 - 189
  • [34] Grid-based Algorithm in Data Distribution Management
    Wang, Huiru
    Ding, Jing
    2010 INTERNATIONAL CONFERENCE ON INFORMATION, ELECTRONIC AND COMPUTER SCIENCE, VOLS 1-3, 2010, : 1986 - +
  • [35] Grid-based DBSCAN Algorithm with Referential Parameters
    Huang Darong
    Wang Peng
    INTERNATIONAL CONFERENCE ON APPLIED PHYSICS AND INDUSTRIAL ENGINEERING 2012, PT B, 2012, 24 : 1166 - 1170
  • [36] The Study on Equifinality of Hydrological Model Parameters and Runoff Simulation Based on the Improved Simulation-optimization Algorithm
    Xing Z.
    Wang L.
    Wang X.
    Fu Q.
    Ji Y.
    Li H.
    Liu Y.
    Yingyong Jichu yu Gongcheng Kexue Xuebao/Journal of Basic Science and Engineering, 2020, 28 (05): : 1091 - 1107
  • [37] GRID-BASED EXPLORATION OF COSMOLOGICAL PARAMETER SPACE WITH SNAKE
    Mikkelsen, K.
    Nss, S. K.
    Eriksen, H. K.
    ASTROPHYSICAL JOURNAL, 2013, 777 (02):
  • [38] Grid-based Task Scheduling PMTS Algorithm
    Qiu, Jianlin
    Chen, Li
    Chen, Jianping
    Gu, Xiang
    Chen, Yanyun
    FRONTIERS OF MANUFACTURING AND DESIGN SCIENCE II, PTS 1-6, 2012, 121-126 : 4491 - 4497
  • [39] A fast consistent grid-based clustering algorithm
    Tarasenko, Anton S.
    Berikov, Vladimir B.
    Pestunov, Igor A.
    Rylov, Sergey A.
    Ruzankin, Pavel S.
    PATTERN ANALYSIS AND APPLICATIONS, 2024, 27 (04)
  • [40] On the convergence of grid-based methods for unconstrained optimization
    Coope, ID
    Price, CJ
    SIAM JOURNAL ON OPTIMIZATION, 2001, 11 (04) : 859 - 869