Journal of Computational Physics
Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
Computers and Operations Research
Memetic algorithms: a short introduction
New ideas in optimization
Record breaking optimization results using the ruin and recreate principle
Journal of Computational Physics
The vehicle routing problem
Scheduling Deliveries in Vehicles with Multiple Compartments
Journal of Global Optimization
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
CP '98 Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming
Stochastic Local Search: Foundations & Applications
Stochastic Local Search: Foundations & Applications
A general heuristic for vehicle routing problems
Computers and Operations Research
A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem
Transportation Science
A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem
Computers and Operations Research
Improved packing and routing of vehicles with compartments
EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Variable Neighborhood Search heuristic for the Inventory Routing Problem in fuel delivery
Expert Systems with Applications: An International Journal
Truck and trailer routing-Problems, heuristics and computational experience
Computers and Operations Research
Computers and Operations Research
Missing from the model: orders, drivers, tractors and trailers and non-linear loading
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Survey of Green Vehicle Routing Problem: Past and future trends
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
Despite the vast amount of literature about vehicle routing problems, only very little attention has been paid to vehicles with compartments that allow transportation of inhomogeneous products on the same vehicle, but in different compartments. We motivate a general vehicle routing problem with compartments that is essential for several industries, like the distribution of food or petrol. We introduce a formal model, an integer program formulation and a benchmark suite of 200 instances. A solver suite of heuristic components is presented, which covers a broad range of alternative approaches for construction, local search, large neighbourhood search and meta-heuristics. The empirical results for the benchmark instances identify effective algorithmic setups as well as essential components for achieving high solution quality. In a comparison on 23 specific and combinatorially less complex instances taken from literature, our algorithm showed to be competitive.