Modern heuristic techniques for combinatorial problems
Computers and Operations Research
Tabu Search
The Rollon--Rolloff Vehicle Routing Problem
Transportation Science
Performance of Various Computers Using Standard Linear Equations Software
Performance of Various Computers Using Standard Linear Equations Software
Routing Optimization for Waste Management
Interfaces
Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows
Applied Intelligence
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Waste collection vehicle routing problem with time windows
Computers and Operations Research
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
Computers and Operations Research
INFORMS Journal on Computing
Waste collection vehicle routing problem with time windows using multi-objective genetic algorithms
CI '07 Proceedings of the Third IASTED International Conference on Computational Intelligence
Improved route planning and scheduling of waste collection and transport
Expert Systems with Applications: An International Journal
Mathematical and Computer Modelling: An International Journal
Development of a fuel consumption optimization model for the capacitated vehicle routing problem
Computers and Operations Research
A memetic algorithm for the travelling salesperson problem with hotel selection
Computers and Operations Research
A hybrid metaheuristic approach for the rollon-rolloff vehicle routing problem
Computers and Operations Research
Scheduling a log transport system using simulated annealing
Information Sciences: an International Journal
Hi-index | 0.01 |
In this problem there is a set of waste disposal facilities, a set of customers at which waste is collected and an unlimited number of homogeneous vehicles based at a single depot. Empty vehicles leave the depot and collect waste from customers, emptying themselves at the waste disposal facilities as and when necessary. Vehicles return to the depot empty. We take into consideration time windows associated with customers, disposal facilities and the depot. We also have a driver rest period. The problem is solved heuristically. A neighbour set is defined for each customer as the set of customers that are close, but with compatible time windows. A procedure that attempts to fully utilise a vehicle is used to obtain an initial solution, with this initial solution being improved using an interchange procedure. We present two metaheuristic algorithms using tabu search and variable neighbourhood search that are based around the neighbour sets. We also present a metaheuristic based on variable neighbourhood tabu search, where the variable neighbourhood is searched via tabu search. Computational results are presented for publicly available waste collection problems involving up to 2092 customers and 19 waste disposal facilities, which indicate that our algorithms produce better quality solutions than previous work presented in the literature.