A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
In this work, we present a new approach to solve the Capacitated Location-Routing Problem (CLRP). The aim of this method is to determine the depot locations, to assign customers to facilities and to define routes for each depot to serve the associated clients. The proposed approach contains two phases, which are the constructive phase and the improvement phase. In the first phase, we select the depots to be opened, allocate the customers to open depots using a Hierarchical Ascendant (HA) methoddoi:10.22266/ijies2021.0228.29 fatcat:giy5hu6jw5da3jzyn7mfrf2i2m