Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking

By Christian Prins, Caroline Prodhon, R. W. Calvo. 4OR, 2006

298 citations recorded by the source corpus.

Subfields: Building and Construction, Industrial and Manufacturing Engineering, Organizational Behavior and Human Resource Management

View Paper: https://www.semanticscholar.org/paper/dccb7ddff5880a546e912b2adc05e14b5834a738

How researchers see this paper

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

In Building and Construction

In Industrial and Manufacturing Engineering

In Organizational Behavior and Human Resource Management

Citations in the corpus

An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics (2012, methodology): “The algorithms of Prins et al. (2007), Prins et al. (2006a) and Prins et al. (2006b) were implemented in C++ and Table 4: Average % deviation to the BKS and CPU times in seconds over all the instances of the three instance sets for the LRP ) coded their algorithm in C++, compiled with GCC 4.3 and…”
A survey of variants and extensions of the location-routing problem (2015, methodology): “The fitness of an individual is evaluated by creating a PLRP solution for the list of visiting patterns using the RECWA and LS of Prins et al. (2006b).”
A case analysis of a sustainable food supply chain distribution system—A multi-objective approach (2014, background): “From a global perspective, the introduction of the Kyoto protocol progressed this agenda while also encouraging firms to reduce carbon emissions throughout their operations (Diabat and Simchi-Levi 2009).”
The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach (2012, methodology): “[31] for the LRP.”
Solving the Capacitated Location-Routing Problem by a Cooperative Lagrangean Relaxation-Granular Tabu Search Heuristic (2007, background): “Most of the time, these two levels of decision are tackled separately, but, unfortunately, it has been shown that this strategy often leads to suboptimal solutions (Salhi and Rand 1989). The location-routing problem (LRP) integrates these two decision levels. As shown in Min, Jayaraman, and Srivasta”
A simulated annealing heuristic for the capacitated location routing problem (2010, methodology): “Prins et al. (2006b) solved the LRP with capacitated depots and routes by combining greedy randomized adaptive search procedure (GRASP) with a learning process and a path relinking mechanism.”