Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs

DOI10.1002/net.20331zbMath1203.90043OpenAlexW4254771127MaRDI QIDQ3057117

Roberto Baldacci, Maria Battarra, Daniele Vigo

Publication date: 24 November 2010

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20331

zbMATH Keywords

vehicle routingbranch-and-cutfleet management

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Related Items

Thirty years of heterogeneous vehicle routing, A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location, A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation, A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet, Exact algorithms for routing problems under vehicle capacity constraints, Industrial aspects and literature survey: fleet composition and routing, Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty

Uses Software

• CPLEX
• CVRPSEP
• CVRPSP

Cites Work

• A comparison of techniques for solving the fleet size and mix vehicle routing problem
• A column generation approach to the heterogeneous fleet vehicle routing problem
• The fleet size and mix vehicle routing problem
• A tabu search heuristic for the heterogeneous fleet vehicle routing problem
• Multistars, partial multistars and the capacitated vehicle routing problem
• A sweep-based algorithm for the fleet size and mix vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• A new heuristic for the fleet size and mix vehicle routing problem
• Incorporating vehicle into the vehicle routing fleet composition problem
• Formulations and valid inequalities for the heterogeneous vehicle routing problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• The Truck Dispatching Problem
• The Vehicle Routing Problem
• The fleet size and mix vehicle routing problem with time windows
• A new heuristic for determining fleet size and composition
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• A heuristic column generation method for the heterogeneous fleet VRP
• Tabu search variants for the mix fleet vehicle routing problem
• New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation