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

DOI10.1016/J.DAM.2021.12.010zbMATH Open1483.90170OpenAlexW4200607477MaRDI QIDQ2065792FDOQ2065792

Authors: Sunil Morapitiye, Tamás Kis 

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

Recommendations

• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• An effective and fast heuristic for the dial-a-ride problem
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms

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)

Cites Work

• Network flows. Theory, algorithms, and applications.
• An inexact algorithm for the sequential ordering problem
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• The truck dispatching problem
• The vehicle routing problem
• Title not available (Why is that?)
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• Projection results for vehicle routing
• Applications of linear programming in the oil industry
• Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
• Title not available (Why is that?)
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• A branch and bound algorithm for the capacitated vehicle routing problem
• The precedence-constrained asymmetric traveling salesman polytope
• Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem
• Reachability cuts for the vehicle routing problem with time windows
• Lifted and local reachability cuts for the vehicle routing problem with time windows
• The pickup and delivery problem: Faces and branch-and-cut algorithm
• Pickup and delivery problem with time windows: a new compact two-index formulation
• Finding descriptions of polytopes via extended formulations and liftings

Cited In (2)

• The stop number minimization problem: complexity and polyhedral analysis
• Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems

Uses Software

• CPLEX
• VRP

This page was built for publication: Strong cuts from compatibility relations for the dial-a-ride problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065792)