liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Experimental analysis of heuristic solutions for the moving target traveling salesman problem applied to a moving targets monitoring system
Linköping University, Department of Computer and Information Science, Software and Systems. Linköping University, Faculty of Science & Engineering. Fed Univ Rio Grande do Sul UFRGS, Brazil.
Fed Univ Rio Grande do Sul UFRGS, Brazil.
2019 (English)In: Expert systems with applications, ISSN 0957-4174, E-ISSN 1873-6793, Vol. 136, p. 392-409Article in journal (Refereed) Published
Abstract [en]

The Traveling Salesman Problem (TSP) is an important problem in computer science which consists in finding a path linking a set of cities so that each of then can be visited once, before the traveler comes back to the starting point. This is highly relevant because several real world problems can be mapped to it. A special case of TSP is the one in which the cities (the points to be visited) are not static as the cities, but mobile, changing their positions as the time passes. This variation is known as Moving Target TSP (MT-TSP). Emerging systems for crowd monitoring and control based on unmanned aerial vehicles (UAVs) can be mapped to this variation of the TSP problem, as a number of persons (targets) in the crowd can be assigned to be monitored by a given number of UAVs, which by their turn divide the targets among them. These target persons have to be visited from time to time, in a similar way to the cities in the traditional TSP. Aiming at finding a suitable solution for this type of crowd monitoring application, and considering the fact that exact solutions are too complex to perform in a reasonable time, this work explores and compares different heuristic methods for the intended solution. The performed experiments showed that the Genetic Algorithms present the best performance in finding acceptable solutions for the problem in restricted time and processing power situations, performing better compared to Ant Colony Optimization and Simulated Annealing Algorithms. (C) 2019 Published by Elsevier Ltd.

Place, publisher, year, edition, pages
PERGAMON-ELSEVIER SCIENCE LTD , 2019. Vol. 136, p. 392-409
Keywords [en]
Ant Colony Optimization; Genetic Algorithms; Simulated Annealing; Artificial intelligence; Moving target traveling salesman problem; Moving targets
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:liu:diva-160571DOI: 10.1016/j.eswa.2019.04.023ISI: 000484871300032OAI: oai:DiVA.org:liu-160571DiVA, id: diva2:1362742
Note

Funding Agencies|Brazilian Research Support Agency - CNPq; Swedens Innovation Agency - VinnovaVinnova

Available from: 2019-10-21 Created: 2019-10-21 Last updated: 2019-10-21

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Search in DiVA

By author/editor
Saar de Moraes, Rodrigo
By organisation
Software and SystemsFaculty of Science & Engineering
In the same journal
Expert systems with applications
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 22 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf