This section contains the data corresponding to 126 ATSP instances with known optimal solution. 
These instances become from the work:

    Soler, D., Martínez, E., & Micó, J.C. (2008). A transformation for the mixed
    general routing problem with turn penalties. Journal of the Operational Research Society, 59, 540-547.


These ATSP instances are transformations into an ATSP of the instances generated for the especific problem (the Mixed General Routing 
Problem with Turn Penalties) presented in that aforementioned work.


The ATSP instances were optimally solved with the exact procedure for the Mixed General Routing Problem 
presented in 

    Corberan, A., Mejía, G., & Sanchis, J.M. (2005). New results on the
    mixed general routing problem. Operations Research, 53, 363-376.

Each file contains first the number of vertices and then the standard ATSP cost matrix, where a value 12000 or greater
means infinity (the corresponding arc does not exist).

The attached excel file contains for each ATSP instance: the number of vertices (VER ATSP), the optimal cost 
(ATSP COST) and the running time in seconds to optimally solve the instance (TIME OPT) with the code cited above, 
 on a PC with 1.8GHz Pentium IV processor.



For more information about the content of this section, please contact with:

Yuichi Nagata  (nagata@fe.dis.titech.ac.jp)
or
David Soler   (dsoler@mat.upv.es)