How to deal with the VRPTW by using multi-agent coalitions

The vehicle routing problem with time windows (VRPTW) is a well known combinatorial optimization problem often met in many fields of industrial applications. We are interested in a coalition based multiagent model (Coal-VRP) for the VRPTW. However, this model presents some drawbacks due to its spatial and temporal complexity. In order to overcome these drawbacks while maintaining the solution quality, we propose in this paper a new version of this model called DyCoal-VRP. It is essentially based on dynamic generation of coalitions. An experimental validation of our model is achieved on the base of Solomon's benchmark.