Embedding Ordinal Optimization into Tree–Seed Algorithm for Solving the Probabilistic Constrained Simulation Optimization Problems

Shih-Cheng Horng,Shieh-Shing Lin

doi:10.3390/app8112153

Shih-Cheng Horng, Shieh-Shing Lin

Open Access

https://doi.org/10.3390/app8112153

Copy DOI

Abstract

Probabilistic constrained simulation optimization problems (PCSOP) are concerned with allocating limited resources to achieve a stochastic objective function subject to a probabilistic inequality constraint. The PCSOP are NP-hard problems whose goal is to find optimal solutions using simulation in a large search space. An efficient “Ordinal Optimization (OO)” theory has been utilized to solve NP-hard problems for determining an outstanding solution in a reasonable amount of time. OO theory to solve NP-hard problems is an effective method, but the probabilistic inequality constraint will greatly decrease the effectiveness and efficiency. In this work, a method that embeds ordinal optimization (OO) into tree–seed algorithm (TSA) (OOTSA) is firstly proposed for solving the PCSOP. The OOTSA method consists of three modules: surrogate model, exploration and exploitation. Then, the proposed OOTSA approach is applied to minimize the expected lead time of semi-finished products in a pull-type production system, which is formulated as a PCSOP that comprises a well-defined search space. Test results obtained by the OOTSA are compared with the results obtained by three heuristic approaches. Simulation results demonstrate that the OOTSA method yields an outstanding solution of much higher computing efficiency with much higher quality than three heuristic approaches.

Highlights

The probabilistic constrained simulation optimization problems (PCSOP) are concerned with allocating limited resources to achieve a stochastic objective function subject to a probabilistic inequality constraint
The first contribution of this paper is to propose an OOTSA approach for a general PCSOP that is lack of structural information to determine a near-optimal solution in a short computational time
The second one is a large problem with four products and 12

Summary

Introduction

The probabilistic constrained simulation optimization problems (PCSOP) are concerned with allocating limited resources to achieve a stochastic objective function subject to a probabilistic inequality constraint. The performance of the PCSOP is evaluated by simulations, which may be a complex evaluation in a real-world physical system or a simple computer based mathematical model [1]. Such problems occur in almost all fields of automatic production, such as the network type flow line production system, buffer resource allocation, periodic review inventory system, as well as many industrial managements, including facility-sizing of factory and strategic location of semi-finished products in a pull-type production system. The large search space makes the considered problem more

Objectives

Results

Conclusion