HighlightsOrder aggregation and scheduling in a meal delivery problemAlessandro Agnetis, Matteo Cosmi, Gaia Nicosia, Andrea Pacifici• A new model for scheduling single- or dual-order deliveries• A branch and bound algorithm makes use of sophisticated lower bounding schemes• Extensive...

Aiming at the problems of sharp path turning points, weak search directionality, and excessive number of calculation nodes in the traditional star algorithm when planning paths, the angle constraint, the way guide strategy, and the path search step size of the A star algorithm are improved....

This paper studies an extension of the rural postman problem with multiple depots and rechargeable and reusable vehicles capable of multiple trips with capacity constraints. This paper presents a new Mixed Integer Linear Programming (MILP) formulation to find optimal solutions to the problem....

In this paper, we study the capacitated multi-trip vehicle routing problem with time windows (CMTVRPTW) and its use in different scenarios, which have a common feature: vehicles can make multiple trips. This feature is widely used in the real world; not only can it reduce the number of vehicles...

The capacitated vehicle routing problem (CVRP) is of great importance to intelligent transportation systems. Recently, deep reinforcement learning (DRL) approaches have shown great potential in solving the CVRP. Specifically, encoder-decoder frameworks are trained by reinforcement learning with...

This paper considers an extension of the vehicle routing problem with synchronization constraints and introduces the vehicle routing problem with multiple synchronization constraints and variable service time. This important problem is motivated by a real-world problem faced by one of the...

The traffic assignment problem (TAP) with nonadditive path cost can only be solved by path-based algorithms owing to the characteristics of its cost structure. These algorithms generally decompose the TAP into subproblems with path flow as the variable by OD pairs and solve them sequentially. In...

The transit network design problem (TNDP) takes the form of bi-level programming and falls into the category of nondeterministic polynomial time-hard (NP-hard) problems that cannot be solved in a practical amount of computing time as the problem size increases. The upper-level objective is to...

Background: Order picking is a critical activity in end-product warehouses, particularly using the picker-to-part system, entail substantial manual labor, representing approximately 60% of warehouse work. Methods: This study develops a new linear model to perform batching, which allows for...