In portfolio theory, it is well-known that the distributions of stock returns often have non-Gaussian characteristics. Therefore, we need non-symmetric distributions for modeling and accurate analysis of actuarial data. For this purpose and optimal portfolio selection, we use the Tail Mean-Variance (TMV) model, which focuses on the rare risks but high losses and usually happens in the tail of r...

Using Metaheuristics models and Evolutionary Algorithms for solving portfolio problem has been considered in recent years.In this study, by using particles swarm optimization and tabu search algorithms we  optimized two-sided risk measures . A standard exact penalty function transforms the considered portfolio selection problem into an equivalent unconstrained minimization problem. And in final...

In this paper we discuss Grover Adaptive Search (GAS) for Constrained Polynomial Binary Optimization (CPBO) problems, and in particular, Quadratic Unconstrained (QUBO) as a special case. GAS can provide quadratic speed-up combinatorial optimization problems compared to brute force search. However, requires the development of efficient oracles represent flag states that satisfy certain search cr...

stochastic approach to vehicle routing problem: development and theories abstract in this article, a chance constrained (ccp) formulation of the vehicle routing problem (vrp) is proposed. the reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. knowing that reliable computer software for lar...

the issue of unit commitment is one of the most important economic plans in power system. in modern and traditional power systems, in addition to being economical of the planning, the issue of security in unit operation is also of great importance. hence power system operation confronts units’ participation and input considering network security constrains. the issue of units’ participation is ...

This paper describes an algorithm for cardinality-constrained quadratic optimization problems, which are convex quadratic programming problems with a limit on the number of non-zeros in the optimal solution. In particular, we consider problems of subset selection in regression and portfolio selection in asset management and propose branch-and-bound based algorithms that take advantage of the sp...

The paper addresses the constrained mean-semivariance portfolio optimization problem with the support of a novel multi-objective evolutionary algorithm (n-MOEA). The use of semivariance as the risk quantification measure and the real world constraints imposed to the model make the problem difficult to be solved with exact methods. Thanks to the exploratory mechanism, n-MOEA concentrates the sea...

In the paper, we introduce a multi-objective scenario-based optimization approach for chance-constrained portfolio selection problems. More specifically, a modified version of the normal constraint method is implemented with a global solver in order to generate a dotted approximation of the Pareto frontier for biand tri-objective programming problems. Numerical experiments are carried out on a ...