A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes

DOI10.1016/j.ejor.2013.08.042zbMath1304.90039OpenAlexW1998559262MaRDI QIDQ2514736

Fabien Lehuédé, Olivier Péton, Renaud Masson, Stefan Ropke

Publication date: 3 February 2015

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2013.08.042

zbMATH Keywords

column generationtransfersbranch-and-cut-and-pricepickup and delivery problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (9)

The multi-vehicle profitable pickup and delivery problem ⋮ An adaptive tabu search algorithm embedded with iterated local search and route elimination for the bike repositioning and recycling problem ⋮ Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels ⋮ Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem ⋮ New mixed integer-programming model for the pickup-and-delivery problem with transshipment ⋮ A comparison of two meta-heuristics for the pickup and delivery problem with transshipment ⋮ The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach ⋮ Exact solutions for the collaborative pickup and delivery problem ⋮ Iterative Column Generation Algorithm for Generalized Multi-Vehicle Covering Tour Problem

Uses Software

• VRP
• CVRPSEP
• CVRPSP

Cites Work

• Unnamed Item
• The dial-A-ride problem with transfers
• Real-time split-delivery pickup and delivery time window problems with transfers
• Solving a school bus scheduling problem with integer programming
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
• A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
• The Vehicle Routing Problem
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
• Cutting planes for branch-and-price algorithms
• Two exact algorithms for the distance-constrained vehicle routing problem
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• Recent Models and Algorithms for One-to-One Pickup and Delivery Problems
• Minimum Makespan Multi-vehicle Dial-a-Ride
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• Shortest Path Problems with Resource Constraints
• The Pickup And Delivery Problem With Time Windows And Transshipment

This page was built for publication: A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes