A Partition-Based Random Search for Stochastic Constrained Optimization via Simulation

2017 ◽  
Vol 62 (2) ◽  
pp. 740-752 ◽  
Author(s):  
Siyang Gao ◽  
Weiwei Chen
Author(s):  
Dongkyu Sohn ◽  
◽  
Shingo Mabu ◽  
Kotaro Hirasawa ◽  
Jinglu Hu

This paper proposes Adaptive Random search with Intensification and Diversification combined with Genetic Algorithm (RasID-GA) for constrained optimization. In the previous work, we proposed RasID-GA which combines the best properties of RasID and Genetic Algorithm for unconstrained optimization problems. In general, it is very difficult to find an optimal solution for constrained optimization problems because their feasible solution space is very limited and they should consider the objective functions and constraint conditions. The conventional constrained optimization methods usually use penalty functions to solve given problems. But, it is generally recognized that the penalty function is hard to handle in terms of the balance between penalty functions and objective functions. In this paper, we propose a constrained optimization method using RasID-GA, which solves given problems without using penalty functions. The proposed method is tested and compared with Evolution Strategy with Stochastic Ranking using well-known 11 benchmark problems with constraints. From the Simulation results, RasID-GA can find an optimal solution or approximate solutions without using penalty functions.


CFA Digest ◽  
2012 ◽  
Vol 42 (3) ◽  
pp. 148-150
Author(s):  
Gregory G. Gocek

Sign in / Sign up

Export Citation Format

Share Document