Discrete Teaching-learning-based optimization Algorithm for Traveling Salesman Problems
In this paper, a discrete variant of TLBO (DTLBO) is proposed for solving the traveling salesman problem (TSP). In the proposed method, an effective learner representation scheme is redefined based on the characteristics of TSP problem. Moreover, all learners are randomly divided into several sub-sw...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
EDP Sciences
2017-01-01
|
| Series: | MATEC Web of Conferences |
| Online Access: | https://doi.org/10.1051/matecconf/201712802022 |