A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes

DOI10.1007/S10479-018-2938-4MaRDI QIDQ2327675zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 15 October 2019

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-018-2938-4

zbMATH Keywords

vehicle routingbranch-and-cut algorithmmultiple compartmentswaste collection

Mathematics Subject Classification ID

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

Recommendations

• The multi-compartment vehicle routing problem with flexible compartment sizes
• Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes
• Vehicle routing with compartments: applications, modelling and heuristics
• Classification, models and exact algorithms for multi-compartment delivery problems
• Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions

Cites work

• A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
• A combined ship scheduling and allocation problem
• A heuristic for the multi-period petrol station replenishment problem
• A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
• A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
• A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands
• A variable neighborhood search for the multi-period collection of recyclable materials
• Classification, models and exact algorithms for multi-compartment delivery problems
• On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
• On the capacitated vehicle routing problem
• Polyhedral study of the capacitated vehicle routing problem
• Scheduling deliveries in vehicles with multiple compartments
• Solving a fuel delivery problem by heuristic and exact approaches.
• The multi-compartment vehicle routing problem with flexible compartment sizes
• The vehicle routing problem. Latest advances and new challenges.
• Vehicle Routing
• Vehicle routing with compartments: applications, modelling and heuristics

Cited in

(13)

• Vehicle routing problems with multiple commodities: a survey
• Pickup and delivery problem with incompatibility constraints
• A hybrid ant colony optimization algorithm for multi-compartment vehicle routing problem
• Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes
• A genetic algorithm for the multi-compartment vehicle routing problem with stochastic demands and flexible compartment sizes
• Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions
• The multi-compartment vehicle routing problem with flexible compartment sizes
• A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
• The commodity-split multi-compartment capacitated arc routing problem
• A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers
• A column‐generation‐based approach to fleet design problems mixing owned and hired vehicles
• Optimizing routing and delivery patterns with multi-compartment vehicles
• Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem

Describes a project that uses

Uses Software

• VRP

This page was built for publication: A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes

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