An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
From MaRDI portal
Publication:5321991
DOI10.1287/opre.1040.0111zbMath1165.90353OpenAlexW2159203019MaRDI QIDQ5321991
Roberto Baldacci, Aristide Mingozzi, Eleni Hadjiconstantinou
Publication date: 17 July 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1040.0111
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Traffic problems in operations research (90B20)
Related Items
A dynamic tree algorithm for peer-to-peer ridesharing matching, A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem, STUDY ON BURST-b WEIGHT DISTRIBUTION OF CYCLIC CODES, Stronger multi-commodity flow formulations of the capacitated vehicle routing problem, Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem, An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size, The vehicle rescheduling problem, The dynamic multiperiod vehicle routing problem with probabilistic information, Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations, Solving the multi-vehicle multi-covering tour problem, A bi-objective model for the used oil location-routing problem, A branch-and-cut algorithm for the time window assignment vehicle routing problem, A unified exact method for solving different classes of vehicle routing problems, A new matheuristic approach for the multi-depot vehicle routing problem with inter-depot routes, Routing and scheduling field service operation by P-graph, The vehicle routing problem with service level constraints, A branch-and-cut embedded matheuristic for the inventory routing problem, Heuristic and exact algorithms for a min-max selective vehicle routing problem, Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses, Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows, Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems, A survey of attended home delivery and service problems with a focus on applications, Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands, Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints, Exact hybrid algorithms for solving a bi-objective vehicle routing problem, Recent advances in vehicle routing exact algorithms, Polynomial-time separation of enhanced reverse multistar inequalities, An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts, Combined route capacity and route length models for unit demand vehicle routing problems, An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems, Disruption management in vehicle routing and scheduling for road freight transport: a review, The demand weighted vehicle routing problem, Development of a fuel consumption optimization model for the capacitated vehicle routing problem, Exact algorithms for routing problems under vehicle capacity constraints, The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem, Formulations and valid inequalities for the heterogeneous vehicle routing problem, A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery, Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs, A personalized walking bus service requiring optimized route decisions: a real case, Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation, An exact solution framework for a broad class of vehicle routing problems, A computational comparison of flow formulations for the capacitated location-routing problem, Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem, Projection results for vehicle routing, A new ILP-based refinement heuristic for vehicle routing problems
Uses Software
