Name
Abstract | ||
|---|---|---|
The scope of this paper is to introduce two novel TSP instances based on the freely available geographic coordinates of the main cities from Spain and Portugal. We analyze in the case of the described instances the hardness, the quality of the provided solutions and the corresponding running times, using the Lin-Kernighan heuristic algorithm with different starting solutions and Applegate et al's branch and cut algorithm. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-32034-2_30 | HYBRID ARTIFICIAL INTELLIGENT SYSTEMS |
Keywords | Field | DocType |
TSP, Heuristics, Geographic coordinates | Computer science,Heuristic (computer science),Branch and cut,Geographic coordinate system,Theoretical computer science,Heuristics,Artificial intelligence,Machine learning | Conference |
Volume | ISSN | Citations |
9648 | 0302-9743 | 1 |
PageRank | References | Authors |
0.38 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gloria Cerasela Crisan | 1 | 83 | 9.08 |
| Camelia-Mihaela Pintea | 2 | 102 | 16.15 |
| Petrica C. Pop | 3 | 183 | 27.86 |
| Oliviu Matei | 4 | 43 | 11.15 |