Samenvatting
The purpose of this paper is to present a coalition based multi-agent model for the Vehicle Routing Problem with Time Windows, which is one of the most important ones in distribution and transportation. The VRPTW objective is to esign least cost routes from one depot to a set of customers. A fleet of homogeneous vehicles performs the routes to serve all the customers, while respecting capacity and time window constraints. The proposed model is detailed, illustrated through a numerical example, experimented on the base of Solomon's benchmark and compared to the optimal solution. For the covering abstract see ITRD E128680.