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 …

Reducing environmental impact, related regulations and potential for operational benefits
are the main reasons why companies share their returnable transport items (RTIs) among …

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

This paper aims to investigate the vehicle routing problem faced by a logistics service
provider that performs the last-mile delivery of large household appliances under the front …

In this paper, we adopt the bibliometric analysis software CiteSpace to analyze the research
status quo and evolution trend of pickup and delivery problem (PDP), an important real …

We present an efficient Neural Neighborhood Search (N2S) approach for pickup and
delivery problems (PDPs). In specific, we design a powerful Synthesis Attention that allows …

In this paper, we introduce Neural Collaborative Search (NCS), a novel learning-based
framework for efficiently solving pickup and delivery problems (PDPs). NCS pioneers the …

In this paper, we solve the pickup and delivery problem with time windows and last-in-first-
out (LIFO) loading. LIFO loading minimizes handling while unloading items from the vehicle …

This paper introduces the pickup and delivery traveling salesman problem with handling
costs (PDTSPH). In the PDTSPH, a single vehicle has to transport loads from origins to …

The green vehicle routing problem is a variation of the classic vehicle routing problem in
which the transportation fleet is composed of electric vehicles with limited autonomy in need …