Projection results for vehicle routing

DOI10.1007/s10107-005-0652-xzbMath1085.90032OpenAlexW2021041629WikidataQ57702313 ScholiaQ57702313MaRDI QIDQ2583125

Adam N. Letchford, Juan-José Salazar-González

Publication date: 13 January 2006

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-005-0652-x

zbMATH Keywords

Integer programmingVehicle routingProjection

Mathematics Subject Classification ID

Integer programming (90C10) Traffic problems in operations research (90B20)

Related Items

Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm, Layered graph approaches for combinatorial optimization problems, Stronger multi-commodity flow formulations of the capacitated vehicle routing problem, Branch-and-cut-and-price for multi-agent path finding, Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem, Stronger multi-commodity flow formulations of the (capacitated) sequential ordering problem, New techniques for cost sharing in combinatorial optimization games, The production routing problem: a review of formulations and solution algorithms, The traveling purchaser problem with time-dependent quantities, The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches, Load-dependent and precedence-based models for pickup and delivery problems, Comparison of formulations for the inventory routing problem, The arc-item-load and related formulations for the cumulative vehicle routing problem, Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route, A symmetry-free polynomial formulation of the capacitated vehicle routing problem, The close-open mixed vehicle routing problem, The vehicle routing problem with service level constraints, A matheuristic for the asymmetric capacitated vehicle routing problem, Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups, Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem, Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems, A new mixed integer linear model for a rich vehicle routing problem with docking constraints, Reachability cuts for the vehicle routing problem with time windows, Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem, Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints, Recent advances in vehicle routing exact algorithms, Polynomial-time separation of enhanced reverse multistar inequalities, Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation, New exact solution approaches for the split delivery vehicle routing problem, Combined route capacity and route length models for unit demand vehicle routing problems, Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems, The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time, Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network, The demand weighted vehicle routing problem, Exact algorithms for routing problems under vehicle capacity constraints, Formulations and valid inequalities for the heterogeneous vehicle routing problem, Unnamed Item, Robust branch-and-cut-and-price for the capacitated vehicle routing problem, A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery, A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading, The multi-vehicle probabilistic covering tour problem, Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation, Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange, Strong cuts from compatibility relations for the dial-a-ride problem, Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm, An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem, A branch-and-cut algorithm for the capacitated profitable tour problem, Generalized relax-and-fix heuristic

Uses Software

• VRP
• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A branch and bound algorithm for the capacitated vehicle routing problem
• Classification of travelling salesman problem formulations
• The complexity of facets (and some facets of complexity)
• A result on projection for the vehicle routing problem
• An analytical comparison of different formulations of the travelling salesman problem
• Geometric algorithms and combinatorial optimization
• A mixed-integer model for solving ordering problems with side constraints
• Multistars, partial multistars and the capacitated vehicle routing problem
• A new branch-and-cut algorithm for the capacitated vehicle routing problem
• 2-Path Cuts for the Vehicle Routing Problem with Time Windows
• The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
• A two-commodity flow formulation for the traveling salesman and the makespan problems with time windows
• Optimal Routing under Capacity and Distance Restrictions
• Minimum cuts and related problems
• A polyhedral study of the asymmetric traveling salesman problem with time windows
• Solving Multiple Knapsack Problems by Cutting Planes
• A catalog of steiner tree formulations
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• Integer Programming and Combinatorial Optimization
• A branch and cut approach to the cardinality constrained circuit problem.