A tabu search heuristic for the heterogenous fleet vehicle routing problem
Computers and Operations Research
A Genetic Algorithm for the Capacitated Arc Routing Problem and Its Extensions
Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Performance of Various Computers Using Standard Linear Equations Software
Performance of Various Computers Using Standard Linear Equations Software
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
Two memetic algorithms for heterogeneous fleet vehicle routing problems
Engineering Applications of Artificial Intelligence
MA|PM: memetic algorithms with population management
Computers and Operations Research
A GRASP×ELS approach for the capacitated location-routing problem
Computers and Operations Research
Evolutionary local search for the super-peer selection problem and the p-hub median problem
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
Computers and Operations Research
Computers and Operations Research
A memetic algorithm with population management (MA|PM) for the capacitated location-routing problem
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
A GRASP×ELS for the vehicle routing problem with basic three-dimensional loading constraints
Engineering Applications of Artificial Intelligence
Hi-index | 0.00 |
Routing Problems have been deeply studied over the last decades. Split procedures have proved their efficiency for those problems, especially within global optimization frameworks. The purpose is to build a feasible routing solution by splitting a giant tour into trips. This is done by computing a shortest path on an auxiliary graph built from the giant tour. One of the latest advances consists in handling extra resource constraints through the generation of labels on the nodes of the auxiliary graph. Lately, the development of a new generic split family based on a Depth First Search (DFS) approach during label generation has highlighted the efficiency of this new method for the routing problems, through extensive numerical evaluations on the location-routing problem. In this paper, we present a hybrid Evolutionary Local Search (hybrid ELS) for non-homogeneous fleet Vehicle Routing Problems (VRP) based on the application of split strategies. Experiments show our method is able to handle all known benchmarks, from Vehicle Fleet Mix Problems to Heterogeneous Fleet VRP (HVRP). We also propose a set of new realistic HVRP instances from 50 to more than 250 nodes coming from French counties. It relies on real distances in kilometers between towns. Since many classical HVRP instance sets are solved to optimality, this new set of instances could allow a fair comparative study of methods. The DFS split strategy shows its efficiency and attests the fact that it can be a promising line of research for routing problems including numerous additional constraints.