Due to the diversity and the different distribution conditions of agricultural products, split
delivery plays an important role in the last mile distribution of agricultural products …

Although several surveys on Neural Combinatorial Optimization (NCO) solvers specifically
designed to solve Vehicle Routing Problems (VRPs) have been conducted. These existing …

The traveling salesman problem (TSP) is a well-known combinatorial optimization problem
(COP) with broad real-world applications. Recently, neural networks (NNs) have gained …

In the emergency response phase after a natural disaster, aviation emergency rescue is an
efficient means of rescue work. In this paper, the disaster victims to be rescued are discretely …

The split delivery vehicle routing problem (SDVRP) is a classic combinatorial optimization
problem, which is usually solved using a heuristic algorithm. The ant colony optimization …

The diversity of consumer demand for take-out food has led to the characteristic structure of
one order with multiple items, where the different food items in a single order are provided …

The split delivery vehicle routing problem (SDVRP) is a relaxed variant of the capacitated
vehicle routing problem (CVRP) where the restriction that each customer is visited precisely …

Occupational safety and health (OSH) inspection is an essential element of OSH regulatory
enforcement programs. The effectiveness of regulated OSH inspections is dependent on …

The problem of vehicle routing planning (VRP) has far-reaching influence, and is widely
used in vehicle scheduling, industrial production, transportation, logistics and distribution …

This paper introduces the multi-depot multi-travelling salesman problem with split and
delivery demand (M m TSP-SD). The problem has been formulated as a flexible optimisation …