6.1▪ Introduction Pickup-and-Delivery Problems (PDPs) constitute an important family of
routing problems in which goods or passengers have to be transported from different origins …

Distributors are faced with loading constraints in their route planning, eg, multi-dimensional
packing constraints, unloading sequence constraints, stability constraints and axle weight …

We consider difficult combinatorial optimization problems arising in transportation logistics
when one is interested in optimizing both the routing of vehicles and the loading of goods …

The traveling salesman problem (TSP) is an NP complete problem with potential
applications. Thus far, numerous approaches have been proposed to solve the TSP …

This paper addresses a recently practical combinatorial problem named Three-Dimensional
Loading Capacitated Vehicle Routing Problem, which combines three-dimensional loading …

This paper proposes models and algorithms for the pickup and delivery vehicle routing
problem with time windows and multiple stacks. Each stack is rear-loaded and is operated in …

In this paper, we introduce, model and solve the pickup and delivery problem with time
windows, multiple stacks, and handling operations (PDPTWMS-H). In the PDPTWMS-H, a …

Handcrafting heuristics for solving complex planning tasks (eg, NP-hard combinatorial
optimization (CO) problems) is a common practice but requires extensive domain …

In this paper, we introduce and study the capacitated vehicle routing problem with sequence-
based pallet loading and axle weight constraints. To the best of our knowledge, it is the first …

We extend the traveling salesman problem with pickup and delivery and LIFO loading
(TSPPDL) by considering two additional factors, namely the use of multiple vehicles and a …