In this study, we consider the multiple traveling salesmen problem, which is the more
general version of the single traveling salesman problem as it includes m> 1 salesmen …

In this paper, we consider the multiple traveling salesman problem (MTSP) with the minmax
objective, which includes more than one salesman to serve a set of cities while minimizing …

The multiple traveling salesmen problems (mTSP) are variants of the well-known traveling
salesmen problems, in which n cities are to be assigned to m salespeople. In this paper, we …

In this technical note, we propose a communication-aware motion planning framework to
increase the probability that a robot maintains its connectivity to a fixed station, while …

This work is inspired by the problem of planning sequences of operations, as welding, in car
manufacturing stations where multiple industrial robots cooperate. The goal is to minimize …

In this article, we study the problem of dynamic coverage of a set of points of interest (POIs)
in a time-varying environment. We consider the scenario where a physical quantity is …

Task assignment and routing are tightly coupled problems for teams of mobile agents. To
fairly balance the workload, each agent should be assigned a set of tasks which take a …

When facing the problem of modern logistics distribution under the large-scale network, the
reasonable delivery task allocation has become an important part. For this problem, this …

This paper introduces a novel practical variant, namely an open close multiple travelling
salesmen problem with single depot (OCMTSP) that concerns the generalization of classical …

Abstract Since the United States presidential election of 2000, political campaigns have
deployed volunteer lawyers to provide real-time information and assistance to poll …