The scheduling of deliveries and the routing of vehicles are of great importance for supply chain operations, as both determine to a great extent the distribution costs, as well as …
KC Tan, L Feng, M Jiang - IEEE Computational Intelligence …, 2021 - ieeexplore.ieee.org
The evolutionary algorithm (EA) is a nature-inspired population-based search method that works on Darwinian principles of natural selection. Due to its strong search capability and …
Abstract Monte Carlo Tree Search (MCTS) is a powerful approach to designing game- playing bots or solving sequential decision problems. The method relies on intelligent tree …
In the vehicle routing problem with simultaneous pickup and delivery (VRPSPD), goods have to be transported from different origins to different destinations, and each customer has …
Y Deutsch, B Golany - International Journal of Production …, 2018 - Taylor & Francis
We consider the problem of designing a parcel locker network as a solution to the Logistics Last Mile Problem: Choosing the optimal number, locations, and sizes of parcel locekers …
Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat …
The capacitated vehicle routing problem (CVRP) is a classical combinatorial optimization problem, which has received much attention due to its main challenges as distribution …
Y Molenbruch, K Braekers, A Caris - Annals of Operations Research, 2017 - Springer
Dial-a-ride problems consist of designing vehicle routes and time schedules in a system of demand-dependent, collective people transportation. In the standard problem, operational …
In this paper, we analyze the route efficiency trade-offs that emerge from combining first-mile pickup and last-mile delivery operations in an urban distribution system. We build on the …