Due to enormous demand and potential threat to public, hazardous materials transportation
has been tremendously investigated in recent years. However, there are few studies …

Conventional multiagent path finding (MAPF) problems aim to compute an ensemble of
collision-free paths for multiple agents from their respective starting locations to preallocated …

This paper addresses a newly introduced variant of traveling salesman problem, viz. k-
Interconnected Multi-Depot Multi-Traveling Salesman Problem (k-IMDMTSP). This problem …

High competition in today's global market has forced the organisations to invest in and focus
on their logistics system. Logistics is a business planning framework for the management of …

In multi-agent applications such as surveillance and logistics, fleets of mobile agents are
often expected to coordinate and safely visit a large number of goal locations as efficiently …

Infectious disease outbreaks have unfortunately been very real threats to the general
population and economic development in the past decades whether they are caused by …

This article presents a new modified version of the ant colony optimization (ACO) mixed with
insert, swap and 2-opt algorithm called NMACO for solving the multiple traveling salesman …

Conventional Multi-Agent Path Finding (MAPF) problems aim to compute an ensemble of
collision-free paths for multiple agents from their respective starting locations to pre …

A fundamental variant of the classical traveling salesman problem (TSP) is the so-called
multiple TSP (mTSP), where a set of m salesmen jointly visit all cities from a set of n cities …

This article presents an approximation algorithm for a Task Allocation, Sequencing and
Scheduling Problem (TASSP) involving a team of human operators and robots. The robots …