Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm

DOI10.1287/opre.2020.2033zbMath1466.90015OpenAlexW3020867067MaRDI QIDQ4994165

Michiel A. J. uit het Broek, Albert H. Schrotenboer, Leandro C. Coelho, Bolor Jargalsaikhan, Kees Jan Roodbergen

Publication date: 17 June 2021

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://pure.rug.nl/ws/files/169775515/opre.2020.2033.pdf

zbMATH Keywords

vehicle routingvalid inequalitiesbranch-and-cutasymmetricmultidepotupper-bound procedure

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items (2)

Crowdsourced humanitarian relief vehicle routing problem ⋮ The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods

Uses Software

• VRP
• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of recent research on location-routing problems
• Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
• Multi-depot multiple TSP: a polyhedral study and computational results
• Modeling and solving the mixed capacitated general routing problem
• A Branch-and-Cut method for the Capacitated Location-Routing Problem
• Location-routing: issues, models and methods
• Combined location-routing problems: A synthesis and future research directions
• Multistars, partial multistars and the capacitated vehicle routing problem
• Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm
• Resource constrained routing and scheduling: review and research prospects
• A survey of the standard location-routing problem
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets
• A unified exact method for solving different classes of vehicle routing problems
• New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP
• Projection results for vehicle routing
• A survey of variants and extensions of the location-routing problem
• An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
• A Polyhedral Approach to Simplified Crew Scheduling and Vehicle Scheduling Problems
• The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• Facets of the Asymmetric Traveling Salesman Polytope
• A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
• A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
• The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
• Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route
• Solving the asymmetric travelling salesman problem with time windows by branch-and-cut

This page was built for publication: Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm