A taxonomical analysis, current methods and objectives on location‐routing problems

Abstract

Location-routing is a branch of locational analysis that takes into account distribution aspects. This paper proposes a taxonomy, with two levels, for location-routing problems. The first level focuses on the structural characteristics of the problems. The second level branches into the different algorithmic approaches and objective perspectives. An introduction to the previously defined problems is presented, categorising the papers in the literature (a total of 149 references) according to the proposed classification. Moreover, an overview of the most significant aspects of the different solution methods and main objectives, with special emphasis on multi-objective approaches, is provided. Some data providing a better insight into the publication progress are also included. Finally, several promising research directions are identified.

A model for distribution centers location-routing problem on a multimodal transportation network with a meta-heuristic solving approach

“…Thereafter, various authors has introduced different approaches to the problem which can be classified based on problem structure (single-echelon or multi-echelon), type of data (deterministic, probabilistic, or fuzzy), number of product types (single-product or multiproduct), number and capacity of facilities (single-facility or multi-facility, capacitated or incapacitated), type and capacity of vehicles (homogenous or heterogeneous, capacitated or incapacitated), time window and problem type (soft or hard), number of objective functions (singleobjective or multi-objective), and solving methods (exact, heuristic, meta-heuristic, and combinational). In this regard, some researchers (e.g., Nagi and Salhi 2007; Prodhon and Prins 2014;Lopes et al 2013;Drexl and Schneider 2014) present review papers. Wu et al (2017) designed a three echelon LRP.…”

A periodic location routing problem for collaborative recycling

“…There are several extensive surveys of the LRP literature, including the PLRP. Nagy and Salhi (2007) covers the literature through 2007, Prodhon and Prins (2014) and Drexl and Schneider (2015) cover the literature from 2007 to 2013, and Lopes et al (2013) categorizes LRP problems based on modeling and solution approaches. Alvim and Taillard (2013) solve large-scale LRP instances with a POPMUSIC (partial optimization metaheuristic under special intensification conditions) framework.…”

A simulated annealing heuristic for the open location-routing problem

“…Each sub-problem is solved with an ant colony method and conjoins by exchanging information through pheromone updates. Readers can refer to Lopes et al [11] for a more comprehensive review of the CLRP literature, as they proposed a taxonomy for location-routing problems from both the problem structure and the solution methodology perspectives.…”

“…Constraint (10) guarantees that each customer is assigned to a depot. Constraint (11) ensures that the total demand of customers assigned to a depot must not exceed the depot's capacity. Constraints (12)-(14) prohibit infeasible routes.…”