Resolving a vehicle routing problem with heterogeneous fleet, mixed backhauls and time windows using cuckoo behaviour approach

摘要

The vehicle routing problem (VRP) is one of the most famous NP-hard combinatorial optimisation problems. The use of exact methods for large instances of the problem, is not efficient. Thus, we propose in this paper, to solve a rarely studied case of VRP problem called vehicle routing problem with heterogeneous fleet, mixed backhauls and time windows (HVRPMBTW), using approximate method named cuckoo search algorithm. Our results show the effectiveness of this algorithm.