سامانه پشتیبانی خدمات اطلاعات

  اخبار و اعلانات

 آمار

تعداد نشریات163
تعداد شماره‌ها6,767
تعداد مقالات72,886
تعداد مشاهده مقاله132,083,893
تعداد دریافت فایل اصل مقاله103,630,446
razavi, maryam, . Soukhakian, Mohamad Ali, Ziarati, Kourosh. (1390). A Meta Heuristic Algorithms Based on Ant Colony System For Solving Multi Depots Location-routing Problem with Multiple Using of Vehicle. , 3(1), 17-38.
maryam razavi; Mohamad Ali . Soukhakian; Kourosh Ziarati. "A Meta Heuristic Algorithms Based on Ant Colony System For Solving Multi Depots Location-routing Problem with Multiple Using of Vehicle". , 3, 1, 1390, 17-38.
razavi, maryam, . Soukhakian, Mohamad Ali, Ziarati, Kourosh. (1390). 'A Meta Heuristic Algorithms Based on Ant Colony System For Solving Multi Depots Location-routing Problem with Multiple Using of Vehicle', , 3(1), pp. 17-38.
razavi, maryam, . Soukhakian, Mohamad Ali, Ziarati, Kourosh. A Meta Heuristic Algorithms Based on Ant Colony System For Solving Multi Depots Location-routing Problem with Multiple Using of Vehicle. , 1390; 3(1): 17-38.

A Meta Heuristic Algorithms Based on Ant Colony System For Solving Multi Depots Location-routing Problem with Multiple Using of Vehicle

Industrial Management Journal
مقاله 2، دوره 3، شماره 1 - شماره پیاپی 6، تیر 2011، صفحه 17-38    اصل مقاله (286.92 K)
نویسندگان
maryam razavi؛ Mohamad Ali . Soukhakian؛ Kourosh Ziarati
چکیده
In a logistic system, decisions on location of depot, vehicle routing and assignment of routes to vehicles should be considered simultaneously. The location-routing problems are defined to find the optimal number and locations of depots, and at the same time with the distribution routes for the vehicles. Because of the complexity and the time consuming computation, this problem belongs to a class of combinatorial optimization and NP-hard problems. Finding an optimal solution for this type of complex, huge problem in reasonable computational time by using traditional and exact approaches and optimization tools is very difficult. So a Meta heuristic algorithm based on ant colony system is proposed to solve this problem. According to the experiments, this proposed algorithm reports near-optimal and promising solutions in reasonable time. Also in this paper the assumption of assigning several routes to a vehicle during its available time is considered. Finally, the computational results obtained by this algorithm are compared with the results reported by Lingo software.
کلیدواژه‌ها
Ant Colony System؛ Bin packing problem.؛ Greedy search؛ Location-routing problem؛ Meta heuristic
آمار
تعداد مشاهده مقاله: 4,118
تعداد دریافت فایل اصل مقاله: 5,055





سامانه مدیریت نشریات علمی. قدرت گرفته از سیناوب