A simulated annealing heuristic for the capacitated location routing problem
By V. Yu, Shih-Wei Lin, Wenyih Lee, C. Ting. Computers & industrial engineering, 2010
310 citations recorded by the source corpus.
Subfields: Industrial and Manufacturing Engineering, Organizational Behavior and Human Resource Management
View Paper: https://www.semanticscholar.org/paper/fdaa6274994ad1b211a36ddbd67cb2b352780018
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Industrial and Manufacturing Engineering
- Michael Schneider
- Michael Drexl
- Teodor Gabriel Crainic
- Jean-François Cordeau
- Vera C. Hemmelmayr
- Kannan Govindan
- K. Devika
- Roohollah Khodaverdi
In Organizational Behavior and Human Resource Management
- Teodor Gabriel Crainic
- Kannan Govindan
- Jean-François Cordeau
- Vera C. Hemmelmayr
- Michael Schneider
- Michael Drexl
Citations in the corpus
- An adaptive large neighborhood search heuristic for Two-Echelon Vehicle Routing Problems arising in city logistics (2012, methodology): “[33] was implemented in C and run on a PC with an Intel Core2 Quad CPU with 2.”
- Two-echelon multiple-vehicle location-routing problem with time windows for optimization of sustainable supply chain network of perishable food (2014, background): “A LRP is defined as a special case of VRP where there is a need to determine optimal number and location of depots simultaneously with finding vehicle routes from depots to customers in order to minimize costs associated with locating depots and distribution customers (Yu et al., 2010; Zarandi et al”
- A survey of variants and extensions of the location-routing problem (2015, methodology): “It starts with an initial solution generated by a greedy heuristic similar to the one described in (Yu et al. 2010).”