The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem

DOI10.1016/J.COR.2005.02.023MaRDI QIDQ2489310zbMATH OpenOpenAlexFDO

Authors Roberto Baldacci, Lawrence Bodin, Aristide Mingozzi

Publication date 16 May 2006

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2005.02.023

zbMATH Keywords

Dual ascentLagrangean relaxation and column generationSet partitioningVehicle routing

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Combinatorial optimization (90C27) Applications of mathematical programming (90C90)

Recommendations

• The Rollon-Rolloff vehicle routing problem
• The vehicle flow formulation and savings-based algorithm for the rollon-rolloff vehicle routing problem
• The rollon-rolloff waste collection vehicle routing problem with time windows
• A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem
• The vehicle routing problem

Cites work

• A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
• A new method for solving capacitated location problems based on a set partitioning approach
• A Set Partitioning Approach to the Crew Scheduling Problem
• An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
• An exact algorithm for the simplified multiple depot crew scheduling problem
• An exact method for the vehicle routing problem with backhauls
• scientific article; zbMATH DE number 1749221 (Why is no real title available?)
• scientific article; zbMATH DE number 1749222 (Why is no real title available?)
• scientific article; zbMATH DE number 1749226 (Why is no real title available?)
• Integer Programming and Combinatorial Optimization
• Optimal Routing under Capacity and Distance Restrictions
• Optimal sequencing of skip collections and deliveries
• State-space relaxation procedures for the computation of bounds to routing problems
• The Rollon-Rolloff vehicle routing problem
• Two exact algorithms for the distance-constrained vehicle routing problem

Cited in

(25)

• Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows
• The vehicle flow formulation and savings-based algorithm for the rollon-rolloff vehicle routing problem
• Integrated planning of loaded and empty container movements
• Transport of skips between recycling centers and treatment facilities
• The effects of the tractor and semitrailer routing problem on mitigation of carbon dioxide emissions
• A unified exact method for solving different classes of vehicle routing problems
• An integer optimality condition for column generation on zero-one linear programs
• Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement
• Vehicle routing problems with alternative paths: an application to on-demand transportation
• Solution to chance constrained programming problem in swap trailer transport organisation based on improved simulated annealing algorithm
• The Rollon-Rolloff vehicle routing problem
• A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
• A long-haul freight transportation problem: synchronizing resources to deliver requests passing through multiple transshipment locations
• A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
• Metaheuristics with disposal facility positioning for the waste collection VRP with time windows
• Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems
• Waste collection routing: a survey on problems and methods
• A branch-and-cut algorithm for a skip pick-up and delivery problem
• Benders decomposition with delayed disaggregation for the active passive vehicle routing problem
• Fragment-based solution of two skip pickup and delivery problems
• Recent advances in vehicle routing exact algorithms
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
• Exact algorithms for routing problems under vehicle capacity constraints
• An exact solution framework for a broad class of vehicle routing problems

Describes a project that uses

Uses Software

• CPLEX
• VRP
• CVRPSP

This page was built for publication: The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489310)