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

DOI10.1016/J.EJOR.2023.07.002MaRDI QIDQ6090149zbMATH OpenFDO

Authors Arne Schulz, Christian Pfeiffer

Publication date 14 November 2023

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1016/J.EJOR.2023.07.002

zbMATH Keywords

branch-and-cutdial-a-ride problemfixed pathsroutingvalid inequalities

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

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

Cited in

(6)

• Precedence-constrained shortest path
• A shift scheduling model for ridepooling services
• A tight formulation for the dial-a-ride problem
• The generator distribution problem for base stations during emergency power outage: a branch-and-price-and-cut approach
• Optimizing transport operations in a hybrid mobility system for rural-urban transport
• A multi-commodity two-echelon vehicle routing problem with commodity-wise split delivery and supply-demand mismatch

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)