Vehicle routing with compartments: applications, modelling and heuristics
From MaRDI portal
(Redirected from Publication:657053)
Recommendations
- The multi-compartment vehicle routing problem with flexible compartment sizes
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- Classification, models and exact algorithms for multi-compartment delivery problems
- An iterated tabu search for the multi-compartment vehicle routing problem
- Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions
Cites work
- scientific article; zbMATH DE number 3643061 (Why is no real title available?)
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- scientific article; zbMATH DE number 867338 (Why is no real title available?)
- A Heuristic Algorithm for the Vehicle-Dispatch Problem
- A combined ship scheduling and allocation problem
- A general heuristic for vehicle routing problems
- A guide to vehicle routing heuristics
- 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 simple and efficient tabu search heuristic for solving the open vehicle routing problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An Exchange Heuristic for Routeing Problems with Time Windows
- Applying the attribute based hill climber heuristic to the vehicle routing problem
- Fundamentals of scatter search and path relinking
- 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 heuristics for the vehicle routing problem
- New optimization heuristics. The great deluge algorithm and the record- to-record travel
- Nonfragile controller design for linear Markovian jumping parameters systems
- On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm
- Optimization by simulated annealing
- Record breaking optimization results using the ruin and recreate principle
- Savings by Split Delivery Routing
- Scheduling deliveries in vehicles with multiple compartments
- Solving a fuel delivery problem by heuristic and exact approaches.
- Tabu Search—Part I
- Tabu Search—Part II
- The vehicle routing problem
- Variable neighborhood search
Cited in
(34)- Solving the petroleum replenishment and routing problem with variable demands and time windows
- The supply of convenience stores: challenges of short-distance routing within the constraints of working time regulations
- Classification, models and exact algorithms for multi-compartment delivery problems
- An iterated tabu search for the multi-compartment vehicle routing problem
- A guided local search procedure for the multi-compartment capacitated arc routing problem
- Product-oriented time window assignment for a multi-compartment vehicle routing problem
- Vehicle routing problem for multiple product types, compartments, and trips with soft time windows
- Vehicle routing problems with multiple commodities: a survey
- Rich vehicle routing problems: from a taxonomy to a definition
- Efficient GRASP solution approach for the prisoner transportation problem
- Exact algorithms for the multi-compartment vehicle routing problem with 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 concise guide to existing and emerging vehicle routing problem variants
- A multi-compartment vehicle routing problem in cold-chain distribution
- A branch-and-cut algorithm for the multi-compartment vehicle routing problem with flexible compartment sizes
- Disposable or reusable? Packaging strategy and pricing decision for fresh food considering environmental policies
- Scheduling deliveries in vehicles with multiple compartments
- The commodity-split multi-compartment capacitated arc routing problem
- Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints
- A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers
- A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem
- 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
- A heuristic and hybrid method for the tank allocation problem in maritime bulk shipping
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem
- An inventory-routing problem with the objective of travel time minimization
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
- An improved tabu search algorithm for the petrol-station replenishment problem with adjustable demands
- Optimizing routing and delivery patterns with multi-compartment vehicles
- A unified matheuristic for solving multi-constrained traveling salesman problems with profits
- A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
- Partial Dominance in Branch-Price-and-Cut for the Basic Multicompartment Vehicle-Routing Problem
This page was built for publication: Vehicle routing with compartments: applications, modelling and heuristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q657053)
