Classification, models and exact algorithms for multi-compartment delivery problems
From MaRDI portal
Publication:2630232
DOI10.1016/j.ejor.2014.10.059zbMath1341.90013OpenAlexW2045558681MaRDI QIDQ2630232
Gilbert Laporte, Leandro C. Coelho
Publication date: 26 July 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.2014.10.059
Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)
Related Items
An improved tabu search algorithm for the petrol-station replenishment problem with adjustable demands, Modelling and solving the milk collection problem with realistic constraints, A variable neighborhood search for the multi-period collection of recyclable materials, An iterated tabu search for the multi-compartment vehicle routing problem, A transient stochastic simulation-optimization model for operational fuel planning in-theater, The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips, Formulations for the orienteering problem with additional constraints, A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers, Product-oriented time window assignment for a multi-compartment vehicle routing problem, Vehicle selection for a multi-compartment vehicle routing problem, MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results, A multi-compartment vehicle routing problem in cold-chain distribution, Optimizing routing and delivery patterns with multi-compartment vehicles, 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, A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
Uses Software
Cites Work
- Branch-and-cut algorithms for the split delivery vehicle routing problem
- The exact solution of several classes of inventory-routing problems
- Efficient symmetry breaking formulations for the job grouping problem
- A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
- A heuristic for the multi-period petrol station replenishment problem
- The petrol station replenishment problem with time windows
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
- Tank allocation problems in maritime bulk shipping
- Vehicle routing with split deliveries
- A tabu search heuristic for the undirected selective travelling salesman problem
- Heuristics for the multi-depot petrol station replenishment problem with time windows
- Industrial aspects and literature survey: Combined inventory management and routing
- A tabu search approach for the livestock collection problem
- Split delivery routing
- A combined ship scheduling and allocation problem
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- On the Complexity of Timetable and Multicommodity Flow Problems
- The Covering Tour Problem
- Solving the Orienteering Problem through Branch-and-Cut
- An exact algorithm for the petrol station replenishment problem
