An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
From MaRDI portal
Publication:3098764
DOI10.1287/opre.1100.0881zbMath1233.90058OpenAlexW2082124504MaRDI QIDQ3098764
Roberto Baldacci, Aristide Mingozzi, Enrico Bartolini
Publication date: 18 November 2011
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1100.0881
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)
Related Items (45)
An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization ⋮ Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer ⋮ The pickup and delivery problem with time windows, multiple stacks, and handling operations ⋮ A comparison of column-generation approaches to the synchronized pickup and delivery problem ⋮ Branch-price-and-cut algorithms for the pickup and delivery problem with time windows and multiple stacks ⋮ A hybrid algorithm for the vehicle routing problem with pickup and delivery and three-dimensional loading constraints ⋮ Coordinating technician allocation and maintenance routing for offshore wind farms ⋮ An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen ⋮ Solving a selective dial-a-ride problem with logic-based Benders decomposition ⋮ An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines ⋮ Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity ⋮ An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem ⋮ A study on the pickup and delivery problem with time windows: matheuristics and new instances ⋮ Exact algorithms for the multi-pickup and delivery problem with time windows ⋮ Dial-a-ride problem: mixed integer programming revisited and constraint programming proposed ⋮ Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels ⋮ A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows ⋮ Optimization of gas metering maintenance services: A multiobjective vehicle routing problem with a set of predefined overlapping time windows ⋮ Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems ⋮ A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network ⋮ A generic exact solver for vehicle routing and related problems ⋮ Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands ⋮ Route efficiency implications of time windows and vehicle capacities in first- and last-mile logistics ⋮ Verification of Correctness of Parallel Algorithms in Practice ⋮ The Vehicle Routing Problem with Floating Targets: Formulation and Solution Approaches ⋮ Pickup and delivery problem with time windows: a new compact two-index formulation ⋮ A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands ⋮ The multi-pickup and delivery problem with time windows ⋮ A column generation approach for location-routing problems with pickup and delivery ⋮ Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem ⋮ Optimisation of maintenance routing and scheduling for offshore wind farms ⋮ Bidirectional labeling in column-generation algorithms for pickup-and-delivery problems ⋮ An on-demand same-day delivery service using direct peer-to-peer transshipment strategies ⋮ A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints ⋮ An exact solution method for a rich helicopter flight scheduling problem arising in offshore oil and gas logistics ⋮ A route decomposition approach for the single commodity split pickup and split delivery vehicle routing problem ⋮ An exact solution framework for a broad class of vehicle routing problems ⋮ Exact solutions for the collaborative pickup and delivery problem ⋮ A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes ⋮ Impact analysis of maritime cabotage legislations on liner hub-and-spoke shipping network design ⋮ A computational comparison of flow formulations for the capacitated location-routing problem ⋮ On the one-to-one pickup-and-delivery problem with time windows and trailers ⋮ Scheduling heterogeneous delivery tasks on a mixed logistics platform ⋮ A set covering based matheuristic for a real‐world city logistics problem ⋮ Designing vehicle routes for a mix of different request types, under time windows and loading constraints
This page was built for publication: An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
