meta-heuristic algorithms
Hossein Nikoo; Jamal Barzgari khanagha; Hamid Reza Mirzaei
Abstract
Purpose: Pair formation is an important step in pair trading that has only been examined manually or through numerical instructions. These methods fail in the multivariate mode and do not consider conflicting goals in the problem structure. In this research, a method is presented to create multivariate ...
Read More
Purpose: Pair formation is an important step in pair trading that has only been examined manually or through numerical instructions. These methods fail in the multivariate mode and do not consider conflicting goals in the problem structure. In this research, a method is presented to create multivariate pair combinations by considering contradictory multiple goals in stock pair trading.
Methodology: In this study, the statistical sample is limited to the top 30 companies listed on the Tehran Stock Exchange due to the need for high-frequency transactions. The problem is developed in the form of a mixed integer programming model (MIP), and due to non-convex constraints and exponential solution space, a multi-objective genetic algorithm is used to obtain multivariate pair combinations. To achieve multiple goals, the developed type of genetic algorithm, namely, The Chaotic Non-dominated Sorting Genetic Algorithm (CNSGA-II), was used. In this method, chaos theory is used to create the initial population of the genetic algorithm in order to obtain appropriate and high-precision solutions.
Findings: The results showed that the use of chaos theory could increase the degree of convergence in evolutionary algorithms. In addition, these results indicate the superiority of the multi-objective pair trading strategy based on the distance approach over the traditional single-objective model.
Originality/Value: In order to optimize pair trading, the Non-dominated Sorting Genetic Algorithm was used. Also, the initial population of individuals was created in a multi-objective genetic algorithm based on chaos theory.
meta-heuristic algorithms
Vida Karbasi bonab; Mahdi Yousefi Nejad Attari; Ensiyeh Neishabouri
Abstract
Vendor managed inventory (VMI) is one of the popular strategies to manage inventory control system, in this strategy, the vendor is responsible for controlling and replenishment the inventory of retailers. In this paper, a bi-objective vendor managed inventory (BOVMI) model with fuzzy demand was investigated ...
Read More
Vendor managed inventory (VMI) is one of the popular strategies to manage inventory control system, in this strategy, the vendor is responsible for controlling and replenishment the inventory of retailers. In this paper, a bi-objective vendor managed inventory (BOVMI) model with fuzzy demand was investigated for a supply chain problem with multiple vendors and retailers, the fuzzy demand is formulated using trapezoidal fuzzy number (TrFN) where the centroid defuzzification method is employed to defuzzify fuzzy output functions. The vendor confronts two constraints: number of orders and available budget and minimizing the total inventory cost and optimizing the warehouse space are the two objectives of the model. Since the proposed model is formulated ino a bi-objective integer nonlinear programming (INLP) problem, an non-dominated Sorting genetic algorithm-II (NSGA-II) has been developed to find Pareto front solution. To improve the performance of algorithm has been calibrated using Taguchi method. Finally, conclusions are made and future research works are recommended.