One-way road networks can be designed with the aid of computer program. However, the
use of genetic algorithm in such design is new. This research paper presents a new …

Routing and path planning problems that involve spatial coverage have received increasing
attention in recent years in different application areas. Spatial coverage refers to the …

This paper addresses a variant of the classical Traveling Salesman Problem known as
Close-Enough Traveling Salesman Problem. In this problem, there is a set of nodes …

This paper studies a generalization of the close enough traveling salesman problem
referred to as the generalized close enough traveling salesman problem (GCETSP). The …

This paper proposes a global path planning method for collecting data from seabed-based
observation networks using multiple unmanned surface vessels (USVs). This method can …

This article studies the data collection task planning for a fixed-wing unmanned aerial
vehicle (UAV) in forest fire monitoring. Multiple wireless-based detection nodes (DNs) are …

The Traveling Salesman Problem (TSP) which is a theoretical computer science and
operations research problem, has several applications even in its purest formulation, such …

The international trade heavily relies on maritime transportation. Due to the vastness of the
ocean, once an accident happens, fast maritime search and rescue (MSR) is a must, as it is …

This paper addresses a UAV path planning problem for a team of cooperating
heterogeneous vehicles composed of one unmanned aerial vehicle (UAV) and multiple …

This paper addresses a variant of the Traveling Salesman Problem (TSP) known as the
Close-Enough Traveling Salesman Problem (CETSP). A salesman does not have to visit the …