ارائۀ یک روش فراابتکاری ترکیبی برای مسئلۀ مکان‌یابی- مسیریابی دوسطحی با شرایط گذاشت و برداشت

1.             Nagy, G. and Salhi, S. (2007). “Location-routing: Issues, models and methods”, European Journal of Operational Research, Vol. 177, No.2, PP.649-672.

2.             Jacobsen, S.K. and Madsen, O.B. (1980). “A comparative study of heuristics for a two-level routing-location problem”, European Journal of Operational Research, Vol. 5, No.6, PP.378-387.

3.             Or, I. and Pierskalla, W.P. (1979). “A transportation location-allocation model for regional blood banking”, AIIE transactions, Vol. 11, No.2, PP.86-95.

4.             Nambiar, J.M., Gelders, L.F. and Van Wassenhove, L.N. (1981). “A large scale location-allocation problem in the natural rubber industry”, European Journal of Operational Research, Vol. 6, No.2, PP.183-189.

5.             Laporte, G. and Nobert, Y. (1981). “An exact algorithm for minimizing routing and operating costs in depot location”, European Journal of Operational Research, Vol. 6, No.2, PP.224-226.

6.             Madsen, O.B. (1983). “Methods for solving combined two level location-routing problems of realistic dimensions”, European Journal of Operational Research, Vol. 12, No.3, PP.295-301.

7.             Min, H., V. Jayaraman, and R. (1988). “Srivastava, Combined location-routing problems: A synthesis and future research directions”, European Journal of Operational Research, Vol. 108, No.1, PP.1-15.

8.             Balakrishnan, A., Ward, J.E. and Wong, R.T. (1987). “Integrated facility location and vehicle routing models: Recent work and future prospects”, American Journal of Mathematical and Management Sciences, Vol. 7, No. (1-2), PP.35-61.

9.             Berman, O., Jaillet, P. and Simchi-Levi, D. (1995). “Location-routing problems with uncertainty”, Facility location: a survey of applications and methods, Vol. 106, PP.427-452.

10.          Majidi, S., Hosseini-Motlagh, S. M. and Ignatius, J. (2017). “Adaptive large neighborhood search heuristic for pollution-routing problem with simultaneous pickup and delivery”, Soft Computing, PP.1-15.

11.          Prodhon, C. and Prins, C. (2014). “A survey of recent research on location-routing problems”, European Journal of Operational Research, Vol. 238, No.1, PP.1-17.

12.          Drexl, M. and Schneider, M. (2015). “A survey of variants and extensions of the location-routing problem”, European Journal of Operational Research, Vol. 241, No.2, PP.283-308.

13.          Karaoglan, I., Altiparmak, F., Kara, I. and Dengiz, B. (2011). “A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery”, European Journal of Operational Research, Vol. 211, No.2, PP.318-332.

14.          Hosseini-Motlagh, S. M., Majidi, S., Yaghoubi, S. and Jokar, A. (2017). “Fuzzy green vehicle routing problem with simultaneous pickup-delivery and time windows”, RAIRO-Operations Research.

15.          Karaoglan, I., Altiparmak, F., Kara, I.and Dengiz, B. (2012). “The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach”, Omega, Vol. 40, No.4, PP.465-477.

16.          Rieck, J., Ehrenberg, C. and Zimmermann, J. (2014). “Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery”, European Journal of Operational Research, Vol. 236, No.3, PP.863-878.

17.          Çetiner, S., Sepil, C. and Süral, H. (2010). “Hubbing and routing in postal delivery systems”, Annals of Operations Research, Vol. 181, No.1, PP.109-124.

18.          de Camargo, R.S., de Miranda, G. and Løkketangen, A. (2013). “A new formulation and an exact approach for the many-to-many hub location-routing problem”, Applied Mathematical Modelling, Vol. 37, No.12, PP.7465-7480.

19.          Wasner, M. and Zäpfel, G. (2004). “An integrated multi-depot hub-location vehicle routing model for network planning of parcel service”, International Journal of Production Economics, Vol. 90, No.3, PP.403-419.

20.          Vincent, F.Y., et al., (2010). “A simulated annealing heuristic for the capacitated location routing problem”, Computers & Industrial Engineering, Vol. 58, No.2, PP.288-299.

21.          Alumur, S. and Kara, B.Y. (2007). “A new model for the hazardous waste location-routing problem”, Computers & Operations Research, Vol. 34, No.5, PP.1406-1423.

22.          Nikbakhsh, E. and Zegordi, S. (2010). “A heuristic algorithm and a lower bound for the two-echelon location-routing problem with soft time window constraints”, Scientia Iranica Transaction E: Industrial Engineering, Vol. 17, No.1, PP.36-47.

23.          Nguyen, V.-P., Prins, C. and Prodhon, C. (2012). “A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem”, Engineering Applications of Artificial Intelligence, Vol. 25, No.1, PP.56-71.

24.          Sajjadi, S. R. and Hossein Cheraghi, S. (2011). “Multi-products location–routing problem integrated with inventory under stochastic demand”, International Journal of Industrial and Systems Engineering, Vol. 7, No.4, PP.454-476.

25.          M. Hamidi, K., Farahmand, S., Reza Sajjadi, and K. Nygard., (2012). “A hybrid GRASP-tabu search metaheuristic for a four-layer location-routing problem”, International Journal of Logistics Systems and Management, Vol. 12, No.1, PP.267-287.

26.          Rieck, J., Ehrenberg, C. and Zimmermann, J. (2014). “Many-to-many location-routing with inter-hub transport and multi-commodity pickup-and-delivery”, European Journal of Operational Research, Vol. 236, No.3, PP.863-878.

27.          Jiang, S. and Ma, Z. (2009). “A Hybrid Genetic Algorithm for the Stochastic Dynamic Location-Routing-Inventory Problem in Closed-Loop Logistics System for Reusing End-of-Use Products”, International Conference on Transportation Engineering.

28.          Ghodsi, R. and Shamekhi Amiri, A. (2010). “A variable neighborhood search algorithm for continuous location routing problem with pickup and delivery”, Fourth Asia International Conference on Mathematical/Analytical Modelling and Computer Simulation, PP.193-203.