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

DOI10.1504/IJMMNO.2016.074375zbMath1514.90151MaRDI QIDQ6108464

Bouziane Beldjilali, Abdelghani Bekrar, Oualid Guemri, Ghalem Belalem

Publication date: 29 June 2023

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

zbMATH Keywords

metaheuristicssimulated annealingtabu searchlocal searchfacility locationcombinatorial optimisationlocation routing problemsupply chain management (SCM)capacitated LRP (CLRP)

Mathematics Subject Classification ID

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

Related Items (2)

A progressive filtering heuristic for the location-routing problem and variants ⋮ Location‐routing problem: a classification of recent research

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