Particle Evolutionary Swarm Multi-Objective Optimization for Vehicle Routing Problem with Time Windows

The Vehicle Routing Problem with Time Windows (VRPTW), is an extension to the standard vehicle routing problem. VRPTW includes an additional constraint that restricts every customer to be served within a given time window. An approach for the VRPTW with the next three objectives is presented: 1)total distance (or time), 2)total waiting time, 3)number of vehicles. A data mining strategy, namely space partitioning, is adopted in this work. Optimal routes are extracted as features hidden in variable size regions where depots and customers are located. This chapter proposes the sector model for partitioning the space into regions. A new hybrid Particle Swarm Optimization algorithm (PSO), and combinatorial operators ad-hoc with space partitioning are described. A set of well-known benchmark functions in VRPTW are used to compare the effectiveness of the proposed method. The results show the importance of examining characteristics of a set of non-dominated solutions, that fairly consider the three dimensions, when a user should select only one solution according to problem conditions.