Skip to Main content Skip to Navigation
Journal articles

A Branch-and-Cut method for the Capacitated Location-Routing Problem

Abstract : Recent researches in the design of logistic networks have shown that the overall distribution cost may be excessive if routing decisions are ignored when locating depots. The Location-Routing Problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions. The aim of this paper is to propose an exact approach based on a Branch-and-Cut algorithm for solving the LRP with capacity constraints on depots and vehicles. The proposed method is based on a zero-one linear model strengthened by new families of valid inequalities. The computational evaluation on three sets of instances (34 instances in total), with 5–10 potential depots and 20–88 customers, shows that 26 instances with five depots are solved to optimality, including all instances with up to 40 customers and three with 50 customers.
Document type :
Journal articles
Complete list of metadatas

https://hal-utt.archives-ouvertes.fr/hal-02475782
Contributor : Daniel Gavrysiak <>
Submitted on : Wednesday, February 12, 2020 - 11:51:27 AM
Last modification on : Monday, April 20, 2020 - 2:14:09 PM

Identifiers

Collections

Citation

Jose-Manuel Belenguer, Enrique Benavent, Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo. A Branch-and-Cut method for the Capacitated Location-Routing Problem. Computers and Operations Research, Elsevier, 2011, 38 (6), pp.931-941. ⟨10.1016/j.cor.2010.09.019⟩. ⟨hal-02475782⟩

Share

Metrics

Record views

67