Jakub Nalepa
ABSTRACT
Solving rich vehicle routing problems (VRPs) is a vital research topic due to their wide applicability. Although there exist various (meta)heuristics to tackle VRPs, most of them require a practitioner to tune their parameters before the execution. It is challenging in practice, since different algorithm variants often perform well for different scenarios. In this work, we present our adaptive heuristics for this task, in which we benefit from the adaptation schemes executed before the optimization. Extensive experiments backed up with statistical tests revealed that our heuristics is automatically adapted to effectively solve a given transportation problem, and retrieve routing schedules of the state-of-the-art quality.
- J. Nalepa and M. Blocho. Adaptive memetic algorithm for minimizing distance in vehicle routing problem with time windows. Soft Comput., 20(6):2309--2327, 2016. Google Scholar
Digital Library
- J. Nalepa and M. Blocho. Adaptive guided ejection search for pickup and delivery with time windows. Journal of Intelligent and Fuzzy Systems, 32(2): 1547--1559, 2017.Google ScholarCross Ref
Index Terms
- Parameter-less (meta)heuristics for vehicle routing problems
Recommendations
Applying hybrid meta-heuristics for capacitated vehicle routing problem
The capacitated vehicle routing problem (CVRP) is one of the most important problems in the optimization of distribution networks. The objective of CVRP, known demands on the cost of originating and terminating at a delivery depot, is to determine the ...
A general heuristic for vehicle routing problems
We present a unified heuristic which is able to solve five different variants of the vehicle routing problem: the vehicle routing problem with time windows (VRPTW), the capacitated vehicle routing problem (CVRP), the multi-depot vehicle routing problem (...
Iterated local search heuristics for the Vehicle Routing Problem with Cross-Docking
This work addresses the Vehicle Routing Problem with Cross-Docking (VRPCD). The problem consists in defining a minimum cost set of routes for a fleet of vehicles that meets the demands of products for a set of suppliers and customers. The vehicles leave ...
Comments