Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top
Published in:
Solving the Multi-Period Water Distribution Network Design Problem with a Hybrid Simulated Anealling Read chapter Read first chapter

2019 | OriginalPaper | Chapter

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

Authors : Ana Priscila Martínez, Lidia Marina López

Published in: Computer Science – CACIC 2018

Publisher: Springer International Publishing

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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].

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

inform now

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

inform now
previous chapter Market Segmentation Using Data Mining Techniques in Social Networks
next chapter Contention Analysis of Congestion Control Mechanisms in a Wireless Access Scenario
Footnotes
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.
 
Literature
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
2.
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)
4.
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)
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)
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)MathSciNetCrossRef
8.
Johnson, D.S., McGeoch: The traveling salesman problem: A case study in local optimization. In: Local Search in Combinatorial Optimization (1997)
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)CrossRef
10.
11.
Glover, F.: Búsqueda Tabú. In: Revista Iberoamericana de Inteligencia Artificial, pp 29–48. Melián, B. (2003)
12.
13.
Metadata
Title
Heuristic Variant for the Travelling Salesman Problem. Application Case: Sports Fishing Circuit
Authors
Ana Priscila Martínez
Lidia Marina López
Copyright Year
2019
Book
Computer Science – CACIC 2018

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

Electronic ISBN: 978-3-030-20787-8

Copyright Year: 2019

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

Premium Partner

    Image Credits