]1[Dror, M., Trudeau, P.,Savings by split delivery routing, Transportation Science,23, 141–145,1989.
]2[Campbell, A., Clarke, L., Savelsbergh, M.W.P,Inventory routing in practice: The vehicle routing problem, SIAM Monographs on Discrete Mathematics and Applications, 309–330,2002.
]3[Campbell, A.M., Savelsbergh, M.W.P., A decomposition approach for the inventory-routing problem. Transportation Science, 38(4), 488–502, 2004.
]4[Anily, Sh.,Bramel, J., An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem, Discrete Applied Mathematics,145, 22-39 ,2004.
]5[Aghezzaf, E. , Raa, B., Van Landeghem, H., 2006, Modeling inventory routing problems in supply chains of high consumption products, European Journal of Operational Research,169, 1048–1063,2006.
]6[Zhao, Q. , Wang Sho. , Lai K.K.,A partition approach to the inventory/routing problem, European Journal of Operational Research, 177, 786–802, 2007.
]7[Abdelmaguid, T. F. ,Dessouky, M. M. , Ordonez, F., Heuristic approaches for the inventory-routing problem with backlogging, Computers & Industrial Engineering, 56, 1519–1534, 2009.
]8[Bard, J., F. ,Nananukul, N., Heuristics for a multiperiod inventory routing problem with production decisions, Computers & Industrial Engineering, 57, 713–723, 2009.
]9[Cheng, L., Duran, M.A.,Logistics for world-wide crude oil transportation using discrete event simulation and optimal control, Computers and Chemical Engineering ,28, 897–911, 2004.
]10[Yu, Y., Chen, H., Chu, F., A new model and hybrid approach for large scale inventory routing problems, European Journal of Operational Research, 189,1022–1040, 2008.
]11[Christiansen, M., KjetilFagerholt , K., Flatberg, T., Haugen, Q., Kloster,O., Lund,E., Maritime inventory routing with multiple products: A case study from the cement industry, European Journal of Operational Research,208, 86-94, 2011.
]12[Zhong, Y., Aghezzaf, E., Combining DC-programming and steepest-descent to solve the single-vehicle inventory routing problem, Computers & Industrial Engineering, 61, 313-321, 2011.
]13[Zipkin, P., Federgruen, A.,An efficient algorithm for computing optimal (s,S) policies,Operations Research, 32, 1268-1285, 1984.
]14[Federgruen, A., Prastacos, G., Zipkin, P., An allocation and distribution model for perishable products,Operations Research, 34, 75-82, 1986.
]15[Liu, Sh., Lee, W.,A heuristic method for the inventory routing problem with time windows, Expert Sistem with Application, 38,13223-13231, 2011.
]16[Andersson, H., Hoff ,A., Christiansen, M., Hasle, G., Løkketangen, A., Industrial aspects and literature survey: Combined inventory management and routing, Computers & Operations Research, 37 ,1515–1536, 2010.
[17]عالم تبریز، ا. زندیه، م. محمد رحیمی، ع.، الگوریتمهای فرا ابتکاری در بهینهسازی ترکیبی (ژنتیک، شبکه عصبی، آنیل شبیهسازی شده، جستجوی ممنوع، الگوریتم مورچگان)، چاپ دوم، نشر اشراقی، 1389.
]18[Mladenovi´c, N., Hansen, H., Variable neighborhood search, Computers and Operations Research, 24 (11): 1097–1100, 1997.
]19[Bräysy, O., A Reactive Variable Neighborhood Search for the Vehicle Routing Problem with Time Windows. SINTEF AppliedMathematics, Department of Optimization, 124, 2003.
]20[Polacek, M., Hart, R., Doerner, K., Reimann, M.,
A Variable Neighborhood Search for the Multi Depot Vehicle Routing Problem with Time Windows, Journal of Heuristics,10, 613-627, 2004.
]21[Polacek, M., Doerner, K., Hart, R.,
Maniezzo, V.,
A variable neighborhood search for the capacitated arc routing problem with intermediate facilities, Journal of Heuristics, 14, 405-423, 2008.
]22[Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F.,A Variable Neighborhood Search Heuristic for Periodic Routing Problems. European Journal of Operational Research,195 , 791–802, 2009.
)