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

DOI10.1504/IJMMNO.2016.074375MaRDI QIDQ6108464zbMATH OpenFDO

Authors Oualid Guemri, Bouziane Beldjilali, Abdelghani Bekrar, Ghalem Belalem

Publication date 29 June 2023

Published in International Journal of Mathematical Modelling and Numerical Optimisation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/IJMMNO.2016.074375

zbMATH Keywords

capacitated LRP (CLRP)combinatorial optimisationfacility locationlocal searchlocation routing problemmetaheuristicssimulated annealingsupply chain management (SCM)tabu search

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80) Large-scale problems in mathematical programming (90C06) Approximation methods and heuristics in mathematical programming (90C59)

Review text

Summary: In this paper, we treat the capacitated location-routing problem (CLRP). The CLRP which combines the facility location problem with the routing problem is one of the most important problems in combinatorial optimisation field. In this study, we propose a new two-stage heuristic (2-SH) algorithm for the large-scale CLRP. In fact, our aim is to find high-quality solutions for very large-scale problems within a short computing time. The proposed method consists of two major stages. In the first, the routing sub-problem is solved using a tabu search. Then, in the second stage, to associate each route to a facility, the location-allocation sub-problem is treated by means of a simulated annealing method. Our proposed approach is evaluated on large-scale randomly generated instances and compared successfully with other two state-of-the-art algorithms from the literature.

Recommendations

• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
• A biased-randomized metaheuristic for the capacitated location routing problem
• Lower and upper bounds for the two-echelon capacitated location-routing problem
• A GRASP\(\times \)ELS approach for the capacitated location-routing problem
• A two-phase tabu search approach to the location routing problem

Cited in

(6)

• A two-phase tabu search approach to the location routing problem
• A progressive filtering heuristic for the location-routing problem and variants
• A simulated annealing heuristic for the open location-routing problem
• A two-phase hybrid heuristic algorithm for the capacitated location-routing problem
• Location‐routing problem: a classification of recent research
• A conceptually simple algorithm for the capacitated location-routing problem

This page was built for publication: Two-stage heuristic algorithm for the large-scale capacitated location routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6108464)