TY - GEN
T1 - Genetic algorithm to optimize fitness function with sampling error and its application to financial optimization problem
AU - Tezuka, Masaru
AU - Munetomo, Masaharu
AU - Akama, Kiyoshi
AU - Hiji, Masahiro
PY - 2006
Y1 - 2006
N2 - In this paper we discuss the optimization problems with noisy fitness function. On financial optimization problems, Monte-Carlo method is commonly used to evaluate the optimization criteria such as value at risk. The evaluation model is often very complex which needs considerable computational overheads. In order to realize efficient optimization of financial problems, we propose a method to decide the number of samples used to estimate the optimization criteria. Selection efficiency proposed in this paper is a index that shows how close the population approaches to the convergence to a good solution. In general, it is difficult to calculate selection efficiency analytically. Thus we also employ bootstrap method to estimate selection efficiency. The resulting algorithm is applied to the optimization of the procurement plan optimization problem. The result shows that Value at Risk of the problem is optimized efficiently by the proposed method.
AB - In this paper we discuss the optimization problems with noisy fitness function. On financial optimization problems, Monte-Carlo method is commonly used to evaluate the optimization criteria such as value at risk. The evaluation model is often very complex which needs considerable computational overheads. In order to realize efficient optimization of financial problems, we propose a method to decide the number of samples used to estimate the optimization criteria. Selection efficiency proposed in this paper is a index that shows how close the population approaches to the convergence to a good solution. In general, it is difficult to calculate selection efficiency analytically. Thus we also employ bootstrap method to estimate selection efficiency. The resulting algorithm is applied to the optimization of the procurement plan optimization problem. The result shows that Value at Risk of the problem is optimized efficiently by the proposed method.
UR - http://www.scopus.com/inward/record.url?scp=34547257866&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34547257866&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:34547257866
SN - 0780394879
SN - 9780780394872
T3 - 2006 IEEE Congress on Evolutionary Computation, CEC 2006
SP - 81
EP - 87
BT - 2006 IEEE Congress on Evolutionary Computation, CEC 2006
T2 - 2006 IEEE Congress on Evolutionary Computation, CEC 2006
Y2 - 16 July 2006 through 21 July 2006
ER -