An evolutionary algorithm for multiobjective fuzzy portfolio selection models with transaction cost and liquidity (Q1666014)

From MaRDI portal
scientific article
Language Label Description Also known as
English
An evolutionary algorithm for multiobjective fuzzy portfolio selection models with transaction cost and liquidity
scientific article

    Statements

    An evolutionary algorithm for multiobjective fuzzy portfolio selection models with transaction cost and liquidity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 August 2018
    0 references
    Summary: The major issues for mean-variance-skewness models are the errors in estimations that cause corner solutions and low diversity in the portfolio. In this paper, a multiobjective fuzzy portfolio selection model with transaction cost and liquidity is proposed to maintain the diversity of portfolio. In addition, we have designed a multiobjective evolutionary algorithm based on decomposition of the objective space to maintain the diversity of obtained solutions. The algorithm is used to obtain a set of Pareto-optimal portfolios with good diversity and convergence. To demonstrate the effectiveness of the proposed model and algorithm, the performance of the proposed algorithm is compared with the classic MOEA/D and NSGA-II through some numerical examples based on the data of the Shanghai Stock Exchange Market. Simulation results show that our proposed algorithm is able to obtain better diversity and more evenly distributed Pareto front than the other two algorithms and the proposed model can maintain quite well the diversity of portfolio. The purpose of this paper is to deal with portfolio problems in the weighted possibilistic mean-variance-skewness (MVS) and possibilistic mean-variance-skewness-entropy (MVS-E) frameworks with transaction cost and liquidity and to provide different Pareto-optimal investment strategies as diversified as possible for investors at a time, rather than one strategy for investors at a time.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references