A Parallel Hybrid Evolutionary Metaheuristic for the Period Vehicle Routing Problem

Abstract. This paper presents a Parallel Hybrid Evolutionary Metaheuristic for the Period Vehicle Routing Problem PVRP. The PRVP generalizes the classical Vehicle Routing Problem by extending the planning period from a single day to M days. The algorithm proposed is based on concepts used in Parallel Genetic Algorithms and Local Search Heuristics. The algorithm employs the island model in which the migration frequency must not be very high. The results of computational experiments carried out on problems taken from the literature indicate that the proposed approach outperforms existing heuristics in most cases.

• Type: Conference
• Year: 1999
• Where: IPPS
• Authors: Dalessandro Soares Vianna, Luiz Satoru Ochi, Lúcia Maria de A. Drummond
• Keywords: Distributed And Parallel Computing, Hybrid Evolutionary Metaheuristic, IPPS 1999, Outperforms Existing Heuristics, Vehicle Routing Problem