1. Albareda-Sambola, M., Fernández, E. and Nickel, S.,
"Multiperiod location-routing with decoupled time scales",
European Journal of Operational Research, Vol. 217, No. 2,
(2012), 248-258.
2. Caceres-Cruz, J., Arias, P., Guimarans, D., Riera, D. and Juan,
A.A., "Rich vehicle routing problem: Survey", ACM Computing
Surveys (CSUR), Vol. 47, No. 2, (2015), 32.
https://doi.org/10.1145/2666003
3. Drexl, M. and Schneider, M., "A survey of variants and
extensions of the location-routing problem", European Journal
of Operational Research, Vol. 241, No. 2, (2015), 283-308.
4. Braekers, K., Ramaekers, K. and Van Nieuwenhuyse, I., "The
vehicle routing problem: State of the art classification and
review", Computers & Industrial Engineering, Vol. 99, (2016),
300-313.
5. Montoya-Torres, J.R., Franco, J.L., Isaza, S.N., Jiménez, H.F. and
Herazo-Padilla, N., "A literature review on the vehicle routing
problem with multiple depots", Computers & Industrial
Engineering, Vol. 79, (2015), 115-129.
6. Geismar, H.N., Sriskandarajah, C. and Zhu, Y., "A review of
operational issues in managing physical currency supply chains",
Production and Operations Management, Vol. 26, No. 6,
(2017), 976-996.
7. Nadizadeh, A. and Nasab, H.H., "Solving the dynamic
capacitated location-routing problem with fuzzy demands by
hybrid heuristic algorithm", European Journal of Operational
Research, Vol. 238, No. 2, (2014), 458-470.
8. Vahdat Zad, M.A., "A mathematical programming for a special
case of 2e-lrp in cash-in-transit sector having rich variants",
International Journal of Industrial Engineering & Production
Research, Vol. 29, No. 2, (2018), 159-174.
9. Govindan, K., Jafarian, A., Khodaverdi, R. and Devika, K., "Twoechelon
multiple-vehicle location–routing problem with time
windows for optimization of sustainable supply chain network of
perishable food", International Journal of Production
Economics, Vol. 152, (2014), 9-28.
10. Prodhon, C. and Prins, C., "A memetic algorithm with population
management (ma| pm) for the periodic location-routing problem",
Hybrid Metaheuristics, Vol. 5296, (2008), 43-57.
11. Koç, Ç., "A unified-adaptive large neighborhood search
metaheuristic for periodic location-routing problems",
Transportation Research Part C: Emerging Technologies, Vol.
68, (2016), 265-284.
12. Javid, A.A., & Azad, N., "Incorporating location, routing and
inventory decisions in supply chain network design",
Transportation Research Part E: Logistics and Transportation
Review, Vol. 46, No. 5, (2010), 582-597.
13. Tang, J., Ji, S., & Jiang, L., "The design of a sustainable locationrouting-inventory
model considering consumer environmental
behavior", Sustainability, Vol. 8, No. 3, (2016), 211.
https://doi.org/10.3390/su8030211
14. Tavakkoli, R., Raziei, Z., "A new bi-objective location-routinginventory
problem
with
fuzzy
demand",
IFAC
Conference,
Vol.
49-12,
(2016),
1116-1121.
15. Karakostas, P., Sifaleras, A., & Georgiadis, M. C. , "A general
variable neighborhood search-based solution approach for the
location-inventory-routing problem with distribution
outsourcing", Computers & Chemical Engineering, Vol. 126,
(2019), 263-279.
16. Fallah-Tafti, A.L., Sahraeian, R., Tavakkoli-Moghaddam, R., &
Moeinipour, M., "An interactive possibilistic programming
approach for a multi-objective closed-loop supply chain network
under uncertainty", International Journal of Systems Science,
Vol. 45, No. 3, (2014), 283-299.
17. Sun, Y., Li, X., Liang, X., & Zhang, C., "A bi-objective fuzzy
credibilistic chance-constrained programming approach for the
hazardous materials road-rail multimodal routing problem under
uncertainty and sustainability", Sustainability, Vol. 11, No. 9,
(2019), 2577. https://doi.org/10.3390/su11092577
18. Fazayeli, S., Eydi, A., & Kamalabadi, I. N. , "Location-routing
problem in multimodal transportation network with time
windows and fuzzy demands: Presenting a two-part genetic
algorithm", Computers & Industrial Engineering, Vol. 119,
(2018), 233-246.
19. Krarup, J., "The peripatetic salesman and some related unsolved
problems", Combinatorial programming: methods and
applications. Springer, Dordrecht, (1995), 173-178.
20. Calvo, R.W. and Cordone, R., "A heuristic approach to the
overnight security service problem", Computers & Operations
Research, Vol. 30, No. 9, (2003), 1269-1287.
21. Yan, S., Wang, S.-S. and Wu, M.-W., "A model with a solution
algorithm for the cash transportation vehicle routing and
scheduling problem", Computers & Industrial Engineering,
Vol. 63, No. 2, (2012), 464-473.
22. Talarico, L., Sörensen, K. and Springael, J., "Metaheuristics for
the risk-constrained cash-in-transit vehicle routing problem",
European Journal of Operational Research, Vol. 244, No. 2,
(2015), 457-470.
23. Kahfi, A. and Tavakkoli-Moghaddam, R., "Solving a multi depots
vehicle routing problem based on reducing risk considering a
multi-objective bath algorithm", Journal of Transportation
Engineering, Vol. 3, (2015), 507-522.
24. Talarico, L., Sörensen, K. and Springael, J., "A biobjective
decision model to increase security and reduce travel costs in the
cash‐in‐transit sector", International Transactions in
Operational Research, Vol. 24, No. 1-2, (2017), 59-76.
25. Bozkaya, B., Salman, F. S., & Telciler, K., "An adaptive and
diversified vehicle routing approach to reducing the security risk
of cash‐in‐transit operations.", Networks,, Vol. 69, No. 3, (2017),
256-269.
26. Cuda, R., Guastaroba, G. and Speranza, M.G., "A survey on twoechelon routing problems", Computers & Operations Research
27. Inuiguchi, M., & Ramık, J., "Possibilistic linear programming: A
brief review of fuzzy mathematical programming and a
comparison with stochastic programming in portfolio selection
problem", Fuzzy sets and systems, Vol. 111, No. 1, (2000), 3-28.
28. Lai, Y.J., & Hwang, C. L., "A new approach to some possibilistic
linear programming problems", Fuzzy Sets and Systems, Vol. 49,
No. 2, (1992), 121-133.
29. Mavrotas, G. and Florios, K., "An improved version of the
augmented ε-constraint method (AUGMECON2) for finding the
exact pareto set in multi-objective integer programming
problems", Applied Mathematics and Computation, Vol. 219,
No. 18, (2013), 9652-9669.