A study of permutation crossover operators on the traveling salesman problem
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
A tabu search heuristic for the heterogenous fleet vehicle routing problem
Computers and Operations Research
Memetic algorithms: a short introduction
New ideas in optimization
Classical heuristics for the capacitated VRP
The vehicle routing problem
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
MA|PM: memetic algorithms with population management
Computers and Operations Research
Robust Branch-and-Cut-and-Price for the Capacitated 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
Context-Independent Scatter and Tabu Search for Permutation Problems
INFORMS Journal on Computing
Engineering Applications of Artificial Intelligence
Computers and Operations Research
Computers and Operations Research
A GRASP with evolutionary path relinking for the truck and trailer routing problem
Computers and Operations Research
A distribution network optimization problem for third party logistics service providers
Expert Systems with Applications: An International Journal
Engineering Applications of Artificial Intelligence
Multiobjective memetic algorithms for time and space assembly line balancing
Engineering Applications of Artificial Intelligence
Engineering Applications of Artificial Intelligence
Computers and Operations Research
Information Sciences: an International Journal
An Iterated Local Search heuristic for the Heterogeneous Fleet Vehicle Routing Problem
Journal of Heuristics
Computers and Industrial Engineering
Using graphical information systems to improve vehicle routing problem instances
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
A GRASP×ELS for the vehicle routing problem with basic three-dimensional loading constraints
Engineering Applications of Artificial Intelligence
Journal of Intelligent Manufacturing
Bi-Objective Bus Routing: An Application to School Buses in Rural Areas
Transportation Science
Computers and Operations Research
Vehicle routing problem with a heterogeneous fleet and time windows
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
The vehicle routing problem (VRP) plays an important role in the distribution step of supply chains. From a depot with identical vehicles of limited capacity, it consists in determining a set of vehicle trips of minimum total length, to satisfy the demands of a set of customers. In general, the number of vehicles used is a decision variable. The heterogeneous fleet VRP (HFVRP or HVRP) is a natural generalization with several vehicle types, each type being defined by a capacity, a fixed cost, a cost per distance unit and a number of vehicles available. The vehicle fleet mix problem (VFMP) is a variant with an unlimited number of vehicles per type. This paper presents two memetic algorithms (genetic algorithms hybridized with a local search) able to solve both the VFMP and the HVRP. They are based on chromosomes encoded as giant tours, without trip delimiters, and on an optimal evaluation procedure which splits these tours into feasible trips and assigns vehicles to them. The second algorithm uses a distance measure in solution space to diversify the search. Numerical tests on standard VFMP and HFVRP instances show that the two methods, especially the one with distance measure, compete with published metaheuristics and improve several best-known solutions.