1 |
MARA S T W, KUO R J, ASIH A M S. Location-routing problem: a classification of recent research[J]. International Transactions in Operational Research, 2021, 28(6):2941-2983.
|
2 |
WU Y, QURESHI A G, YAMADA T. Adaptive large neighborhood decomposition search algorithm for multi-allocation hub location routing problem[J]. European Journal of Operational Research, 2022, 302(3): 1113-1127.
|
3 |
DARVISH M, ARCHETTI C, COELHO L C, et al. Flexible two-echelon location routing problem[J]. European Journal of Operational Research, 2019, 277(3): 1124-1136.
|
4 |
陈希琼,胡大伟,王宁. 多目标同时取送货选址-路径问题的多起点变邻域搜索算法[J]. 控制理论与应用, 2022, 39(7): 1229-1241.
|
|
CHEN X Q, HU D W, WANG N. A multi-start variable neighborhood search for multi-objective location routing problem with simultaneous pickup and delivery[J]. Control Theory and Applications, 2022, 39(7): 1229-1241.
|
5 |
QUINTERO-ARAUJO C L, GUIMARANS D, JUAN A. A simheuristic algorithm for the capacitated location routing problem with stochastic demands[J]. Journal of Simulation, 2021, 15(3): 217-234.
|
6 |
TORDECILLA R D, PANADERO J, JUAN A A, et al. A simheuristic algorithm for the location routing problem with facility sizing decisions and stochastic demands[C]// Proceedings of the 2020 Winter Simulation Conference. Piscataway: IEEE, 2020: 1265-1275.
|
7 |
TORDECILLA R D, MONTOYA-TORRES J R, QUINTERO-ARAUJO C L, et al. The location routing problem with facility sizing decisions[J]. International Transactions in Operational Research, 2023, 30(2): 915-945.
|
8 |
MOHAMED I BEN, KLIBI W, SADYKOV R, et al. The two-echelon stochastic multi-period capacitated location-routing problem[J]. European Journal of Operational Research, 2023, 306(2): 645-667.
|
9 |
AMIRI M, AMIN S H, TAVAKKOLI-MOGHADDAM R. A Lagrangean decomposition approach for a novel two-echelon node-based location-routing problem in an offshore oil and gas supply chain[J]. Transportation Research Part E: Logistics and Transportation Review, 2019, 128: 96-114.
|
10 |
DAI Z, AQLAN F, GAO K, et al. A two-phase method for multi-echelon location-routing problems in supply chains[J]. Expert Systems with Applications, 2019, 115: 618-634.
|
11 |
CHEN Y, ZHAO Q, WANG W, et al. Mixed multi-echelon location routing problem with differentiated intermediate depots[J]. Computers and Industrial Engineering, 2023, 177: No.109026.
|
12 |
杨屹夫,孙冰,马艳芳,等. 服务差异二级选址路径问题及大邻域搜索算法[J]. 计算机工程与应用, 2023, 59(3): 282-292.
|
|
YANG Y F, SUN B, MA Y F, et al. Adaptive large neighborhood search algorithm for two-echelon location-routing problem with different service modes[J]. Computer Engineering and Applications, 2023, 59(3): 282-292.
|
13 |
JUAN A A, FAULIN J, JORBA J, et al. On the use of Monte Carlo simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics[J]. Journal of the Operational Research Society, 2011, 62(6): 1085-1097.
|
14 |
JUAN A A, CORLU C G, TORDECILLA R D, et al. On the use of biased-randomized algorithms for solving non-smooth optimization problems[J]. Algorithms, 2020, 13(1): No.8.
|
15 |
GRASAS A, JUAN A A, FAULIN J, et al. Biased randomization of heuristics using skewed probability distributions: a survey and some applications[J]. Computers and Industrial Engineering, 2017, 110: 216-228.
|
16 |
ZHOU L, LIN Y, WANG X, et al. Model and algorithm for bilevel multisized terminal location-routing problem for the last mile delivery[J]. International Transactions in Operational Research, 2019, 26(1): 131-156.
|
17 |
HAJGHANI M, FORGHANI M A, HEIDARI A, et al. A two-echelon location routing problem considering sustainability and hybrid open and closed routes under uncertainty[J]. Heliyon, 2023, 9(3): No.e14258.
|
18 |
NGUYEN V P, PRINS C, PRODHON C. Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking[J]. European Journal of Operational Research, 2012, 216(1): 113-126.
|
19 |
PRINS C, PRODHON C, RUIZ A, et al. Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic[J]. Transportation Science, 2007, 41(4): 431-541.
|