返回
Multi-objective retrospective optimization using stochastic zigzag search
DOI:10.1016/j.ejor.2017.06.039.png)
摘要
En 中文
We propose a new retrospective optimization (RO) method for multi-objective simulation optimization (MOSO) problems. RO algorithms generate a sequence of sample-path (SP) problems and solve these SP problems iteratively using a nonlinear optimizer. In this study, a stochastic zigzag search algorithm is chosen in the RO framework to solve SP problems. The key idea of zigzag search is searching around the Pareto front by applying an efficient local-search procedure using the gradients of the objective functions. Many continuous MOSO problems have smooth objective functions and their non-dominated objective function values form a smooth surface in the image space. This fact motivates developing the zigzag search method embedded in RO for such relatively well-posed MOSO problems. A numerical implementation of this method multi-objective retrospective optimization using zigzag search (MOROZS) is presented particularly for continuous bi-objective simulation optimization (BOSO) problems with well-connected Pareto optimal solutions. MOROZS is designed for BOSO problems in which a simulation oracle returns both objective function values and gradients. Due to the local nature of zigzag search, MOROZS- can only guarantee the asymptotic convergence to local Pareto optimality. The efficiency of MOROZS is studied using three BOSO problems with noisy objective functions and is compared to that of Genetic Algorithms based NSGA-II and a recently developed method MO-COMPASS. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Multiple criteria decision
Pareto optimum
Gradient local search
Stochastic optimization
Simulation
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
Using the Averaged Hausdorff Distance as a Performance Measure in Evolutionary Multiobjective Optimization在进化多目标优化中使用平均Hausdorff距离作为性能度量

