Skip to main content
Springer Nature Link
Log in

An Analysis of the Hardness of Novel TSP Iberian Instances

  • Conference paper
  • First Online:
Hybrid Artificial Intelligent Systems (HAIS 2016)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 9648))

Included in the following conference series:

  • 2184 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Applegate, D.L., Bixby, R.E., Chvátal, V., Cook, W.J.: Princeton Series in Applied Mathematics. The Traveling Salesman Problem: A Computational. Princeton University Press, Princeton (2007)

    Google Scholar 

  2. Applegate, D.L., et al.: Certification of an optimal TSP tour through 85,900 cities. Oper. Res. Lett. 37(1), 11–15 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  3. Balas, E.: The prize collecting traveling salesman problem. Networks 19, 621–636 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bektas, T.: The multiple traveling salesman problem: an overview of formulations and solution procedures. OMEGA: Int. J. Manage. Sci. 34(3), 209–219 (2006)

    Article  Google Scholar 

  5. Bland, R.G., Shallcross, D.F.: Large travelling salesman problems arising from experiments in X-ray crystallography: a preliminary report on computation. Oper. Res. Lett. 8(3), 125–128 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  6. Brassai, S.T., Iantovics, B., Enachescu, C.: Optimization of robotic mobile agent navigation. Stud. Inform. Control 21(4), 403–412 (2012)

    Google Scholar 

  7. Clarke, G., Wright, J.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4), 568–581 (1964)

    Article  Google Scholar 

  8. Cook, W.J.: In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Princeton University Press, Princeton (2014)

    MATH  Google Scholar 

  9. Corder, G.W., Foreman, D.I.: Nonparametric Statistics: A Step-by-Step Approach. Wiley, New Jersey (2014)

    MATH  Google Scholar 

  10. Crişan, G.C., Nechita, E., Palade, V.: Ant-based system analysis on the traveling salesman problem under real-world settings. In: Hatzilygeroudis, I., Palade, V., Prentzas, J. (eds.) Combinations of Intelligent Methods and Applications, vol. 46, pp. 39–59. Springer, Heidelberg (2016)

    Chapter  Google Scholar 

  11. Crişan, C., Pintea, C.-M.: Romania2950 dataset (2014). doi:10.13140/2.1.4706.8165

  12. Crişan, C., Pintea, C.-M.: Spain TSP instance (2015). doi:10.13140/RG.2.1.2331.2727

  13. Crişan, C., Pintea, C.-M.: Portugal TSP instance (2015). doi:10.13140/RG.2.1.4944.5209

  14. Crişan, G.C.: Ant algorithms in artificial intelligence. Ph.D thesis, Al.I.Cuza Unversity of Iasi, Romania (2007)

    Google Scholar 

  15. Crişan, G.C., Nechita, E.: Solving fuzzy TSP with ant algorithms. Int. J. Comput. Commun. Control 3, 228–231 (2008)

    Google Scholar 

  16. Dorigo, M., Gambardella, L.M.: Ant colonies for traveling salesman problem. BioSystems 43, 73–81 (1997)

    Article  Google Scholar 

  17. Eldrandaly, K.A., Abdallah, A.F.: A novel GIS-based decision-making framework for the school bus routing problem. Geo-spat. Inf. Sci. 15(1), 51–59 (2012)

    Article  Google Scholar 

  18. GeoNames download page. http://www.geonames.org/export/

  19. Google Developers TSP Application. https://developers.google.com/optimization/routing/tsp?hl=en

  20. Grötschel, M., Jünger, M., Reinelt, G.: Optimal control of plotting and drilling machines: a case study. Math. Methods Oper. Res. 35(1), 61–84 (1991)

    Article  MATH  Google Scholar 

  21. Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum, New York (1972)

    Chapter  Google Scholar 

  22. Lenstra, J.K., Kan, A.H.G.: Some simple applications of the traveling salesman problem. Oper. Res. 26, 717–733 (1975)

    Article  MATH  Google Scholar 

  23. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498–516 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  24. List of the Spanish provinces. http://en.classora.com

  25. NEOS server for Concorde. http://neos.mcs.anl.gov/neos/solvers/co:concorde/TSP.html

  26. Nahmias, S., Lennon, O.T.: Production and Operations Analysis, 7th edn. Waveland Press, Long Grove (2015)

    Google Scholar 

  27. Nešetřil, J., Milková, E., Nešetřilová, H.: Otakar Bor\(\mathring{{\rm u}}\)vka on minimum spanning tree problem: translation of both the 1926 papers, comments, history. Discrete Math. 233(1–3), 3–36 (2001)

    MathSciNet  MATH  Google Scholar 

  28. OptiMap solver. http://www.gebweb.net/optimap/

  29. Pintea, C.-M.: A lnifying survey of agent-based approaches for equality-generalized traveling salesman problem. Informatica 26(3), 509–522 (2015)

    Article  Google Scholar 

  30. Pintea, C.-M., Ludwig, S.A., Crişan, G.-C.: Adaptability of a discrete PSO algorithm applied to the traveling salesman problem with fuzzy data. In: IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), pp. 1–6 (2015)

    Google Scholar 

  31. Potvin, J.-Y.: Genetic algorithms for the traveling salesman problem. Ann. Oper. Res. 63(3), 337–370 (1996)

    Article  MATH  Google Scholar 

  32. Reinelt, G. (ed.): TSP. LNCS, vol. 840. Springer, Heidelberg (1994)

    MATH  Google Scholar 

  33. Rodríguez, A., Ruiz, R.: The effect of the asymmetry of road transportation networks on the traveling salesman problem. Comput. Oper. Res. 39, 1566–1576 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  34. Stoean, C., Stoean, R.: Support Vector Machines and Evolutionary Algorithms for Classification. Springer, Heidelberg (2014)

    Book  MATH  Google Scholar 

  35. Shapiro, D.M.: Algorithms for the solution of the optimal cost and bottleneck traveling salesman problems. Sc.D. thesis, Washington University, St. Louis, MO (1966)

    Google Scholar 

  36. TSPLIB. http://www.iwr.uni-heidelberg.de/groups/comopt/software/tsplib95

  37. TSP data. www.math.uwaterloo.ca/tsp/data/

  38. Vescan, A., Grosan, C.: A hybrid evolutionary multiobjective approach for the component selection problem. In: Corchado, E., Abraham, A., Pedrycz, W. (eds.) HAIS 2008. LNCS (LNAI), vol. 5271, pp. 164–171. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Acknowledgment

