Robust branch-and-cut-and-price for the capacitated vehicle routing problem

From MaRDI portal

Publication:2492675

Jump to:navigation, search

DOI10.1007/s10107-005-0644-xzbMath1094.90050OpenAlexW2096796578MaRDI QIDQ2492675

Jens Lysgaard, Humberto J. Longo, Ricardo Fukasawa, Eduardo Uchoa, Renato F. Werneck, Marcelo Reis, Marcus Poggi de Aragão

Publication date: 14 June 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-0644-x

zbMATH Keywords

column generation branch-and-cut capacitated vehicle routing problem

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

Petroleum supply planning: reformulations and a novel decomposition algorithm, A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen, A hybrid genetic algorithm for the vehicle routing problem with three-dimensional loading constraints, Efficient elementary and restricted non-elementary route pricing, Min-Max vs. Min-Sum vehicle routing: a worst-case analysis, A memetic algorithm with dynamic population management for an integrated production-distribution problem, Stronger multi-commodity flow formulations of the capacitated vehicle routing problem, Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem, Exact Algorithms for the Chance-Constrained Vehicle Routing Problem, A hybrid approach for the vehicle routing problem with three-dimensional loading constraints, Improved bounds for large scale capacitated arc routing problem, A hybrid algorithm for a class of vehicle routing problems, A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands, Managing platelet supply through improved routing of blood collection vehicles, Enhanced branch-cut-and-price algorithm for heterogeneous fleet vehicle routing problems, Vehicle routing with probabilistic capacity constraints, A unified exact method for solving different classes of vehicle routing problems, Adapting the \textit{ng}-path relaxation for bike balancing problems, Exact algorithms for the double vehicle routing problem with multiple stacks, Improved branch-cut-and-price for capacitated vehicle routing, The arc-item-load and related formulations for the cumulative vehicle routing problem, A symmetry-free polynomial formulation of the capacitated vehicle routing problem, Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem, Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery, A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection, Simultaneously exploiting two formulations: an exact Benders decomposition approach, Combined maintenance and routing optimization for large-scale sewage cleaning, The close-open mixed vehicle routing problem, Routing problems with loading constraints, Comments on: Routing Problems with loading constraints, The vehicle routing problem with service level constraints, A note on branch-and-cut-and-price, Optimally solving the joint order batching and picker routing problem, Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems, Heuristic and exact algorithms for a min-max selective vehicle routing problem, Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem, Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems, A generic exact solver for vehicle routing and related problems, In-depth analysis of granular local search for capacitated vehicle routing, Improved lower bounds and exact algorithm for the capacitated arc routing problem, Column Generation Algorithms for the Capacitated m-Ring-Star Problem, Exact solution of network flow models with strong relaxations, An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem, 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, Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW, Exact hybrid algorithms for solving a bi-objective vehicle routing problem, Recent advances in vehicle routing exact algorithms, Optimization of vehicle routing with pickup based on multibatch production, Limited memory rank-1 cuts for vehicle routing problems, Solving elementary shortest-path problems as mixed-integer programs, A stochastic reverse logistics production routing model with environmental considerations, Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation, A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands, A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem, An efficient computational method for large scale surgery scheduling problems with chance constraints, 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, The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time, EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem, A branch-and-price algorithm for a vehicle routing with demand allocation problem, Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning, A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand, New benchmark instances for the capacitated vehicle routing problem, Solving the team orienteering arc routing problem with a column generation approach, The demand weighted vehicle routing problem, A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints, A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem, Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints, A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints, Exact algorithms for routing problems under vehicle capacity constraints, Minimum makespan vehicle routing problem with compatibility constraints, A library of local search heuristics for the vehicle routing problem, The pyramidal capacitated vehicle routing problem, A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem, Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs, Recent results on Arc Routing Problems: An annotated bibliography, Improved lower bounds for the split delivery vehicle routing problem, An exact solution framework for a broad class of vehicle routing problems, Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes, Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure, A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem, Branch-and-cut-and-price for the cardinality-constrained multi-cycle problem in kidney exchange, A computational comparison of flow formulations for the capacitated location-routing problem, Exact algorithms for the chance-constrained vehicle routing problem, Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams, Developing work schedules for an inter-city transit system with multiple driver types and fleet types, Exploiting sparsity in pricing routines for the capacitated arc routing problem, Last-Mile Shared Delivery: A Discrete Sequential Packing Approach, Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem, Solving robust bin-packing problems with a branch-and-price approach, New exact techniques applied to a class of network flow formulations, A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem, A branch-and-price algorithm for the capacitated arc routing problem with stochastic demands, A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints, A compact transformation of arc routing problems into node routing problems, An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem, Robust vehicle routing under uncertainty via branch-price-and-cut, Heuristics for multi-attribute vehicle routing problems: a survey and synthesis, A heuristic for cumulative vehicle routing using column generation, Consistency Cuts for Dantzig-Wolfe Reformulations, Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization, Approximating the chance-constrained capacitated vehicle routing problem with robust optimization, Column elimination for capacitated vehicle routing problems, A multi‐vehicle covering tour problem with speed optimization, A model‐based heuristic to the vehicle routing and loading problem, Estimating the marginal cost to deliver to individual customers, Exact and hyper‐heuristic solutions for the distribution‐installation problem from the VeRoLog 2019 challenge, Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows, Preprocessing to reduce vehicle capacity for routing problems, Stochastic crowd shipping last-mile delivery with correlated marginals and probabilistic constraints, Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem, The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands, Exact separation of the rounded capacity inequalities for the capacitated vehicle routing problem, The Distributionally Robust Chance-Constrained Vehicle Routing Problem, A Branch-and-Price Algorithm for Parallel Machine Scheduling Using ZDDs and Generic Branching, An Integer Linear Programming Local Search for Capacitated Vehicle Routing Problems, Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems, Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows, Combinatorial optimization and green logistics, Combinatorial optimization and green logistics, Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation, Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm, School bus routing—a column generation approach, A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants, Branch-Cut-and-Price for the Robust Capacitated Vehicle Routing Problem with Knapsack Uncertainty

Uses Software

Cites Work

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2492675&oldid=15195801"