Genetic algorithm-based multiple moving target reaching using a fleet of sailboats
This study addresses the problem of Dynamic Travelling Salesman Problem for a multi-agent system using a fleet of sailboats. A genetic algorithm (GA) is proposed, which attributes to each agent a varying number of targets to be collected. GA allows obtaining a suboptimal solution in the shortest tim...
Main Authors: | Viel Christophe, Vaultier Ulysse, Wan Jian, Jaulin Luc |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2019-11-01
|
Series: | IET Cyber-systems and Robotics |
Subjects: | |
Online Access: | https://digital-library.theiet.org/content/journals/10.1049/iet-csr.2019.0029 |
Similar Items
-
New Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle
Generalized Traveling Salesman Problems (GTSP)
by: Ellips Masehian
Published: (2010-02-01) -
Route Planning and Design of Autonomous Underwater Mine Reconnaissance Through Multi-Vehicle Cooperation
by: Hanskov Palm, Jakob
Published: (2020) -
An Application of Genetic Algorithm in Determining Salesmen’s Routes: A Case Study
by: Noufal Zhafira, et al.
Published: (2018-04-01) -
SOLVING THE PROBLEM OF VEHICLE ROUTING BY EVOLUTIONARY ALGORITHM
by: Remigiusz Romuald Iwańkowicz, et al.
Published: (2016-03-01) -
PENYELESAIAN MULTI TRAVELING SALESMAN PROBLEM DENGAN ALGORITMA GENETIKA
by: NI KADEK MAYULIANA, et al.
Published: (2017-01-01)