An improving of migration operator in Biogeography-Based Optimization for solving Traveling Salesman Problem
| Autor: | Dinh Thanh Pham, Manh Cuong Dang, Thi Thanh Binh Huynh |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
Mathematical optimization
Optimization problem Distribution (number theory) Combinatorial optimization problem Approximation algorithm 0102 computer and information sciences 02 engineering and technology Genetic operator 01 natural sciences Travelling salesman problem Biogeography-based optimization Operator (computer programming) 010201 computation theory & mathematics 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Mathematics |
| Zdroj: | 2016 International Conference on Computational Intelligence and Cybernetics. |
| DOI: | 10.1109/cyberneticscom.2016.7892563 |
| Popis: | Traveling Salesman Problem (TSP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-Based Optimization Algorithm (BBO) is a new optimization technique, is inspired by geographical distribution of species within islands. The main idea of BBO based on migration strategy of species to derive algorithm for solving optimization problems. In BBO, the migration operator is one of the most importance operator. The migration operator helps to move the good features from better individuals to other individuals. Several researches have focused on improving the performance of migration operator. In this paper, a novel migration operator is proposed. To evaluate the migration operator, we compare the novel migration operator with two difference migration operators on TSP instances. The results show that novel migration operator outperforms other migration operators in terms of quality of solution on the most of the instances. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|