Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic

By Christian Prins, Caroline Prodhon, Angel B. Ruiz, P. Soriano, R. W. Calvo. Transportation Science, 2007

297 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Hybrid heuristic for the inventory location-routing problem with deterministic demand (2013, background): “Examples are described by Prins et al. (2007), Belenguer et al. (2011) and a review is presented by Nagy and Salhi (2007).”
A survey of variants and extensions of the location-routing problem (2015, background): “On the NPP-P instances (which are constructed from standard LRP instances), the results are additionally compared to an extended version of the procedure proposed in (Prins et al. 2007) for the standard LRP.”
An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics (2012, methodology): “[27] only report one run of their respective algorithms, which use randomization.”
The design of robust value-creating supply chain networks (2010, background): “The first classification of location-routing problems is found in Laporte (1988) and several papers have studied different aspects of the problem (Nagy and Salhi, 1996; Prins et al., 2007; Berger et al., 2007).”