The multi-compartment vehicle routing problem with flexible compartment sizes
DOI10.1016/J.EJOR.2015.05.020zbMATH Open1346.90121OpenAlexW226211203MaRDI QIDQ319854FDOQ319854
Maria Grazia Speranza, Gerhard Wäscher, Tino Henke
Publication date: 6 October 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2015.05.020
Recommendations
- A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
- Vehicle routing with compartments: applications, modelling and heuristics
- Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions
- Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
Approximation methods and heuristics in mathematical programming (90C59) Transportation, logistics and supply chain management (90B06)
Cites Work
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- The vehicle routing problem. Latest advances and new challenges.
- A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands
- Variable neighborhood search: Principles and applications
- Scheduling deliveries in vehicles with multiple compartments
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Vehicle routing with compartments: applications, modelling and heuristics
- Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing
- A heuristic for the multi-period petrol station replenishment problem
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
- Solving a fuel delivery problem by heuristic and exact approaches.
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- Vehicle Routing
- A combined ship scheduling and allocation problem
- Variable neighborhood search for the p-median
- A Tabu Search Heuristic for the Vehicle Routing Problem
- Computer Solutions of the Traveling Salesman Problem
Cited In (24)
- The supply of convenience stores: challenges of short-distance routing within the constraints of working time regulations
- Waste collection routing: a survey on problems and methods
- Solving the petroleum replenishment and routing problem with variable demands and time windows
- Product-oriented time window assignment for a multi-compartment vehicle routing problem
- Vehicle routing problems with multiple commodities: a survey
- A hybrid ant colony optimization algorithm for multi-compartment vehicle routing problem
- Efficient GRASP solution approach for the prisoner transportation problem
- A practical and robust approach for solving the multi-compartment vehicle routing problem under demand uncertainty using machine learning
- 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
- A Multi-compartment Vehicle Routing Problem for Livestock Feed Distribution
- Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions
- 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
- Same‐day deliveries in omnichannel retail: Integrated order picking and vehicle routing with vehicle‐site dependencies
- A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers
- A mixed truck and robot delivery approach for the daily supply of customers
- The prisoner transportation problem
- Vehicle selection for a multi-compartment vehicle routing problem
- The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips
- The multi-vehicle truck-and-robot routing problem for last-mile delivery
- An improved tabu search algorithm for the petrol-station replenishment problem with adjustable demands
- Optimizing routing and delivery patterns with multi-compartment vehicles
- Systematic review of the latest scientific publications on the vehicle routing problem
Uses Software
This page was built for publication: 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 Q319854)