The traveling salesman problem (TSP) were studied in the 18th century by a mathematician
from Ireland named Sir William Rowam Hamilton and by the British mathematician named …

A certifying algorithm is an algorithm that produces, with each output, a certificate or witness
(easy-to-verify proof) that the particular output has not been compromised by a bug. A user …

For the traveling salesman problem (TSP), the existing supervised learning based
algorithms suffer seriously from the lack of generalization ability. To overcome this …

Value-function-based methods have long played an important role in reinforcement
learning. However, finding the best next action given a value function of arbitrary complexity …

We propose an end-to-end learning framework based on hierarchical reinforcement
learning, called H-TSP, for addressing the large-scale Traveling Salesman Problem (TSP) …

This article presents the Ant Colony Optimization algorithm to solve the Travelling Salesman
Problem. The proposed algorithm implements three novel techniques to enhance the overall …

A coloring traveling salesman problem (CTSP) generalizes the well-known multiple traveling
salesman problem, where colors are used to differentiate salesmen's the accessibility to …

This paper presents a genetic algorithm (GA) for solving the traveling salesman problem
(TSP). To construct a powerful GA, we use edge assembly crossover (EAX) and make …

This paper considers a cooperative system between electric vehicles and drones in last-mile
logistics operations. This form of cooperation is presented as electric vehicle–drone routing …

Combinatorial optimization problems such as Traveling Salesman Problem (TSP) have a
wide range of real-world applications in transportation, logistics, manufacturing. It has …