We present an end-to-end framework for solving the Vehicle Routing Problem (VRP) using
reinforcement learning. In this approach, we train a single policy model that finds near …

Increasing online purchases and higher customer requirements in terms of speed, flexibility,
and costs of home deliveries are challenges to every company involved in last mile delivery …

This paper proposes a hybrid genetic algorithm for solving the Multiple Traveling Salesman
Problem (mTSP) to minimize the length of the longest tour. The genetic algorithm utilizes a …

Metaheuristics are the most exciting development in approximate optimization techniques of
the last two decades. They have had widespread successes in attacking a variety of difficult …

For a dynamic traveling salesman problem (DTSP), the weights (or traveling times) between
two cities (or nodes) may be subject to changes. Ant colony optimization (ACO) algorithms …

In the aftermath of a large disaster, the routing of vehicles carrying critical supplies can
greatly impact the arrival times to those in need. Because it is critical that the deliveries are …

Multiple traveling salesman problem (MTSP) is a generalization of the classic traveling
salesman problem (TSP). Compared to TSP, MTSP is more common in real-life applications …

This bibliography contains 500 references on four classical routing problems: the Traveling
Salesman Problem, the Vehicle Routing Problem, the Chinese Postman Problem, and the …

The minmax multiple traveling salesman problem with single depot (the minmax mTSP) or
multiple depots (the minmax multidepot mTSP) aims to minimize the longest tour among a …

This paper addresses a periodic vehicle routing problem encountered in home health care
(HHC) logistics. It extends the classical Periodic Vehicle Routing Problem with Time …