Skip to main content
SpringerLink
Log in

Heuristic Variant for the Travelling Salesman Problem. Application Case: Sports Fishing Circuit

  • Conference paper
  • First Online:
Computer Science – CACIC 2018 (CACIC 2018)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 995))

Included in the following conference series:

  • 363 Accesses

Abstract

The present work focuses on the construction of an algorithm to solve a sport fishing circuit, applying combinatorial optimization techniques in order to generate the best solution to the problem of the route for sport fishing in the province of Neuquén. The planning and management of roads for routes with preferences requires efficient systems for route optimization. Its complexity is exponential. For the resolution of this type of problems, heuristics must be used to allow feasible solutions. To model a tourist circuit associated with sport fishing, the exploration of a restricted graph is used. It is framed within the Travelling Salesman Problem. A metaheuristic Taboo search algorithm, based on a local search, is proposed to find a solution to the problem [1].

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    A well-designed approximation algorithm shows that the difference between your solution and the optimal solution is a constant factor. This factor is called the approximation factor, and is “<1 for maximization” or “> 1 for minimization”. It depends on the application how close the approximate solution should be to the optimal solution.

References

  1. Variante Heurística para el Problema del Viajante. Caso de Aplicación: Circuito de Pesca Deportiva. In: Congreso Argentino de Ciencias de la Computación. Libro de Actas, CACIC 2018. ISBN 978-950-658-472-6

    Google Scholar 

  2. Turismo Pesquero provincia de Neuquén. http://neuquentur.gob.ar/. Accessed 30 May 2016

  3. Stockdale, M.L.: Tesis de Licenciatura - El problema del viajante: un algoritmo heurístico y una aplicación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales (2011)

    Google Scholar 

  4. García, M.S.: Las Matemáticas del Siglo XX. Optimización Combinatoria. http://www.sinewton.org/numeros/numeros/43-44/Articulo22.pdf. Accessed 20 July 2016

  5. Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report 388, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh (1976)

    Google Scholar 

  6. Pigatti, A.A.: Modelos e Algoritmos para o Problema de Alocação Generalizada (PAG) e Aplicações. Dissertação de mestrado departamento de informática. Programa de Pós–graduação em Informática, Rio de Janeiro (2003)

    Google Scholar 

  7. Rego, C., Gamboa, D., Glover, F., Osterman, C.: Traveling salesman problem heuristics: leading methods, implementations and latest advances. Eur. J. Oper. Res. 211(3), 427–441 (2011)

    Article  MathSciNet  Google Scholar 

  8. Johnson, D.S., McGeoch: The traveling salesman problem: A case study in local optimization. In: Local Search in Combinatorial Optimization (1997)

    Google Scholar 

  9. Ray, S.S., Bandyopadhyay, S., Pal, S.K.: Genetic operators for combinatorial optimization in tsp and microarray gene ordering. Appl. Intell. 26(3), 183–195 (2007)

    Article  Google Scholar 

  10. Batagelj, V., Mrvar, A.: Pajek—analysis and visualization of large networks. In: Mutzel, P., Jünger, M., Leipert, S. (eds.) GD 2001. LNCS, vol. 2265, pp. 477–478. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-45848-4_54

    Chapter  Google Scholar 

  11. Glover, F.: Búsqueda Tabú. In: Revista Iberoamericana de Inteligencia Artificial, pp 29–48. Melián, B. (2003)

    Google Scholar 

  12. Void Exception. http://voidexception.weebly.com/. Accessed 13 Sept 2016

  13. El método de Búsqueda Tabú. http://tesis.uson.mx/digital/tesis/docs/18920/Capitulo2.pdf. Accessed 10 Mar 2017

Download references

Author information

Authors and Affiliations

  1. Facultad de Informática, Universidad Nacional del Comahue, Neuquén, Argentina

    Ana Priscila Martínez & Lidia Marina López

Authors
  1. Ana Priscila Martínez
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lidia Marina López
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ana Priscila Martínez .

Editor information

Editors and Affiliations

  1. National University of La Plata, La Plata, Argentina

    Patricia Pesado

  2. National University of Buenos Aires Center, Buenos Aires, Argentina

    Claudio Aciti

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Martínez, A.P., López, L.M. (2019). Heuristic Variant for the Travelling Salesman Problem. Application Case: Sports Fishing Circuit. In: Pesado, P., Aciti, C. (eds) Computer Science – CACIC 2018. CACIC 2018. Communications in Computer and Information Science, vol 995. Springer, Cham. https://doi.org/10.1007/978-3-030-20787-8_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-20787-8_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-20786-1

  • Online ISBN: 978-3-030-20787-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation