scholarly journals Stochastic optimization techniques for finding optimal submeasures

Author(s):  
A. Gaivoronski
2011 ◽  
Vol 12 (1) ◽  
pp. 92-98
Author(s):  
Aušra Klimavičienė

The article examines the problem of determining asset allocation to sustainable retirement portfolio. The article attempts to apply heuristic method – 100 minus age in stocks rule – to determine asset allocation to sustainable retirement portfolio. Using dynamic stochastic simulation and stochastic optimization techniques the optimization of heuristic method rule is presented and the optimal alternative to „100“ is found. Seeking to reflect the stochastic nature of stock and bond returns and the human lifespan, the dynamic stochastic simulation models incorporate both the stochastic returns and the probability of living another year based on Lithuania‘s population mortality tables. The article presents the new method – adjusted heuristic method – to be used to determine asset allocation to retirement portfolio and highlights its advantages.


Author(s):  
Saurabh Deshpande ◽  
Jonathan Cagan

Abstract Many optimization problems, such as manufacturing process planning optimization, are difficult problems due to the large number of potential configurations (process sequences) and associated (process) parameters. In addition, the search space is highly discontinuous and multi-modal. This paper introduces an agent based optimization algorithm that combines stochastic optimization techniques with knowledge based search. The motivation is that such a merging takes advantage of the benefits of stochastic optimization and accelerates the search process using domain knowledge. The result of applying this algorithm to computerized manufacturing process models is presented.


2004 ◽  
Vol 126 (1) ◽  
pp. 46-55 ◽  
Author(s):  
Saurabh Deshpande ◽  
Jonathan Cagan

Many optimization problems, such as manufacturing process planning optimization, are difficult problems due to the large number of potential configurations (process sequences) and associated (process) parameters. In addition, the search space is highly discontinuous and multi-modal. This paper introduces an agent based optimization algorithm that combines stochastic optimization techniques with knowledge based search. The motivation is that such a merging takes advantage of the benefits of stochastic optimization and accelerates the search process using domain knowledge. The result of applying this algorithm to computerized manufacturing process models is presented.


Symmetry ◽  
2020 ◽  
Vol 12 (9) ◽  
pp. 1551 ◽  
Author(s):  
Bartłomiej Kizielewicz ◽  
Wojciech Sałabun

Many scientific papers are devoted to solving multi-criteria problems. Researchers solve these problems, usually using methods that find discrete solutions and with the collaboration of domain experts. In both symmetrical and asymmetrical problems, the challenge is when new decision-making variants emerge. Unfortunately, discreet identification of preferences makes it impossible to determine the preferences for new alternatives. In this work, we propose a new approach to identifying a multi-criteria decision model to address this challenge. Our proposal is based on stochastic optimization techniques and the characteristic objects method (COMET). An extensive work comparing the use of hill-climbing, simulated annealing, and particle swarm optimization algorithms are presented in this paper. The paper also contains preliminary studies on initial conditions. Finally, our approach has been demonstrated using a simple numerical example.


Sign in / Sign up

Export Citation Format

Share Document