A hybrid Algorithm for Large-Scale Vehicle Routing Problem in Real Traffic Condition

In this paper, Large-Scale Vehicle Routing Problem in Real Traffic Condition (LSVRPRTC) is studied. In this kind of problem the client demand and the presence of the client are assumed to certain. The service vehicle returns to the depot whenever its capacity is attained or exceeded, and it is resumed that its collections along the planned route. After describing the preliminaries, a mathematical formulation is developed. Multi-Clustering algorithm (MC), as a kind of two-phase algorithm, is proposed for this intractable problem in order to obtain optimal or approximate optimal solutions with minimum total cost. Computational examples on a group of instances are given, showing the proposed approach is not only a simple but effective way to solve such problems.