Multi-objective optimisation using genetic algorithm based clustering for multi-depot heterogeneous fleet vehicle routing problem with time windows

Efficient routing and scheduling of vehicles has significant economic implications for both the public and private sectors. For this purpose, we propose in this study a decision support system which aims to optimise the classical capacitated vehicle routing problem by considering the existence of different vehicle types (with distinct capacities and costs) and multiple available depots, that we call the multi-depot heterogeneous vehicle routing problem with time window (MDHVRPTW) by respecting a set of criteria including: schedules requests from clients, the heterogeneous capacity of vehicles...., and we solve this problem by proposing a new scheme based on the application of the bio-inspired genetic algorithm heuristics and by embedding a clustering algorithm within a VRPTW optimisation frame work, that we will specify later. Computational experiments with the benchmark test instances confirm that our approach produces acceptable quality solutions compared with the best previous results in similar problems in terms of generated solutions and processing time. Experimental results prove that our proposed genetic algorithm is effective in solving the MDHVRPTW problem and hence has a great potential.