A survey of recent research on location-routing problems
C Prodhon, C Prins - European journal of operational research, 2014 - Elsevier
The design of distribution systems raises hard combinatorial optimization problems. For
instance, facility location problems must be solved at the strategic decision level to place …
instance, facility location problems must be solved at the strategic decision level to place …
A survey of variants and extensions of the location-routing problem
M Drexl, M Schneider - European journal of operational research, 2015 - Elsevier
This is a review of the literature on variants and extensions of the standard location-routing
problem published since the last survey, by Nagy and Salhi, appeared in 2006. We propose …
problem published since the last survey, by Nagy and Salhi, appeared in 2006. We propose …
[HTML][HTML] An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics
In this paper, we propose an adaptive large neighborhood search heuristic for the Two-
Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP). The …
Echelon Vehicle Routing Problem (2E-VRP) and the Location Routing Problem (LRP). The …
[KNIHA][B] Handbook of memetic algorithms
Memetic Algorithms (MAs) are computational intelligence structures combining multiple and
various operators in order to address optimization problems. The combination and …
various operators in order to address optimization problems. The combination and …
[PDF][PDF] Memetic algorithms
The term 'Memetic Algorithms'[74](MAs) was introduced in the late 80s to denote a family of
metaheuristics that have as central theme the hybridization of different algorithmic …
metaheuristics that have as central theme the hybridization of different algorithmic …
A simulated annealing heuristic for the capacitated location routing problem
The location routing problem (LRP) is a relatively new research direction within location
analysis that takes into account vehicle routing aspects. The goal of LRP is to solve a facility …
analysis that takes into account vehicle routing aspects. The goal of LRP is to solve a facility …
A multi-objective model for the green capacitated location-routing problem considering environmental impact
Abstract The Capacitated Location-Routing Problem (CLRP) is a strategic-level problem
involving the selection of one or many depots from a set of candidate locations and the …
involving the selection of one or many depots from a set of candidate locations and the …
Hybrid adaptive large neighborhood search for vehicle routing problems with depot location decisions
This article considers three variants of the vehicle routing problem (VRP). These variants
determine the respective depot locations from which customers are supplied, ie, the two …
determine the respective depot locations from which customers are supplied, ie, the two …
A multiple ant colony optimization algorithm for the capacitated location routing problem
CJ Ting, CH Chen - International journal of production economics, 2013 - Elsevier
The success of a logistics system may depend on the decisions of the depot locations and
vehicle routings. The location routing problem (LRP) simultaneously tackles both location …
vehicle routings. The location routing problem (LRP) simultaneously tackles both location …
A branch-and-cut method for the capacitated location-routing problem
JM Belenguer, E Benavent, C Prins, C Prodhon… - Computers & Operations …, 2011 - Elsevier
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 …
cost may be excessive if routing decisions are ignored when locating depots. The Location …