An Improved Ant Colony Optimization Algorithm for Multiple Routing problem
عنوان مقاله: An Improved Ant Colony Optimization Algorithm for Multiple Routing problem
شناسه ملی مقاله: ECIT01_071
منتشر شده در کنفرانس ملی تحقیقات نوین در مهندسی برق،کامپیوتر و فناوری اطلاعات در سال 1397
شناسه ملی مقاله: ECIT01_071
منتشر شده در کنفرانس ملی تحقیقات نوین در مهندسی برق،کامپیوتر و فناوری اطلاعات در سال 1397
مشخصات نویسندگان مقاله:
Afsoon Soltani - Department of Computer Engineering Islamic Azad University,Arak Branch, Arak,Iran
Abbas Karimi - Assistant Professor of Computer Engineering Islamic Azad University,Arak Branch Arak,Iran
خلاصه مقاله:
Afsoon Soltani - Department of Computer Engineering Islamic Azad University,Arak Branch, Arak,Iran
Abbas Karimi - Assistant Professor of Computer Engineering Islamic Azad University,Arak Branch Arak,Iran
The problem of removing urban waste and burying it is one of the most important urban problems .In this paper, a linear programming model is designed using an integer for multiple distances, which minimizes costs. In this model, warehouses and burial tanks were located in different places. In order to validate the proposed model, several small examples are solved using the GAMS software. Then, a new improved Taguchi algorithm was used, using an improved algorithm to solve the test problems, and large samples were measured
کلمات کلیدی: Urban waste collection، Disposal facility، Multi-trip Capacitated Arc Routing Problem، Improved Max-Min Ant System، Taguchi design method
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/827894/