Constrained Multi-objective Task Assignment for UUVs Using Multiple Ant Colonies System

Xu, Zhenzhen; Li, Yiping; Feng, Xisheng

doi:10.1109/cccm.2008.318

“…The authors in [57] have modeled the task assignment problem for multi- In [58], the authors addressed the bi-criteria MTSP and adapted the ACO to solve the multi-objective single depot MTSP.…”

Section: Figure 1 Two Traditional Encoding Methodsmentioning

confidence: 99%

A comprehensive survey on the Multiple Traveling Salesman Problem: Applications, approaches and taxonomy

Cheikhrouhou

¹

,

Khoufi

²

2021

Computer Science Review

View full text Add to dashboard Cite

“…The authors in [57] have modeled the task assignment problem for multiple unmanned underwater vehicles as a constrained MTSP. The solution aims to minimize the total traveled distance and the total turning angle, which result in minimizing the vehicles energy consumption.…”

Section: Figure 1 Two Traditional Encoding Methodsmentioning

confidence: 99%

A Comprehensive Survey on the Multiple Travelling Salesman Problem: Applications, Approaches and Taxonomy

Cheikhrouhou¹

2021

Preprint

1

0

View full text Add to dashboard Cite

The Multiple Travelling Salesman Problem (MTSP) is among the most interesting combinatorial optimization problems because it is widely adopted in real-life applications, including robotics, transportation, networking, etc.Although the importance of this optimization problem, there is no survey dedicated to reviewing recent MTSP contributions. In this paper, we aim to fill this gap by providing a comprehensive review of existing studies on MTSP. In this survey, we focus on MTSP’s recent contributions to both classical vehicles/robots and unmanned aerial vehicles. We highlight the approaches applied to solve the MTSP as well as its application domains. We analyze the MTSP variants and propose a taxonomy and a classification of recent studies.

show abstract

“…In terms of application fields (Figure 5d), the most papers proposed for ground vehicles considered the general context, without being limited to a particular application area, except some papers such as [57,71,60,38,51], which are proposed for the MRTA problem. However, UAVs solutions present a diversity of applications areas (Table 3).…”

Section: Analysis Of Reviewed Mtsp's Solutionsmentioning

confidence: 99%

A Comprehensive Survey on the Multiple Travelling Salesman Problem: Applications, Approaches and Taxonomy

Cheikhrouhou¹

2021

Preprint

1

0

View full text Add to dashboard Cite

The Multiple Travelling Salesman Problem (MTSP) is among the most interesting combinatorial optimization problems because it is widely adopted in real-life applications, including robotics, transportation, networking, etc.Although the importance of this optimization problem, there is no survey dedicated to reviewing recent MTSP contributions. In this paper, we aim to fill this gap by providing a comprehensive review of existing studies on MTSP. In this survey, we focus on MTSP’s recent contributions to both classical vehicles/robots and unmanned aerial vehicles. We highlight the approaches applied to solve the MTSP as well as its application domains. We analyze the MTSP variants and propose a taxonomy and a classification of recent studies.

show abstract

Constrained Multi-objective Task Assignment for UUVs Using Multiple Ant Colonies System

Abstract: The purpose of this research is to develop an effective task assignment algorithm for multiple Unmanned Underwater Vehicles (UUVs)

Cited by 14 publications

References 6 publications

A comprehensive survey on the Multiple Traveling Salesman Problem: Applications, approaches and taxonomy

A comprehensive survey on the Multiple Traveling Salesman Problem: Applications, approaches and taxonomy

A Comprehensive Survey on the Multiple Travelling Salesman Problem: Applications, Approaches and Taxonomy

A Comprehensive Survey on the Multiple Travelling Salesman Problem: Applications, Approaches and Taxonomy

Contact Info

Product

Resources

About