Multi crteria decision making and its applications : a literature review

This paper presents current techniques used in Multi Criteria Decision Making (MCDM) and their applications. Two basic approaches for MCDM, namely Artificial Intelligence MCDM (AIMCDM) and Classical MCDM (CMCDM) are discussed and investigated. Recent articles from international journals related to MCDM are collected and analyzed to find which approach is more common than the other in MCDM. Also, which area these techniques are applied to. Those articles are appearing in journals for the year 2008 only. This paper provides evidence that currently, both AIMCDM and CMCDM are equally common in MCDM

A Multiobjective Optimization Approach for Market Timing

The introduction of electronic exchanges was a crucial point in history as it heralded the arrival of algorithmic trading. Designers of such systems face a number of issues, one of which is deciding when to buy or sell a given security on a financial market. Although Genetic Algorithms (GA) have been the most widely used to tackle this issue, Particle Swarm Optimization (PSO) has seen much lower adoption within the domain. In two previous works, the authors adapted PSO algorithms to tackle market timing and address the shortcomings of the previous approaches both with GA and PSO. The majority of work done to date on market timing tackled it as a single objective optimization problem, which limits its suitability to live trading as designers of such strategies will realistically pursue multiple objectives such as maximizing profits, minimizing exposure to risk and using the shortest strategies to improve execution speed. In this paper, we adapt both a GA and PSO to tackle market timing as a multiobjective optimization problem and provide an in depth discussion of our results and avenues of future research

Collaborative Multiobjective Evolutionary Algorithms in search of better Pareto Fronts. An application to trading systems

Technical indicators use graphic representations of data sets by applying various mathematical formulas to financial time series of prices. These formulas comprise a set of rules and parameters whose values are not necessarily known and depend on many factors: the market in which it operates, the size of the time window, and others. This paper focuses on the real-time optimization of the parameters applied for analyzing time series of data. In particular, we optimize the parameters of technical and financial indicators and propose other applications, such as glucose time series. We propose the combination of several Multi-objective Evolutionary Algorithms (MOEAs). Unlike other approaches, this paper applies a set of different MOEAs, collaborating to construct a global Pareto Set of solutions. Solutions for financial problems seek high returns with minimal risk. The optimization process is continuous and occurs at the same frequency as the investment time interval. This technique permits the application of non-dominated solutions obtained with different MOEAs simultaneously. Experimental results show that this technique increases the returns of the commonly used Buy \& Hold strategy and other multi-objective strategies, even for daily operations

Using Particle Swarm Optimization for Market Timing Strategies

Market timing is the issue of deciding when to buy or sell a given asset on the market. As one of the core issues of algorithmic trading systems, designers of such system have turned to computational intelligence methods to aid them in this task. In this thesis, we explore the use of Particle Swarm Optimization (PSO) within the domain of market timing.nPSO is a search metaheuristic that was first introduced in 1995 [28] and is based on the behavior of birds in flight. Since its inception, the PSO metaheuristic has seen extensions to adapt it to a variety of problems including single objective optimization, multiobjective optimization, niching and dynamic optimization problems. Although popular in other domains, PSO has seen limited application to the issue of market timing. The current incumbent algorithm within the market timing domain is Genetic Algorithms (GA), based on the volume of publications as noted in [40] and [84]. In this thesis, we use PSO to compose market timing strategies using technical analysis indicators. Our first contribution is to use a formulation that considers both the selection of components and the tuning of their parameters in a simultaneous manner, and approach market timing as a single objective optimization problem. Current approaches only considers one of those aspects at a time: either selecting from a set of components with fixed values for their parameters or tuning the parameters of a preset selection of components. Our second contribution is proposing a novel training and testing methodology that explicitly exposes candidate market timing strategies to numerous price trends to reduce the likelihood of overfitting to a particular trend and give a better approximation of performance under various market conditions. Our final contribution is to consider market timing as a multiobjective optimization problem, optimizing five financial metrics and comparing the performance of our PSO variants against a well established multiobjective optimization algorithm. These algorithms address unexplored research areas in the context of PSO algorithms to the best of our knowledge, and are therefore original contributions. The computational results over a range of datasets shows that the proposed PSO algorithms are competitive to GAs using the same formulation. Additionally, the multiobjective variant of our PSO algorithm achieve statistically significant improvements over NSGA-II

Multiobjective genetic programming for financial portfolio management in dynamic environments

Multiobjective (MO) optimisation is a useful technique for evolving portfolio optimisation solutions that span a range from high-return/high-risk to low-return/low-risk. The resulting Pareto front would approximate the risk/reward Efficient Frontier [Mar52], and simplifies the choice of investment model for a given client’s attitude to risk. However, the financial market is continuously changing and it is essential to ensure that MO solutions are capturing true relationships between financial factors and not merely over fitting the training data. Research on evolutionary algorithms in dynamic environments has been directed towards adapting the algorithm to improve its suitability for retraining whenever a change is detected. Little research focused on how to assess and quantify the success of multiobjective solutions in unseen environments. The multiobjective nature of the problem adds a unique feature to be satisfied to judge robustness of solutions. That is, in addition to examining whether solutions remain optimal in the new environment, we need to ensure that the solutions’ relative positions previously identified on the Pareto front are not altered. This thesis investigates the performance of Multiobjective Genetic Programming (MOGP) in the dynamic real world problem of portfolio optimisation. The thesis provides new definitions and statistical metrics based on phenotypic cluster analysis to quantify robustness of both the solutions and the Pareto front. Focusing on the critical period between an environment change and when retraining occurs, four techniques to improve the robustness of solutions are examined. Namely, the use of a validation data set; diversity preservation; a novel variation on mating restriction; and a combination of both diversity enhancement and mating restriction. In addition, preliminary investigation of using the robustness metrics to quantify the severity of change for optimum tracking in a dynamic portfolio optimisation problem is carried out. Results show that the techniques used offer statistically significant improvement on the solutions’ robustness, although not on all the robustness criteria simultaneously. Combining the mating restriction with diversity enhancement provided the best robustness results while also greatly enhancing the quality of solutions

