- کشتزاری، م.، (1391)، "ارائه یک الگوریتم فرا ابتکاری ترکیبی برای مساله زمانبندی وسایل نقلیه در یک سیستم انبار عبوری"، نهمین کنفرانس بینامللی مهندسی صنایع.
-حسینی، س.م.ح.، س.م. حسن، خ. علیایی، (1394)، "مدلسازی ریاضی مسأله مکانیابی- مسیریابی با در نظر گرفتنظرفیت"، تنوع و محدودیت تردد وسایل حمل و نقل و توسعه یک مدل حل مبتنی بر الگوریتم کلونی مورچگان" نشریه پژوهشهای مهندسی صنایع در سیستمهای تولید، دوره3، شماره5، ص. 91-105.
- خدابنده، م.، س.ر. حجازی و م. راستیبرزکی، (1392)، "یک الگوریتم ژنتیک برای مساله زمانبندی یکپارچه تولید و توزیع با در نظرگرفتن مسیریابی در زنجیره تامین، نشریه پژوهشهای مهندسی صنایع در سیستمهای تولید، دوره 1، شماره 2، ص. 167-181.
-Agustina, D., C. Lee, and R. Piplani, (2010), “A Review: Mathematical Modles for Cross Docking Planning. International Journal of Engineering Business Management”, 2(2), pp. 47-54.
- Alpan, G., R. Larbi, and B. Penz, (2011), “A bounded dynamic programming approach to schedule operations in a cross docking platform”, Computers & Industrial Engineering, 60(3), pp. 385-396.
- Apte, U.M. and S. Viswanathan, Effective cross docking for improving distribution efficiencies. International Journal of Logistics, 2000. 3(3), pp. 291-302.
- Deb, K. and T. Goel., (2001), “ Controlled elitist non-dominated sorting genetic algorithms for better convergence”, in International Conference on Evolutionary Multi-Criterion Optimization, Springer.
-Deb, K., (2001), “Multi-objective optimization using evolutionary algorithms. Vol. 16. John Wiley & Sons.
-Dondo, R. and J. Cerdá, (2014), “A monolithic approach to vehicle routing and operations scheduling of a cross-dock system with multiple dock doors”, Computers & Chemical Engineering, 63, pp. 184-205.
-Gümüş, M. and J.H. Bookbinder, (2004), “Cross‐docking and its implications in location‐distribution systems”, Journal of Business Logistics, 25(2), pp. 199-228.
-Jayaraman, V. and A. Ross, (2003), “A simulated annealing methodology to distribution network design and management”, European Journal of Operational Research, 144(3), pp. 629-645.
-Konur, D. and M.M. Golias, (2013), “Analysis of different approaches to cross-dock truck scheduling with truck arrival time uncertainty”, Computers & Industrial Engineering, 65(4), pp. 663-672.
-Morais, V.W., G.R. Mateus, and T.F. Noronha, (2014), “Iterated local search heuristics for the vehicle routing problem with cross-docking”, Expert Systems with Applications, 41(16), pp. 7495-7506.
-Mosheiov, G., (1998), “Vehicle routing with pick-up and delivery: tour-partitioning heuristics”, Computers & Industrial Engineering, 34(3), pp. 669-684.
-Rohrer, M., (1995), “Simulation and cross docking”, in Simulation Conference Proceedings.
-Sung, C.S. and S.H. Song, (2003), “Integrated service network design for a cross-docking supply chain network. Journal of the Operational Research Society, 54(12), pp. 1283-1295.
-Taguchi, G., (1986), “Introduction to quality engineering: designing quality into products and processes”.
-Van Belle, J., et al., (2013), “A tabu search approach to the truck scheduling problem with multiple docks and time windows”, Computers & Industrial Engineering, 66(4): pp. 818-826.
-Wurz, A., (1994), “Cross docking is workable today”, Autom ID News, 10(5), pp. 56-57.
-Yu, W. and P.J. Egbelu, (2008), “Scheduling of inbound and outbound trucks in cross docking systems with temporary storage. European Journal of Operational Research, 184(1), pp. 377-396.
-Yu, W., (2002), “Operational strategies for cross docking systems”.