查看文章

The delivery of goods is a crucial operational process, which is at the heart of the supply chain and logistic fields. Numerous companies have known a significant drop of their running costs due to the efficient coping with distribution networks. Therefore, several studies in operational research area are interested in modeling and solving transportation problems, especially vehicle routing problems (VRPs). Due to the NP-Hardness of VRPs, various state-of-the-art metaheuristics were developed to generate near-optimal solutions in a reasonable computational time.

Against this background, we study in this paper the capacitated vehicle routing problem with distance constraints (DCVRP) consisting in deriving the most favorable vehicle pathways that minimize the vehicles’ traveled distances subject to system requirements. The set of vehicles, based on a central depot, has a maximum weight capacity and can travel up …