Abstract

The stochastic inequality constrained optimization problems (SICOPs) consider the problems of optimizing an objective function involving stochastic inequality constraints. The SICOPs belong to a category of NP-hard problems in terms of computational complexity. The ordinal optimization (OO) method offers an efficient framework for solving NP-hard problems. Even though the OO method is helpful to solve NP-hard problems, the stochastic inequality constraints will drastically reduce the efficiency and competitiveness. In this paper, a heuristic method coupling elephant herding optimization (EHO) with ordinal optimization (OO), abbreviated as EHOO, is presented to solve the SICOPs with large solution space. The EHOO approach has three parts, which are metamodel construction, diversification and intensification. First, the regularized minimal-energy tensor-product splines is adopted as a metamodel to approximately evaluate fitness of a solution. Next, an improved elephant herding optimization is developed to find N significant solutions from the entire solution space. Finally, an accelerated optimal computing budget allocation is utilized to select a superb solution from the N significant solutions. The EHOO approach is tested on a one-period multi-skill call center for minimizing the staffing cost, which is formulated as a SICOP. Simulation results obtained by the EHOO are compared with three optimization methods. Experimental results demonstrate that the EHOO approach obtains a superb solution of higher quality as well as a higher computational efficiency than three optimization methods.

Highlights

  • The stochastic inequality constrained optimization problems (SICOPs) consider the problems of optimizing an objective function with respect to some variables in the presence of stochastic inequality constraints on those variables

  • The target of SICOPs is to search for the optimal settings of a complex system whose objective function that needs to be optimized subject to the stochastic inequality constraints

  • The SICOPs belong to a category of NP-hard problems [2], which are a type of optimization problem for which most likely no polynomial algorithm can be devised

Read more

Summary

Introduction

The stochastic inequality constrained optimization problems (SICOPs) consider the problems of optimizing an objective function with respect to some variables in the presence of stochastic inequality constraints on those variables. An accelerated optimal computing budget allocation (AOCBA) is utilized to choose a superb solution from the N significant solutions These three parts significantly reduce the computational effort required to solve SICOPs. Subsequently, the problem of staffing optimization in a one-period multi-skill call center is formulated as a SICOP that contains a large solution space. The first one is to develop an EHOO method to find a superb solution in an acceptable time for a SICOP which is lack of structural information Both of IEHO and AOCBA are novel approaches to improve the performance of the original EHO and OCBA, respectively. The third one is to apply the EHOO method for solving the SICOPs in the staffing optimization of a one-period multi-skill call center.

Mathematical Formulation
Difficulty of the Problem
Solution Method
Metamodel Construction
Framework
Diversification
Intensification
The EHOO Approach
A One-Period Multi-Skill Call Center
Problem Statement
Mathematical
Apply the IEHO Associated with the Metamodel
Obtain the Superb Solution
Simulation Examples and Test Results
Comparisons
Comparison ofapproaches the average over best-so-far objective values
Conclusions
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.