Strong cuts from compatibility relations for the dial-a-ride problem

DOI10.1016/j.dam.2021.12.010zbMath1483.90170OpenAlexW4200607477MaRDI QIDQ2065792

Tamás Kis, Sunil Morapitiye

Publication date: 13 January 2022

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2021.12.010

zbMATH Keywords

cutting planespickup and delivery problemexact separationedge-polytope

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06)

Related Items

Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems

Uses Software

• CPLEX
• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
• Lifted and local reachability cuts for the vehicle routing problem with time windows
• A branch and bound algorithm for the capacitated vehicle routing problem
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• An inexact algorithm for the sequential ordering problem
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• Pickup and delivery problem with time windows: a new compact two-index formulation
• The precedence-constrained asymmetric traveling salesman polytope
• Reachability cuts for the vehicle routing problem with time windows
• Projection results for vehicle routing
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• Applications of Linear Programming in the Oil Industry
• Finding Descriptions of Polytopes via Extended Formulations and Liftings
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows