Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
Annals of Operations Research - Special issue on Tabu search
Computers and Operations Research
A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet
Future Generation Computer Systems - Special issue: Bio-inspired solutions to parallel processing problems
A tabu search heuristic for the heterogenous fleet vehicle routing problem
Computers and Operations Research
EuroGP '98 Proceedings of the First European Workshop on Genetic Programming
Performance of Various Computers Using Standard Linear Equations Software
Performance of Various Computers Using Standard Linear Equations Software
Formulations and Valid Inequalities for the Heterogeneous Vehicle Routing Problem
Mathematical Programming: Series A and B
A column generation approach to the heterogeneous fleet vehicle routing problem
Computers and Operations Research
A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
Computers and Operations Research
Discrete Applied Mathematics
A unified exact method for solving different classes of vehicle routing problems
Mathematical Programming: Series A and B
Two memetic algorithms for heterogeneous fleet vehicle routing problems
Engineering Applications of Artificial Intelligence
Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem
Expert Systems with Applications: An International Journal
Invited Review: Industrial aspects and literature survey: Combined inventory management and routing
Computers and Operations Research
A parallel heuristic for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
Computers and Operations Research
Improved bounds for large scale capacitated arc routing problem
Computers and Operations Research
Hi-index | 0.00 |
This paper deals with the Heterogeneous Fleet Vehicle Routing Problem (HFVRP). The HFVRP is $\mathcal{NP}$ -hard since it is a generalization of the classical Vehicle Routing Problem (VRP), in which clients are served by a heterogeneous fleet of vehicles with distinct capacities and costs. The objective is to design a set of routes in such a way that the sum of the costs is minimized. The proposed algorithm is based on the Iterated Local Search (ILS) metaheuristic which uses a Variable Neighborhood Descent procedure, with a random neighborhood ordering (RVND), in the local search phase. To the best of our knowledge, this is the first ILS approach for the HFVRP. The developed heuristic was tested on well-known benchmark instances involving 20, 50, 75 and 100 customers. These test-problems also include dependent and/or fixed costs according to the vehicle type. The results obtained are quite competitive when compared to other algorithms found in the literature.