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

DOI10.1016/J.EJOR.2023.07.002MaRDI QIDQ6090149FDOQ6090149

Authors: Arne Schulz, Christian Pfeiffer 

Publication date: 14 November 2023

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

zbMATH Keywords

branch-and-cutroutingvalid inequalitiesdial-a-ride problemfixed paths

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• A note on two problems in connexion with graphs
• An Algorithm for the Traveling Salesman Problem
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
• A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
• A Dynamic Programming Approach to Sequencing Problems
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Solution of a Large-Scale Traveling-Salesman Problem
• The truck dispatching problem
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
• An exact algorithm for the pickup and delivery problem with time windows
• Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
• Typology and literature review for dial-a-ride problems
• Reachability cuts for the vehicle routing problem with time windows
• A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
• A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
• The dial-a-ride problem with private fleet and common carrier
• The pickup and delivery problem with split loads and transshipments: a branch-and-cut solution approach
• An algorithm for the traveling salesman problem with pickup and delivery customers
• Solving a selective dial-a-ride problem with logic-based Benders decomposition
• Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
• Interrelated trips in the rural dial-a-ride problem with autonomous vehicles
• Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm
• Strong cuts from compatibility relations for the dial-a-ride problem
• An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
• Event-based MILP models for ridepooling applications
• A deterministic annealing local search for the electric autonomous dial-a-ride problem

This page was built for publication: Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems

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