A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
From MaRDI portal
Publication:976316
DOI10.1016/j.ejor.2010.02.037zbMath1188.90029OpenAlexW2083689835MaRDI QIDQ976316
Gabriel Gutiérrez-Jarpa, Guy Desaulniers, Vladimir Marianov, Gilbert Laporte
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/143093
transportationvehicle routingtime windowsbranch-and-pricedeliveries and selective pickupsshortest paths with resources
Related Items
The bi-objective insular traveling salesman problem with maritime and ground transportation costs, Multiobjective vehicle routing problem with fixed delivery and optional collections, Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach, Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels, A branch‐and‐price‐and‐cut algorithm for the truck‐drone routing problem with simultaneously delivery and pickup, Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach, A selective adaptive large neighborhood search heuristic for the profitable tour problem with simultaneous pickup and delivery services, Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem, Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints, Admission policies for the customized stochastic lot scheduling problem with strict due-dates, A survey of resource constrained shortest path problems: Exact solution approaches, A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants, New Notation and Classification Scheme for Vehicle Routing Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Lasso solution strategies for the vehicle routing problem with pickups and deliveries
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- Vehicle routing problems with simultaneous pick-up and delivery service.
- The single vehicle routing problem with deliveries and selective pickups
- A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- An Exact Method for the Vehicle Routing Problem with Backhauls
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Solving a vehicle-routing problem arising in soft-drink distribution
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- One-to-Many-to-One Single Vehicle Pickup and Delivery Problems
- An Exact Algorithm for the Vehicle Routing Problem with Backhauls
- An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- The single‐vehicle routing problem with unrestricted backhauls
- A Primer in Column Generation
- Shortest Path Problems with Resource Constraints
- Vehicle routing and reverse logistics: The vehicle routing problem with simultaneous delivery and pick-up
