A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment

Chapter 6: Pickup-and-Delivery Problems for Goods Transportation

“…On a related note, Venkateshan and Mathur [139] designed a specialized column generation algorithm for a variant of the PDVRP where multiple visits are required by the same or different vehicles to satisfy each request. Another interesting variant is the PDVRP with transshipment that was recently introduced by Qu and Bard [110] in the context of air freight transportation. A GRASP incorporating a reactive ALNS heuristic was proposed to solve the problem.…”

An Adaptive Large Neighborhood Search for an E-grocery Delivery Routing Problem

“…This ALNS aims to improve an initial feasible solution progressively by means of multiple removal (destroy) and insertion (repair) mechanisms competing in an adaptive environment to diversify and intensify the search. ALNS has been successfully implemented for solving many VRP variants including pickup and delivery problems with transshipment (Qu and Bard, 2012) and with vehicle transfers (Masson et al, 2013), cumulative capacitated VRP (Ribeiro and Laporte, 2012), pollution-routing problem (Demir et al, 2012), two-echelon VRP (Hemmelmayr et al, 2012), VRP with multiple routes (Azi et al, 2014), periodic inventory routing problem (Aksen et al, 2014), and production routing problem (Adulyasak et al, 2014). Due to its flexibility, the ALNS framework has been also applied to a wide range of problems such as the resource-constrained project scheduling problem (Muller, 2009), technician task scheduling in telecommunications industry (Cordeau et al, 2010), lot-sizing with setup times (Muller et al, 2012), consultation timetabling problem at Danish high schools (Kristiansen, 2013).…”

A matheuristic for routing real-world home service transport systems facilitating walking

“…Of special interest are VRPs with transfers or transshipments, where similar challenges are faced concerning feasibility testing and interdependencies as in our problem. Qu and Bard (2012) implement a propagation algorithm to check feasibility of insertions in an aircraft transport problem with transshipments. Masson et al (2014) model the feasibility problem for a DARP with transfers as a simple temporal problem and use the Bellman-FordCherkassky-Tarjan algorithm to solve it.…”