A branch-and-cut algorithm for vehicle routing problems

DOI10.1007/BF02085634zbMath0815.90062OpenAlexW2017555839MaRDI QIDQ1339118

J. R. Araque G., Gautham K. Kudva, Thomas L. Morin, Joseph F. Pekny

Publication date: 3 July 1995

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

Full work available at URL: https://doi.org/10.1007/bf02085634

zbMATH Keywords

vehicle routingbranch-and-cutfacetspolyhedral theorypath- partitioning

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Related Items

An exact algorithm for a vehicle-and-driver scheduling problem, Routing problems: A bibliography, The exponential multi-insertion neighborhood for the vehicle routing problem with unit demands, New mathematical models of the generalized vehicle routing problem and extensions, Revisiting the Hamiltonian \(p\)-median problem: a new formulation on directed graphs and a branch-and-cut algorithm, An efficient transformation of the generalized vehicle routing problem, Minimizing customers' waiting time in a vehicle routing problem with unit demands, Combined route capacity and route length models for unit demand vehicle routing problems, New benchmark instances for the capacitated vehicle routing problem, Branch and cut methods for network optimization, Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Exact and heuristic algorithms for solving the generalized vehicle routing problem with flexible fleet size, A global MILP model for FMS scheduling, Stronger \(K\)-tree relaxations for the vehicle routing problem, Separating capacity constraints in the CVRP using tabu search, Two-stage vehicle routing problem with arc time windows: a mixed integer programming formulation and a heuristic approach

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solution of large-scale symmetric travelling salesman problems
• An efficient algorithm for the minimum capacity cut problem
• A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems
• The Truck Dispatching Problem
• Applications of Linear Programming in the Oil Industry
• A Cutting Plane Algorithm for the Linear Ordering Problem
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Optimal Routing under Capacity and Distance Restrictions
• Facets of the linear ordering polytope
• Solving matching problems with linear programming
• Strong Formulations for Multi-Item Capacitated Lot Sizing
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Implementing vehicle routing algorithms
• A Heuristic Algorithm for the Vehicle-Dispatch Problem