scientific article; zbMATH DE number 1452992
In this work the static and deterministic basic version of the Vehicle Routing Problem (VRP), known as the Capacited VRP (CVRP) is considered. Its aim is to provide an update of that survey, describing the algorithms recently proposed for the exact solution of CVRP both for the case with symmetric and asymmetric cost matrices. Up to the end of the last decade the most effective exact approaches for the CVRP were mainly branch-and-bound algorithms using basis relaxations. Recently, more sophistical bounds were proposed, as those based on Lagrangian relaxations or on the additive approach, which increased the size of the problems that can be solved to optimality by branch-and-bound. There are treated separately problems with symmetric and asymmetric cost matrices. The work consists of eight sections. The first section is an introduction. In Sections 1.2 and 1.3 a detailed description of CVRP as a graph theoretic problem is given and also, some basic reduction rules are described. In Section 1.4 the case is considered where the cost matrix is asymmetric, illustrating some branch-and-bound algorithms. Some exact methods for the more widely studied CVRP with symmetric cost matrix are presented. Section 1.5 examines the algorithms based on branch-and-bound. In Section 1.6 the main ingredients of the branch-and-cut algorithm proposed by \textit{G. Cornuéjols} and \textit{F. Harche} [Math. Program. 60 A, 21-51 (1993; Zbl 0790.90029)] and some recent results in this field are discussed. In Section 1.7 some exact approaches based on set-partitioning formulations are examined. In 1.8 some conclusions are given and some future directions of research are proposed. For the entire collection see [Zbl 0933.00021].
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- Recent advances in vehicle routing exact algorithms
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- A practical approach for robust and flexible vehicle routing using metaheuristics and Monte Carlo sampling
- Heuristic solutions to multi-depot location-routing problems
- Truck routing and scheduling
- Optimization problems with flexible objectives: a general modeling approach and applications
- The selective traveling salesman problem with emission allocation rules
- The complexity landscape of decompositional parameters for ILP
- Selective and periodic inventory routing problem for waste vegetable oil collection
- A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP
- Solving the vehicle routing problem with adaptive memory programming methodology
- A cooperative parallel meta-heuristic for the vehicle routing problem with time windows
- Linear formulations for the vehicle routing problem with synchronization constraints
- A simple and effective evolutionary algorithm for the vehicle routing problem
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
- A lower bound for the adaptive two-echelon capacitated vehicle routing problem
- Comparison of anticipatory algorithms for a dial-a-ride problem
- Deep infeasibility exploration method for vehicle routing problems
- A generic exact solver for vehicle routing and related problems
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
- A hybrid adaptive iterated local search with diversification control to the capacitated vehicle routing problem
- A generic exact solver for Vehicle Routing and related problems
- Reoptimization framework and policy analysis for maritime inventory routing under uncertainty
- Dynamic vehicle routing using genetic algorithms
- A unified exact method for solving different classes of vehicle routing problems
- An exponential (matching based) neighborhood for the vehicle routing problem
- Sequential search and its application to vehicle-routing problems
- Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- Modelling the mobile target covering problem using flying drones
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure
- Exact solutions of some optimization problems of transport logistics
- Selfish transportation games
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- Approximability of the minimum-weight \(k\)-size cycle cover problem
- A heuristic algorithm for a supply chain's production-distribution planning
- Approximation schemes for Euclidean vehicle routing problems with time windows
- Polynomial time approximation scheme for single-depot Euclidean capacitated vehicle routing problem
- What you should know about the vehicle routing problem
- From single-objective to multi-objective vehicle routing problems: motivations, case studies, and methods
- scientific article; zbMATH DE number 3914114 (Why is no real title available?)
- scientific article; zbMATH DE number 3989085 (Why is no real title available?)
- A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem
- The school bus problem on trees
- scientific article; zbMATH DE number 4047425 (Why is no real title available?)
- Exact solutions to the transportation problem on the line
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs
- Exact hybrid algorithms for solving a bi-objective vehicle routing problem
- The school bus routing and scheduling problem with transfers
- A set‐partitioning‐based exact algorithm for the vehicle routing problem
- Local search algorithms for multiple-depot vehicle routing and for multiple traveling salesman problems with proved performance guarantees
- Scheduling of parallel machines with sequence-dependent batches and product incompatibilities in an automotive glass facility
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing
- A new model approach on cost-optimal charging infrastructure for electric-drive vehicle fleets
- Combinatorial optimization and green logistics
- Dynamic programming based metaheuristics for the dial-a-ride problem
- The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands
- Bridging operations research and machine learning for service cost prediction in logistics and service industries
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- Flow-based integer linear programs to solve the weekly log-truck scheduling problem
- An optimization approach for communal home meal delivery service: A case study
- An approximation algorithm for the pickup and delivery vehicle routing problem on trees
- Finished-vehicle transporter routing problem solved by loading pattern discovery
- Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics
- Synchronized routing of seasonal products through a production/distribution network
- Recent advances in vehicle routing exact algorithms
- EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem
- Exact algorithms for routing problems under vehicle capacity constraints
- An exact solution framework for a broad class of vehicle routing problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4955264)