Multicriteria pickup and delivery problem with transfer opportunity

An adaptive large neighborhood search heuristic for the Pickup and Delivery Problem with Time Windows and Scheduled Lines

“…Shang and Cuff [30] proposed an insertion heuristic algorithm to solve instances with up to 167 requests for the PDP-T. Cortes et al [7] proposed an exact decomposition method, namely Branch-and-Cut (B&C), and solved PDP-T instances with up to six requests. Moreover, Masson et al [22,23] proposed an ALNS to solve PDP-T and DARP-T, respectively.…”

Recent Developments in Modeling and Solving the Split Delivery Vehicle Routing Problem

“…For this instance, the authors' heuristic produces a solution that services all shipments while using fewer vehicles and reducing average travel time by over 75% when compared with the results of Shang and Cuff [25]. They also test their heuristic on new instances that incorporate real-time events into the first instance.…”

“…Thangiah et al [29] test their heuristic on a static instance (no real-time events) of 159 shipments given by Shang and Cuff [25]. For this instance, the authors' heuristic produces a solution that services all shipments while using fewer vehicles and reducing average travel time by over 75% when compared with the results of Shang and Cuff [25].…”

“…Thangiah et al [29] develop a heuristic for solving the SDPDTWP that is based on the work of Shang and Cuff [25]. First, the number of vehicles is determined and shipments are inserted into routes.…”

The Dial-A-Ride Problem with Transfers

“…The author propose two heuristics for this problem. Shang and Cuff [14] present a heuristic for a PDPT in which every vertex can be used to perform a transfer. In this work, the transfer operation can be viewed as a recourse policy, as transfers are used only if the insertion of a request into the solution requires the use of an additional vehicle.…”