A heuristic and lower bound for a multi-depot routing problem
Computers and Operations Research
MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows
New ideas in optimization
Heuristic solutions to multi-depot location-routing problems
Computers and Operations Research
An Improved Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem
Transportation Science
Evolutionary Algorithms for the Vehicle Routing Problem with Time Windows
Journal of Heuristics
Very large-scale vehicle routing: new test problems, algorithms, and results
Computers and Operations Research
Multi-Objective Genetic Algorithms for Vehicle Routing Problem with Time Windows
Applied Intelligence
A Hybrid Multiobjective Evolutionary Algorithm for Solving Vehicle Routing Problem with Time Windows
Computational Optimization and Applications
Sequential search and its application to vehicle-routing problems
Computers and Operations Research
Waste collection vehicle routing problem with time windows
Computers and Operations Research
A hybrid genetic algorithm for the multi-depot vehicle routing problem
Engineering Applications of Artificial Intelligence
A comparison of five heuristics for the multiple depot vehicle scheduling problem
Journal of Scheduling
A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
Computers and Operations Research
Computers and Operations Research
A hybrid genetic algorithm for the capacitated vehicle routing problem
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
A hybrid particle swarm optimization algorithm for the vehicle routing problem
Engineering Applications of Artificial Intelligence
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows
Computers and Operations Research
Efficient stochastic hybrid heuristics for the multi-depot vehicle routing problem
Robotics and Computer-Integrated Manufacturing
Parallel simulated annealing for the vehicle routing problem with time windows
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times
Journal of Computational and Applied Mathematics
A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem
Expert Systems with Applications: An International Journal
Localized genetic algorithm for vehicle routing problem with time windows
Applied Soft Computing
IEA/AIE'06 Proceedings of the 19th international conference on Advances in Applied Artificial Intelligence: industrial, Engineering and Other Applications of Applied Intelligent Systems
Hi-index | 0.00 |
This paper presents an efficient hybrid metaheuristic solution for multi-depot vehicle routing with time windows (MD-VRPTW). MD-VRPTW involves the routing of a set of vehicles with limited capacity from a set of depots to a set of geographically dispersed customers with known demands and predefined time windows. The present work aims at using a hybrid metaheuristic algorithm in the class of High-Level Relay Hybrid (HRH) which works in three levels and uses an efficient genetic algorithm as the main optimization algorithm and tabu search as an improvement method. In the genetic algorithm various heuristics incorporate local exploitation in the evolutionary search. An operator deletion- retrieval strategy is executed which shows the efficiency of the inner working of the proposed method. The proposed algorithm is applied to solve the problems of the standard Cordeau's Instances. Results show that proposed approach is quite effective, as it provides solutions that are competitive with the best known in the literature.