Artificial intelligence heuristics in solving vehicle routing problems with time window constraints

Abstract

This paper describes the authors’ research on various heuristics in solving vehicle routing problem with time window constraints (VRPTW) to near optimal solutions. VRPTW is NP-hard problem and best solved to near optimum by heuristics. In the vehicle routing problem, a set of geographically dispersed customers with known demands and predefined time windows are to be served by a fleet of vehicles with limited capacity. The optimized routines for each vehicle are scheduled as to achieve the minimal total cost without violating the capacity and time window constraints. In this paper, we explore different hybridizations of artificial intelligence based techniques including simulated annealing, tabu search and genetic algorithm for better performance in VRPTW. All the implemented hybrid heuristics are applied to solve the Solomon's 56 VRPTW with 100-customer instances, and yield 23 solutions competitive to the best solutions published in literature according to the authors’ best knowledge.