Hybridization of multi-objective deterministic particle swarm with derivative-free local searches

The paper presents a multi-objective derivative-free and deterministic global/local hybrid algorithm for the efficient and effective solution of simulation-based design optimization (SBDO) problems. The objective is to show how the hybridization of two multi-objective derivative-free global and local algorithms achieves better performance than the separate use of the two algorithms in solving specific SBDO problems for hull-form design. The proposed method belongs to the class of memetic algorithms, where the global exploration capability of multi-objective deterministic particle swarm optimization is enriched by exploiting the local search accuracy of a derivative-free multi-objective line-search method. To the authors best knowledge, studies are still limited on memetic, multi-objective, deterministic, derivative-free, and evolutionary algorithms for an effective and efficient solution of SBDO for hull-form design. The proposed formulation manages global and local searches based on the hypervolume metric. The hybridization scheme uses two parameters to control the local search activation and the number of function calls used by the local algorithm. The most promising values of these parameters were identified using forty analytical tests representative of the SBDO problem of interest. The resulting hybrid algorithm was finally applied to two SBDO problems for hull-form design. For both analytical tests and SBDO problems, the hybrid method achieves better performance than its global and local counterparts

The crew-scheduling module in the GIST system

The public transportation is gaining importance every year basically due the population growth, environmental policies and, route and street congestion. Too able an efficient management of all the resources related to public transportation, several techniques from different areas are being applied and several projects in Transportation Planning Systems, in different countries, are being developed. In this work, we present the GIST Planning Transportation Systems, a Portuguese project involving two universities and six public transportation companies. We describe in detail one of the most relevant modules of this project, the crew-scheduling module. The crew-scheduling module is based on the application of meta-heuristics, in particular GRASP, tabu search and genetic algorithm to solve the bus-driver-scheduling problem. The metaheuristics have been successfully incorporated in the GIST Planning Transportation Systems and are actually used by several companies.Integrated transportation systems, crew scheduling, metaheuristics

Teaching mathematical modeling software for multiobjective optimization in chemical engineering courses

This paper expects to give undergraduate students some guidelines about how to incorporate environmental considerations in a chemical supply chain and how the introduction of these concerns have an important effect on the results obtained in the multiobjective optimization problem where both economic and environmental aspects are considered simultaneously. To extend the economic and environmental assessment outside the chemical plant and to identify the tradeoffs associated with the reality of chemical and petrochemical industries, a simplified problem of a chemical supply chain is proposed as a case study. The inclusion of environmental concerns to this economic problem make this new case study a good example for undergraduate students interested in implementing simultaneous economic and environmental considerations in the chemical process design incorporating mathematical modeling software for solving this multiobjective problem. Thus, the final objective of this paper is to show to undergraduate students how environmental together with economic considerations could have an important impact in the logistics of a supply chain and how multiobjective optimization could be used to make better decisions in the design of chemical processes including its supply chain. To reach our purpose, the Pareto curve of the supply chain is obtained using the ɛ-constraint method. In addition, the tradeoffs of this multiobjective optimization have been identified and analyzed and ultimately a good decision based on the set of ‘equivalent’ optimal solutions for this chemical supply chain problem determined.Spanish Ministry of Education and Science (CTQ2009-14420)

A multiobjective credibilistic portfolio selection model. Empirical study in the Latin American Integrated Market

[EN] This paper extends the stochastic mean-semivariance model to a fuzzy multiobjective model, where apart from return and risk, also liquidity is considered to measure the performance of a portfolio. Uncertainty of future return and liquidity of each asset are modeled using L-R type fuzzy numbers that belong to the power reference function family. The decision process of this novel approach takes into account not only the multidimensional nature of the portfolio selection problem but also realistic constraints by investors. Particularly, it optimizes the expected return, the semivariance and the expected liquidity of a given portfolio, considering cardinality constraint and upper and lower bound constraints. The constrained portfolio optimization problem resulting is solved using the algorithm NSGA-II. As a novelty, in order to select the optimal portfolio, this study defines the credibilistic Sortino ratio as the ratio between the credibilistic risk premium and the credibilistic semivariance. An empirical study is included to show the effectiveness and efficiency of the model in practical applications using a data set of assets from the Latin American Integrated Market.García García, F.; Gonzalez-Bueno, J.; Guijarro, F.; Oliver-Muncharaz, J. (2020). A multiobjective credibilistic portfolio selection model. Empirical study in the Latin American Integrated Market. Enterpreneurship and Sustainability Issues. 8(2):1027-1046. https://doi.org/10.9770/jesi.2020.8.2(62)S102710468