In the process of disassembly, it is difficult for workers who have been in working condition
for a long time to ensure the high-quality completion of the tasks they undertake, which will …

Multiple traveling salesperson problems (m TSP) are a collection of problems that
generalize the classical traveling salesperson problem (TSP). In a nutshell, an m TSP …

With the exponential growth of mobile devices and high capabilities of intelligence, global
communication network traffic is expected to experience remarkable growth in the next few …

This paper addresses a MinMax variant of the Dubins multiple traveling salesman problem
(mTSP). This routing problem arises naturally in mission planning applications involving …

The travelling salesman problem (TSP) and its variants have been studied extensively due
to its wide range of real-world applications, yet there are challenges in providing efficient …

Solid waste collection and street sweeping can each be formulated as a capacitated arc
routing problem (CARP) in which the streets of a city require service by a fleet of vehicles at …

For the group travel, reasonable vehicle scheduling needs to consider constraints such as
traffic distance and route conflict, which is common in many vehicle transportation …

Firefly Algorithm (FA) mimics the flashing light characteristic of fireflies to solve optimization
problems. An area where its utilization is limited is Travelling Salesman Problem (TSP) …

Traveling shortest path planning, encompassing the Traveling Salesman Problem (TSP) in
graph theory, holds profound significance. The motivation for addressing the TSP stems from …

Drones' power management, and its impact on their applications, faces significant
challenges. Path planning, and particularly travelled distance optimisation, has been shown …