Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes

DOI10.1016/j.ejor.2021.01.037zbMath1487.90111OpenAlexW3128372656MaRDI QIDQ2031089

Katrin Heßler

Publication date: 8 June 2021

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://download.uni-mainz.de/RePEc/pdf/Discussion_Paper_2007.pdf

zbMATH Keywords

routingbranch-price-and-cutmulti-compartment

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06)

Related Items (2)

Vehicle routing for milk collection with gradual blending: a case arising in Chile ⋮ A comprehensive risk assessment view on interval type-2 fuzzy controller for a time-dependent HazMat routing problem

Cites Work

• Unnamed Item
• The multi-compartment vehicle routing problem with flexible compartment sizes
• Improved bounds for large scale capacitated arc routing problem
• A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
• A class of algorithms which require nonlinear time to maintain disjoint sets
• Vehicle routing with compartments: applications, modelling and heuristics
• A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
• On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
• Solving a fuel delivery problem by heuristic and exact approaches.
• Scheduling deliveries in vehicles with multiple compartments
• Vehicle routing problems with loading constraints: state-of-the-art and future directions
• Solving the vehicle routing problem with multi-compartment vehicles for city logistics
• A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
• Upper and lower bounds for the vehicle-routing problem with private fleet and common carrier
• Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem
• A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
• A tabu search approach for the livestock collection problem
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands
• Classification, models and exact algorithms for multi-compartment delivery problems
• Solving a rich vehicle routing and inventory problem using column generation
• Dual Inequalities for Stabilized Column Generation Revisited
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
• A combined ship scheduling and allocation problem
• Dual-Optimal Inequalities for Stabilized Column Generation
• Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
• Optimal Routing under Capacity and Distance Restrictions
• Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem
• Column Generation
• An exact algorithm for the petrol station replenishment problem
• Shortest Path Problems with Resource Constraints

This page was built for publication: Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes