• Home
  • الگوریتم رقابت استعماری آشوبی متعامد
    • List of Articles الگوریتم رقابت استعماری آشوبی متعامد

      • Open Access Article

        1 - Modified orthogonal chaotic imperialist competitive algorithm and its application to improve pattern recognition in the multilayer perceptron neural network
        پیمان معلم
        In spite of the success of the imperialist competitive algorithm (ICA) in solving optimization problems, this algorithm still suffers from frequent entrapment in the local minimum and low rate convergence. In this paper, a new version of this algorithm, called the modif Full Text
        In spite of the success of the imperialist competitive algorithm (ICA) in solving optimization problems, this algorithm still suffers from frequent entrapment in the local minimum and low rate convergence. In this paper, a new version of this algorithm, called the modified chaotic orthogonal imperialist competitive algorithm (COICA), is proposed. In the absorption policy of our proposed version, each colony searches the space of movement toward to imperialist through the definition of a new orthogonal vector. The probability of choosing powerful empires is also defined through the Boltzmann distribution function and selection is done through the roulette wheel method. The proposed algorithm is used to training of multilayer perceptron neural network (MLP) to classify standard data sets, including ionosphere and sonar. The K-Fold cross validation method was used to performance evaluation of this algorithm and generalizability assessment of the trained neural network with the proposed version. The results obtained from the simulations confirm reduction of neural network training error and generalizability improvement of our proposed algorithm. Manuscript Document
      • Open Access Article

        2 - Modified orthogonal chaotic colonial competition algorithm and its application in improving pattern recognition in multilayer perceptron neural network
        پیمان معلم
        Despite the success of the Colonial Competition Algorithm (ICA) in solving optimization problems, this algorithm still suffers from repeated entrapment in the local minimum and low convergence speed. In this paper, a new version of this algorithm, called Modified Orthog Full Text
        Despite the success of the Colonial Competition Algorithm (ICA) in solving optimization problems, this algorithm still suffers from repeated entrapment in the local minimum and low convergence speed. In this paper, a new version of this algorithm, called Modified Orthogonal Chaotic Colonial Competition (COICA), is proposed. In the policy of absorbing the proposed version, each colony seeks the space to move towards the colonizer through the definition of a new orthogonal vector. Also, the possibility of selecting powerful empires is defined through the boltzmann distribution function, and the selection operation is performed through the roulette wheel method. The proposed multilevel perceptron neural network (MLP) algorithm is used to classify standard datasets, including ionosphere and sonar. To evaluate the performance of this algorithm and to evaluate the generalizability of the trained neural network with the proposed version, the K-Fold cross-validation method has been used. The results obtained from the simulations confirm the reduction of network training error as well as the improved generalizability of the proposed algorithm. Manuscript Document
      • Open Access Article

        3 - Modified orthogonal chaotic imperialist competitive algorithm and its application to improve pattern recognition in the multilayer perceptron neural network
        پیمان معلم  
        In spite of the success of the imperialist competitive algorithm (ICA) in solving optimization problems, this algorithm still suffers from frequent entrapment in the local minimum and low rate convergence. In this paper, a new version of this algorithm, called the modif Full Text
        In spite of the success of the imperialist competitive algorithm (ICA) in solving optimization problems, this algorithm still suffers from frequent entrapment in the local minimum and low rate convergence. In this paper, a new version of this algorithm, called the modified chaotic orthogonal imperialist competitive algorithm (COICA), is proposed. In the absorption policy of our proposed version, each colony searches the space of movement toward to imperialist through the definition of a new orthogonal vector. The probability of choosing powerful empires is also defined through the Boltzmann distribution function and selection is done through the roulette wheel method. The proposed algorithm is used to training of multilayer perceptron neural network (MLP) to classify standard data sets, including ionosphere and sonar. The K-Fold cross validation method was used to performance evaluation of this algorithm and generalizability assessment of the trained neural network with the proposed version. The results obtained from the simulations confirm reduction of neural network training error and generalizability improvement of our proposed algorithm. Manuscript Document