Loading...
Please wait, while we are loading the content...
Similar Documents
Adaptation of the Harmony Search Algorithm to Solve the Travelling Salesman Problem
| Content Provider | Semantic Scholar |
|---|---|
| Author | Bouzidi, Morad Riffi, Mohammed Essaid |
| Copyright Year | 2014 |
| Abstract | The travelling salesman problem (TSP) is a discrete combinatorial optimization problem; it allows us to solve a set of problems in the real world in var ious fields. This article presents a new meta-heuri stic adaptation to solving this problem. The numerical r esults are applied to a set of instances of TSPLIB we showing us the effectiveness of the adaptation o f the harmony search algorithm band compared to other approaches in terms of quality of the solutio n, the search time, and the improvement of the results in terms of the reduction in the percentage of errors. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.jatit.org/volumes/Vol62No1/20Vol62No1.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |