Optimization via simulation using Gaussian process-based search

  • Authors:

  • Lihua Sun;L. Jeff Hong;Zhaolin Hu

  • Affiliations:

  • Tongji University, Shanghai, China;The Hong Kong University of Science and Technology, Hong Kong, China;Tongji University, Shanghai, China

  • Venue:
  • Proceedings of the Winter Simulation Conference
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Random search algorithms are often used to solve optimization-via-simulation (OvS) problems. The most critical component of a random search algorithm is the sampling distribution that is used to guide the allocation of the search effort. A good sampling distribution can balance the tradeoff between the effort used in searching around the current best solution (which is called exploitation) and the effort used in searching largely unknown regions (which is called exploration). However, most of the random search algorithms for OvS problems have difficulties in balancing this tradeoff in a seamless way. In this paper we propose a new random search algorithm, called the Gaussian Process-based Search (GPS) algorithm, which derives a sampling distribution from a fast fitted Gaussian process in each iteration of the algorithm. We show that the sampling distribution has the desired properties and it can automatically balance the exploitation and exploration tradeoff.