Automatic design of algorithms for the traveling salesman problem
The automatic generation of procedures for combinatorial optimization problems is emerging as a new alternative to address the hardest problems of this class. One of these problems still offering great computational difficulty is the traveling salesman problem. Its simple presentation masks the grea...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2016-12-01
|
| Series: | Cogent Engineering |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1080/23311916.2016.1255165 |