A Hybrid Algorithm for Stochastic Multiobjective Programming Problem

The traditional approach in the solution of stochastic multiobjective programming problem involves transforming the original problem into a deterministic multiobjective programming problem. However, due to the complexity in practical application problems, the closed form of stochastic multiobjective programming problem is usually hard to obtain, and yet, there is surprisingly little literature that addresses this problem. The principal purpose of this paper is to propose a new hybrid algorithm to solve stochastic multiobjective programming problem efficiently, which is integrated with Latin Hypercube Sampling, Monte Carlo simulation, Support Vector Regression and Artificial Bee Colony algorithm. Several numerical examples are presented to illustrate the validity and performance of the hybrid algorithm. The results suggest that the proposed algorithm is very suitable for solving stochastic multiobjective programming problem.

[1]  Seungjae Lee,et al.  Stochastic multi-objective models for network design problem , 2010, Expert Syst. Appl..

[2]  Kaisa Miettinen,et al.  Nonlinear multiobjective optimization , 1998, International series in operations research and management science.

[3]  Alexander J. Smola,et al.  Support Vector Regression Machines , 1996, NIPS.

[4]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

[5]  M. D. McKay,et al.  A comparison of three methods for selecting values of input variables in the analysis of output from a computer code , 2000 .

[6]  Chih-Jen Lin,et al.  LIBSVM: A library for support vector machines , 2011, TIST.

[7]  Dervis Karaboga,et al.  A comparative study of Artificial Bee Colony algorithm , 2009, Appl. Math. Comput..

[8]  Dervis Karaboga,et al.  AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .

[9]  Ying Wang,et al.  Uncertain multiobjective traveling salesman problem , 2015, Eur. J. Oper. Res..

[10]  Emam Tarek.  METHOD OF CENTERS ALGORITHM FOR MULTI-OBJECTIVE PROGRAMMING PROBLEMS , 2009 .

[11]  Alexander J. Smola,et al.  Support Vector Method for Function Approximation, Regression Estimation and Signal Processing , 1996, NIPS.

[12]  Melih Özlen,et al.  Multi-objective integer programming: A general approach for generating all non-dominated solutions , 2009, Eur. J. Oper. Res..

[13]  Philippe Lacomme,et al.  A memetic algorithm for a bi-objective and stochastic CARP , 2005 .

[14]  Thomas Stützle,et al.  Design and analysis of stochastic local search for the multiobjective traveling salesman problem , 2009, Comput. Oper. Res..

[15]  M. Stein.  Large sample properties of simulations using latin hypercube sampling , 1987 .

[16]  Zutong Wang,et al.  Uncertain multiobjective redundancy allocation problem of repairable systems based on artificial bee colony algorithm , 2014 .

[17]  Baoding Liu,et al.  New stochastic models for capacitated location-allocation problem , 2003, Comput. Ind. Eng..

[18]  Baoding Liu,et al.  Stochastic programming models for general redundancy-optimization problems , 2003, IEEE Trans. Reliab..

[19]  Graham Ault,et al.  Multi-objective planning of distributed energy resources: A review of the state-of-the-art , 2010 .

[20]  M. Eldred,et al.  The promise and peril of uncertainty quantification using response surface approximations , 2005 .