The Vehicle Routing Problem with Time Windows is a complex combinatorial problem with many real-world applications in transportation and distribution logistics. Its main objective...
Abstract. Nowadays genetic algorithms stand as a trend to solve NPcomplete and NP-hard problems. In this paper, we present a new hybrid metaheuristic which uses Parallel Genetic Al...
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
A variety of hybrid genetic algorithms has been recently proposed to address the vehicle routing problem with time windows (VRPTW), a problem known to be NP-hard. However, very few...
In this paper we present SR-1, a simulation-based heuristic algorithm for the Capacitated Vehicle Routing Problem (CVRP). Given a CVRP instance, SR-1 uses an initial "good so...
Javier Faulin, Miquel Gilibert, Angel A. Juan, Xav...