Efficient Multi-Objective Simulation Metamodeling for Researchers

Ho, Ken Jom; Özcan, Ender; Siebers, Peer-Olaf

Abstract

Solving multiple objective optimization problems can be computationally intensive even when experiments can be performed with the help of a simulation model. There are many methodologies that can achieve good tradeoffs between solution quality and resource use. One possibility is using an intermediate “model of a model” (metamodel) built on experimental responses from the underlying simulation model and an optimization heuristic that leverages the metamodel to explore the input space more efficiently. However, determining the best metamodel and optimizer pairing for a specific problem is not directly obvious from the problem itself, and not all domains have experimental answers to this conundrum. This paper introduces a discrete multiple objective simulation metamodeling and optimization methodology that allows algorithmic testing and evaluation of four Metamodel-Optimizer (MO) pairs for different problems. For running our experiments, we have implemented a test environment in R and tested four different MO pairs on four different problem scenarios in the Operations Research domain. The results of our experiments suggest that patterns of relative performance between the four MO pairs tested differ in terms of computational time costs for the four problems studied. With additional integration of problems, metamodels and optimizers, the opportunity to identify ex ante the best MO pair to employ for a general problem can lead to a more profitable use of metamodel optimization.

Citation

Ho, K. J., Özcan, E., & Siebers, P.-O. (2024). Efficient Multi-Objective Simulation Metamodeling for Researchers. Algorithms, 17(1), Article 41. https://doi.org/10.3390/a17010041

• Journal Article Type: Article
• Acceptance Date: Jan 15, 2024
• Online Publication Date: Jan 18, 2024
• Publication Date: 2024-01
• Deposit Date: Mar 7, 2025
• Publicly Available Date: Mar 13, 2025
• Journal: Algorithms
• Electronic ISSN: 1999-4893
• Publisher: MDPI
• Peer Reviewed: Peer Reviewed
• Volume: 17
• Issue: 1
• Article Number: 41
• DOI: https://doi.org/10.3390/a17010041
• Keywords: Computational Mathematics; Computational Theory and Mathematics; Numerical Analysis; Theoretical Computer Science
• Public URL: https://nottingham-repository.worktribe.com/output/29842117
• Publisher URL: https://www.mdpi.com/1999-4893/17/1/41