The study was conducted under the auspices of the IEEE-CIS Interdisciplinary Emergent Technologies task force and the project “Bacău and Lugano-Teaching Informatics for a Sustainable Society”, co-financed by Switzerland through the Swiss-Romanian Cooperation Programme to reduce economic and social disparities within the enlarged European Union. This work is partly supported by the ProSEco project of EU’s 7th FP, under the grant agreement no. NMP-2013 609143.

Author information

Authors and Affiliations

  1. Vasile Alecsandri University of Bacău, 600115, Bacăsu, Romania

    Gloria Cerasela Crişan

  2. Technical University Cluj-Napoca, 430122, Baia Mare, Romania

    Camelia-M. Pintea, Petrică Pop & Oliviu Matei

Authors
  1. Gloria Cerasela Crişan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Camelia-M. Pintea
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Petrică Pop
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Oliviu Matei
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Camelia-M. Pintea .

Editor information

Editors and Affiliations

  1. Universidad Pablo de Olavide, Sevilla, Spain

    Francisco Martínez-Álvarez

  2. Universidad Pablo de Olavide, Sevilla, Spain

    Alicia Troncoso

  3. University of Salamanca, Salamanca, Spain

    Héctor Quintián

  4. University of Salamanca, Salamanca, Spain

    Emilio Corchado

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Crişan, G.C., Pintea, CM., Pop, P., Matei, O. (2016). An Analysis of the Hardness of Novel TSP Iberian Instances. In: Martínez-Álvarez, F., Troncoso, A., Quintián, H., Corchado, E. (eds) Hybrid Artificial Intelligent Systems. HAIS 2016. Lecture Notes in Computer Science(), vol 9648. Springer, Cham. https://doi.org/10.1007/978-3-319-32034-2_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-32034-2_30

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-32033-5

  • Online ISBN: 978-3-319-32034-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics