This article introduces a new deep learning approach to approximately solve the covering
salesman problem (CSP). In this approach, given the city locations of a CSP as input, a deep …

The famous Travelling Salesman Problem (TSP) is an important category of optimization
problems that is mostly encountered in various areas of science and engineering. Studying …

This study proposes a covering delivery problem (CDP), which has practical applications in
last mile parcel delivery in online shopping. A set of vertices are considered, including …

The generalized covering traveling salesman problem is a recently introduced variant of the
traveling salesman problem. Given a set of cities that includes depot, facilities and customer …

The development of e-commerce has led to a surge in the number of online shopping
parcels. However, given the lack of scale effect, last mile delivery is inefficient, expensive …

With the fast growth of the parcel volume of online shopping, home delivery (delivering
parcels to customers' homes or workplaces) has accentuated the pressure on last mile …

Focal search (FS) is a bounded-suboptimal search (BSS) variant of A*. Like A*, it uses an
open list whose states are sorted in increasing order of their f-values. Unlike A*, it also uses …

Covering salesman problem (CSP) is an extension of the popular traveling salesman
problem (TSP) arising from a number of real-life applications. Given a set of vertices and a …

Humanitarian relief transportation and mass fatality management activities are the most
strenuous tasks after a natural or artificial disaster. A feasible and realistic transport model is …

In a routing framework, it may not be viable to visit every single customer separately due to
resource limitations or efficiency concerns. In such cases, utilizing the notion of coverage; ie …