A Hybrid Genetic Algorithm for the Vehicle Routing Problem with Time Windows

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 genetic-based approaches exploit implicit knowledge provided by the structure of the intermediate solutions computed during the evolutionary process to explore the solution space. This paper presents a new hybrid genetic algorithm for VRPTW. It investigates the impact of using explicitly domain knowledge and a priori knowledge/characteristics about expected solutions during the recombination and mutation phases of the algorithm. Basic principles borrow from recent hybrid and standard genetic algorithms, and features of well-known heuristics to drive the search process. Designed to support timeconstrained reasoning tasks, the procedure is intended to be conceptually simple, easy to implement and allow fast computation of near-optimal solution. A computational experiment has been conducted to compare the perfo...

• Type: Conference
• Year: 1998
• Where: AI
• Authors: Jean Berger, Martin Salois, Regent Begin
• Keywords: AI 1998, Artificial Intelligence, Hybrid Genetic Algorithm, Standard Genetic Algorithms, Vehicle Routing Problem