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

DOI10.1016/j.cor.2005.02.023zbMath1086.90002OpenAlexW2070859419MaRDI QIDQ2489310

Lawrence Bodin, Roberto Baldacci, 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

Vehicle routingSet partitioningDual ascentLagrangean relaxation and column generation

Mathematics Subject Classification ID

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

Related Items (20)

Transport of skips between recycling centers and treatment facilities ⋮ 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 ⋮ A unified exact method for solving different classes of vehicle routing problems ⋮ Vehicle routing problems with alternative paths: an application to on-demand transportation ⋮ Metaheuristics with disposal facility positioning for the waste collection VRP with time windows ⋮ An integer optimality condition for column generation on zero-one linear programs ⋮ 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 ⋮ Integrated planning of loaded and empty container movements ⋮ Solution to chance constrained programming problem in swap trailer transport organisation based on improved simulated annealing algorithm ⋮ Recent advances in vehicle routing exact algorithms ⋮ Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows ⋮ An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts ⋮ Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems ⋮ Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement ⋮ The vehicle flow formulation and savings-based algorithm for the rollon-rolloff vehicle routing problem ⋮ Exact algorithms for routing problems under vehicle capacity constraints ⋮ A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem ⋮ An exact solution framework for a broad class of vehicle routing problems ⋮ The effects of the tractor and semitrailer routing problem on mitigation of carbon dioxide emissions

Uses Software

• CPLEX
• VRP
• CVRPSP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exact algorithm for the simplified multiple depot crew scheduling problem
• A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations
• An Exact Method for the Vehicle Routing Problem with Backhauls
• The Rollon–Rolloff Vehicle Routing Problem
• Two exact algorithms for the distance-constrained vehicle routing problem
• Optimal Routing under Capacity and Distance Restrictions
• State-space relaxation procedures for the computation of bounds to routing problems
• Optimal sequencing of skip collections and deliveries
• 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
• Integer Programming and Combinatorial Optimization
• A new method for solving capacitated location problems based on a set partitioning approach

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