In the e‐commerce era, vendors have to satisfy a large number of on‐line orders, mainly
from private customers, with low weight and volume, reduced delivery time, and overlap of …

In vehicle routing problems (VRPs) the decisions to be taken concern the assignment of
customers to vehicles and the sequencing of the customers assigned to each vehicle …

Accurate and real-time tracking for real-world urban logistics has become a popular
research topic in the field of intelligent transportation. While the routing of urban logistic …

We study a dynamic vehicle routing problem where stochastic customers request urgent
deliveries characterized by restricted time windows. The aim is to use a fleet of vehicles to …

To solve travelling salesman problems (TSPs), most existing evolutionary algorithms search
for optimal solutions from zero initial information without taking advantage of the historical …

Abstract Traveling Salesman Problem (TSP) is the combinatorial optimization problem,
where a salesman starting from a home city travels all the other cities and returns to the …

Today, local administrations are faced with the presence of greater constraints in terms of
the use of space and time. At the same time, large amount of data is available to fleet …

Emergency department overcrowding is a global issue that poses a great threat to patient
health and safety. The timeliness of medical services provided to patients is crucial to …

Abstract The Vehicle Routing Problem with Release Dates and Drone Resupply consists of
routing a fleet of trucks to deliver orders that arrive at a depot over time. During the delivery …

The rapid development of logistics and navigation has led to increasing demand for solving
route optimization problems in real-time. The traveling salesman problem (TSP) tends to …