Reachability cuts for the vehicle routing problem with time windows

DOI10.1016/J.EJOR.2005.04.022zbMath1137.90587OpenAlexW2150176315MaRDI QIDQ2432846

Jens Lysgaard

Publication date: 25 October 2006

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

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

zbMATH Keywords

time windowsprecedence constraintsrouting

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Traffic problems in operations research (90B20) Discrete location and assignment (90B80)

Related Items (13)

Lifted and local reachability cuts for the vehicle routing problem with time windows ⋮ Pricing routines for vehicle routing with time windows on road networks ⋮ Multi-commodity location-routing: flow intercepting formulation and branch-and-cut algorithm ⋮ A 2-stage method for a field service routing problem with stochastic travel and service times ⋮ A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks ⋮ The dial-a-ride problem with private fleet and common carrier ⋮ Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems ⋮ The vehicle routing problem with release dates and flexible time windows ⋮ Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints ⋮ Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems ⋮ Recent Models and Algorithms for One-to-One Pickup and Delivery Problems ⋮ A branch-and-cut algorithm for the inventory routing problem with pickups and deliveries ⋮ Strong cuts from compatibility relations for the dial-a-ride problem

Uses Software

• VRP
• CVRPSEP
• CVRPSP

Cites Work

• Unnamed Item
• An exact algorithm for the maximum clique problem
• Computational investigations of maximum flow algorithms
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• The precedence-constrained asymmetric traveling salesman polytope
• Projection results for vehicle routing
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut

This page was built for publication: Reachability cuts for the vehicle routing problem with time windows