Comparing the Finite-Time Performance of Simulation-Optimization Algorithms

2017/05/22 by Naijia Anna Dong, David J. Eckman, Dong, Naijia +7
Computer Science · Decision Sciences · #Advanced Database Systems and Queries #Advanced Multi-Objective Optimization Algorithms #FOS: Computer and information sciences #FOS: Mathematics #Optimization and Control (math.OC) #Other Statistics (stat.OT) #Simulation Techniques and Applications

paper · pdf · doi:10.48550/arxiv.1705.07825

openalex publication_date 2017/05/22 · openalex created_date 2017/06/05 · openalex updated_date 2026/07/28

Abstract

We empirically evaluate the finite-time performance of several simulation-optimization algorithms on a testbed of problems with the goal of motivating further development of algorithms with strong finite-time performance. We investigate if the observed performance of the algorithms can be explained by properties of the problems, e.g., the number of decision variables, the topology of the objective function, or the magnitude of the simulation error.

Citations

• Benchmarking optimization software with performance profiles
• A Simplex Method for Function Minimization

Related

• Simulated Annealing: Rigorous finite-time guarantees for optimization on continuous domains
• Review of Large-Scale Simulation Optimization
• Efficient Computing Budget Allocation for Simulation-based Optimization with Stochastic Simulation Time
• Joint Optimization and Statistical Inference for Zero-th Order Simulation Optimization
• Surrogate-Based Simulation Optimization