Skip to Main content Skip to Navigation
Journal articles

Two-stage heuristic algorithm for the large-scale capacitated location routing problem

Abstract : In this paper, we treat the Capacitated Location-Routing Problem(CLRP).TheCLRPwhichcombinesthefacilitylocationproblemwiththeroutingproblem is one of the most important problems in combinatorial optimizationfield. In this study, we propose a new Two Stage Heuristic (2-SH) algorithmfor the large-scale CLRP. In fact, our aim is to find high-quality solutions forvery large-scale problems within a short computing time. The proposed methodconsists of two major stages. In the first, the routing sub-problem is solved usinga Tabu Search. Then, in the second stage, to associate each route to a facility, thelocation-allocation sub-problem is treated by means of a Simulated Annealingmethod. Our proposed approach is evaluated on large-scale randomly generatedinstances and compared successfully with other two state-of-the-art algorithmsfrom the literature
Document type :
Journal articles
Complete list of metadata
Contributor : Mylène Delrue Connect in order to contact the contributor
Submitted on : Monday, November 15, 2021 - 8:44:55 AM
Last modification on : Tuesday, November 16, 2021 - 3:56:50 AM




Oualid Guemri, Bouziane Beldjilali, Abdelghani Bekrar, Ghalem Belalem. Two-stage heuristic algorithm for the large-scale capacitated location routing problem. International Journal of Mathematical Modelling and Numerical Optimisation, Inderscience, 2016, 7 (1), pp.97. ⟨10.1504/IJMMNO.2016.074375⟩. ⟨hal-03428140⟩



Record views