Vehicle routing with compartments: applications, modelling and heuristics
From MaRDI portal
Publication:657053
DOI10.1007/s00291-010-0194-3zbMath1229.90021OpenAlexW2087465622WikidataQ58205452 ScholiaQ58205452MaRDI QIDQ657053
Michael Piesche, Jens Gottlieb, Franz Rothlauf, Ulrich Derigs, Jochen Kalkoff, Ulrich Vogel
Publication date: 13 January 2012
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-010-0194-3
Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)
Related Items
An improved tabu search algorithm for the petrol-station replenishment problem with adjustable demands, Solving the petroleum replenishment and routing problem with variable demands and time windows, Rich vehicle routing problems: from a taxonomy to a definition, The multi-compartment vehicle routing problem with flexible compartment sizes, An iterated tabu search for the multi-compartment vehicle routing problem, A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem, The commodity-split multi-compartment capacitated arc routing problem, The prisoner transportation problem, A concise guide to existing and emerging vehicle routing problem variants, The fuel replenishment problem: a split-delivery multi-compartment vehicle routing problem with multiple trips, A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers, Efficient GRASP solution approach for the prisoner transportation problem, Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints, Disposable or reusable? Packaging strategy and pricing decision for fresh food considering environmental policies, Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem, A unified matheuristic for solving multi-constrained traveling salesman problems with profits, Product-oriented time window assignment for a multi-compartment vehicle routing problem, A heuristic and hybrid method for the tank allocation problem in maritime bulk shipping, Vehicle selection for a multi-compartment vehicle routing problem, Vehicle routing problem for multiple product types, compartments, and trips with soft time windows, A guided local search procedure for the multi-compartment capacitated arc routing problem, Vehicle routing problems with loading constraints: state-of-the-art and future directions, 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, An inventory-routing problem with the objective of travel time minimization, A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Nonfragile controller design for linear Markovian jumping parameters systems
- Applying the attribute based hill climber heuristic to the vehicle routing problem
- A general heuristic for vehicle routing problems
- A heuristic for the multi-period petrol station replenishment problem
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
- Models and algorithms for solving combined vehicle and crew scheduling problems with rest constraints: An application to road feeder service planning in air cargo transportation
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Variable neighborhood search
- Solving a fuel delivery problem by heuristic and exact approaches.
- Scheduling deliveries in vehicles with multiple compartments
- Record breaking optimization results using the ruin and recreate principle
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- The Vehicle Routing Problem
- A combined ship scheduling and allocation problem
- Savings by Split Delivery Routing
- Tabu Search—Part I
- Tabu Search—Part II
- A guide to vehicle routing heuristics
- An Exchange Heuristic for Routeing Problems with Time Windows
- A simple and efficient tabu search heuristic for solving the open vehicle routing problem
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
