Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban

摘要

Highlights ? The paper deals with a vehicle routing problem with loading constraints. ? We consider routing with pickup and deliveries and packing of three-dimensional items. ? Reloading ban is a special packing constraint to prevent reloading effort. ? A hybrid algorithm is proposed based on large neighborhood search and tree search. ? The hybrid algorithm is tested by means of 54 benchmark instances.