Heuristic solutions to multi-depot location-routing problems

By Tai-Hsi Wu, Chinyao Low, J. Bai. Computers & Operations Research, 2002

410 citations recorded by the source corpus.

Subfields: Control and Systems Engineering, Industrial and Manufacturing Engineering, Organizational Behavior and Human Resource Management

View Paper: https://www.semanticscholar.org/paper/401e92b5ea86237ff5b2d4bc710888e0e8edeb8b

How researchers see this paper

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

In Control and Systems Engineering

In Industrial and Manufacturing Engineering

In Organizational Behavior and Human Resource Management

Citations in the corpus

The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach (2012, methodology): “Several examples for the application of metaheuristic approaches can be given as tabu search [27,28], simulated annealing [29,30], greedy randomized adaptive search procedure (GRASP) [31,32], memetic algorithms [33], variable neighborhood search algorithms, [34] and particle swarm optimization [35].”
A simulated annealing heuristic for the capacitated location routing problem (2010, background): “Wu et al. (2002) studied a simulated annealing based decomposition approach for the multi-depot LRP with heterogeneous fleet types with limited number of vehicles and capacity on both depots and routes.”
Ltd Registered in England and Wales Registered Number : 1072954 Registered office : (2004, methodology): “Then we solve the routing problem among one DC and its customers using Wu et al.’s (2002) algorithm.”
Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking (2006, background): “Wu et al. (2002) studied the LRP with capacity on both depots and routes, and homogeneous or heterogeneous fleet types with limited number of vehicles.”
Integrated supply chain design models: a survey and future research directions (2007, methodology): “Very recently, Wu, Low, and Bai [81] decompose the LR problem into a location-allocation problem and a vehicle routing problem, then use simulated annealing as the basis to develop search methods for both subproblems.”
Location-routing: Issues, models and methods (2007, background): “The subsequent three subsections look at clustering-based, iterative and hierarchical heuristics, respectively.”
A heuristic method for the combined location routing and inventory problem (2005, methodology): “Wu et al. [ 4 ] proposed a simulated annealing algorithm for solving the location routing problem.”
A survey of variants and extensions of the location-routing problem (2015, methodology): “On these instances, the heuristic is compared with a simplified procedure that solves the three subproblems just described only once, using the LRP heuristic by Wu et al. (2002) for the routing problems and LP to solve the transportation problem.”