Discrete bat-inspired algorithm for travelling salesman problem

被引：0

作者：

Saji, Yassine ^{[1
]}

Riffi, Mohammed Essaid ^{[1
]}

Ahiod, Belaid ^{[2
]}

机构：

[1] Chouaib Doukkali Univ, Dept Comp Sci, LAROSERI, Fac Sci, El Jadida, Morocco

[2] Mohammed V Agdal Univ, Fac Sci, LRIT, Associated Unit CNRST URAC 29, Rabat, Morocco

来源：

2014 SECOND WORLD CONFERENCE ON COMPLEX SYSTEMS (WCCS) | 2014年

关键词：

Travelling Salesman Problem; Meta-heuristic; NP-hard Problem; Combinatorial Optimization; Bat Algorithm;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Bat algorithm (BA) is a new nature-inspired metaheuristic optimization algorithm based on the echolocation behavior of bats to find their prey and to avoid obstacles in the darkness. This new algorithm has showed a higher efficiency in solving continuous optimization problems. In this study, we have proposed a novel adaptation of BA for solving travelling salesman problem (TSP), which is known as an NP-hard combinatorial optimization problem. We have also redefined some operators used in basic BA. Implementation is carried out in MA TLAB on examples of symmetric instance. The results are optimistic and clearly demonstrate the efficiency of the proposed algorithm in terms of convergence towards optimal solution.

引用

页码：28 / 31

页数：4

共 22 条

[1]

[Anonymous], 2013, NEURAL COMPUTING APP

[2] Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution [J].

Chen, Yong ;

Zhang, Pan .

PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2006, 371 (02) :627-632

[3]

Clerc M., 2004, COMPUTATION, V3, p[219, 4267]

[4] Ant colonies for the travelling salesman problem [J].

Dorigo, M ;

Gambardella, LM .

BIOSYSTEMS, 1997, 43 (02) :73-81

[5]

Dorigo M., 1997, IEEE Transactions on Evolutionary Computation, V1, P53, DOI 10.1109/4235.585892

[6] Solving symmetric and asymmetric TSPs by Ant Colonies [J].

Gambardella, LM ;

Dorigo, M .

1996 IEEE INTERNATIONAL CONFERENCE ON EVOLUTIONARY COMPUTATION (ICEC '96), PROCEEDINGS OF, 1996, :622-627

[7] Bat algorithm for constrained optimization tasks [J].

Gandomi, Amir Hossein ;

Yang, Xin-She ;

Alavi, Amir Hossein ;

Talatahari, Siamak .

NEURAL COMPUTING & APPLICATIONS, 2013, 22 (06) :1239-1255

[8]

Goldbarg E. F., 2008, GRECO, P202

[9] An effective implementation of the Lin-Kernighan traveling salesman heuristic [J].

Helsgaun, K .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 126 (01) :106-130

[10]

Li XY, 2006, LECT NOTES COMPUT SC, V4247, P181

← 1 2 3 →