Page 26 - kahroba42

1402 ناتسمز - 42 هرامش ابرهک - رتویپماک و قرب یسدنهم یصصخت همانلصف

C. Prins, “Two memetic algorithms for heterogeneous fleet vehicle routing problems.,” Engineering [ 9 ]
Applications of Artificial Intelligence, 22, 916˚ 928., (2009).
J. Tang, Zhang, J. & Pan, Z., “A scatter search algorithm for solving vehicle routing problem with loading cost.,” Expert ] 10 [
Systems with Applications, 37(6), 4073˚ 4083., (2010).
L. H. Du, R., “Combining Nearest Neighbor Search with Tabu Search for Large-Scale Vehicle Routing Problem.,” Physics ] 11 [
Procedia, 25, 1536-1546., (2012).
Algorithm for capacitated vehicle routing problems.”, Expert A. E. Yurtkuran, E., “A new Hybrid Electromagnetism-like ] 12 [
Systems with Applications, 37(4), 3427-3433. , (2010).
P. Chen, Huang, H. K. & Dong, X. Y., “Iterated variable neighborhood descent algorithm for the capacitated vehicle ] 13 [
.) 2010 ( , 1627 - 1620 ,) ( 2 37 routing problem.,” Expert Systems with Applications,
V. C. Hemmelmayr, Cordeau, J. F. & Crainic, T. G., “An adaptive large neighborhood search heuristic for Two-Echelon ] 14 [
Vehicle Routing Problems arising in city logistics.,” Computers & Operations Research, 39(12), 3215-3228., (2012.).
A. Imran, Salhi, S. & Wassan, N., “A.A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing ] 15 [
problem,” European Journal of Operational Research.
.) 2009 ( , . 518 - 509 ,) ( 2 197
B. Bullnheimer, Hartl, R.F. and Strauss, C., “Applying the ant system to the vehicle routing problem,” Meta-Heuristics: ] 16 [
Paradigms for Optimization, pp., pp. 109-120, 1999. Advances and Trends in Local Search
. 1388 ،رهبا دحاو یدربراک و یملع عماج هاگشناد ،یسانشراک همان نایاپ ، ” نیمات هریجنز تیریدم “ ،یزورون .س ] 17 [

” ، ددرت تیدودحم نتفرگ رظن رد اب نیمأت هری جنز عیزوت شخب رد ) VRP ( هیلقن لیاههسو یبایریههسم هلئههسم لح و یزاههس لدم “ ،ینههسح .ا .ع و ینیههسح .ح .م .س ] 18 [
. 1397 ناتسبات ، 155 - 147 هحفص ، 1 / 1 هرامش ، 34 1 - هرود ،فیرش تیریدم و عیانص یسدنهم
and its C. A. Silva, Sousa, J.M.C., Runkler, T. and Costa, and J.M.G., “"Distributed optimization of a logistic system ] 19 [

. 2006 , 51 - 503 suppliers using ant colonies",” International Journal of Systems Science, 37(8), pp.
. 1393 ،رشن نابرهم باتک هسسؤم ،نارهت ،لوا پاچ ” رادیاپ نیمأت هریجنز “ ،اضردمحم .م و دمحا . ] 20 [
. 1374 ، 110 - 118 تاحفص ، 47 هرامش ،داصتقا یاه هزات ” ، نانیمطا مدع و کسیر تیریدم “ ،یریبع .غ ] 21 [

. 1388 , تعنص و ملع هاگشناد تاراشتنا ،نارهت ” نیمأت هریجنز تیریدم ،تسیچ نیمأت هریجنز “ ،یدمحا .م و یرومیت .ا ] 22 [
- 76 هحفص ، دیلوت تی ریدم و عیانص یسدنهم ” ، هیلقن هلیسو یبایریسم ،هلئسم لح یارب کیتنژ رثوم یبیکرت متیروگلا “ ،تخبشوخ .ی .م و یمشاه .ت و یرفظ .ع ] 23 [
. 1389 ، 21 دلج ، 2 هرامش ، 63
A. M. Benjamin, “Metaheuristics the waste collection vehicle routing problrm with time windows.,” (Doctor of ] 24 [
Philosophy), Brunel Univ., 2011.
Y. Zheng, “Supply Chain Management under availability & uncertainty constraints.”, Doctor of Philosophy, Lille Nord- ] 25 [
de-France Univ., 2012.
B. Bullnheimer, Hartl, R.F., Strauss, C., “An improved ant system algorithm for the vehicle routing problem.,” Annals of ] 26 [
Operations Research 89, 319˚ 328., 1999.
A Guide to the, 1979. ” M. R. Garey, and D. S. Johnson, “Computers and intractability, ] 27 [
B. Eksioglu, A. V. Vural, and A. Reisman, “The vehicle routing problem: A taxonomic review,” Computers & Industrial ] 28 [
Engineering, vol. 57, no. 4, pp. 1472-1483, 2009.
K. H. Kang, B. K. Lee, Y. H. Lee, and Y. H. Lee, “A heuristic for the vehicle routing problem with due times,” Computers ] 29 [
& Industrial Engineering, vol. 54, no. 3, pp. 421-431, 2008.
E. D. Taillard, G. Laporte, and M. Gendreau, “Vehicle routeing with multiple use of vehicles,” Journal of the Operational ] 30 [
research society, vol. 47, no. 8, pp. 1065-1070, 1996.
C. Gang, "A PSO-GA method to solve a partial shipment and scheduling problem." pp. V10-330-V10-335. ] 31 [

www.kahrobaonline.ir