این سایت در حال حاضر پشتیبانی نمی شود و امکان دارد داده های نشریات بروز نباشند
Journal of Industrial Engineering and Management Studies، جلد ۹، شماره ۱، صفحات ۱۴۸-۱۶۴
عنوان فارسی
چکیده فارسی مقاله
کلیدواژه‌های فارسی مقاله
عنوان انگلیسی Evaluation of a bi-objective vehicle routing problem considering time constraints
چکیده انگلیسی مقاله In today's competitive market, reducing costs and time is one of the most important issues that has occupied the minds of managers and researchers. This issue is especially important in the field of supply chain management and transportation because by reducing time and cost, manufacturers and service providers can gain a competitive advantage over competitors. Accordingly, vehicle routing issues are one of the most important issues in this field because it is directly related to the time of service or product delivery and also by optimizing the network, reduces the cost of the entire network. Therefore, in this study, the intention was to evaluate the problem of vehicle routing (trucks) by considering the time constraints and using a multi-objective approach. Therefore, we discussed each of the factors separately based on the issue. The results of this study show. In this research, the model with two objective functions will be solved by two metaheuristic algorithms NSGA-II and MOPSO Managers are concerned with time and cost management in today's competitive markets, which is seen as a source of competitive advantage. The present study aims to find a solution to a bi-objective function model by employing two metaheuristic algorithms, NSGA-II and MOPSO. Additionally, a criterion for comparing algorithms is presented. The findings show that the MOPSO algorithm yields the optimal solution.  The contribution of the present study in comparison with other previous studies can be summarized as follows: Environmental protection based on reducing pollution and its effects as well as reducing costs. Finding the desired route taking into account the complexity and difficulty of the route. Managers are concerned with time and cost management in today's competitive markets, which is seen as a source of competitive advantage. The present study aims to find a solution to a bi-objective function model by employing two metaheuristic algorithms, NSGA-II and MOPSO. Additionally, a criterion for comparing algorithms is presented. The findings show that the MOPSO algorithm yields the optimal solution. The contribution of the present study compared to other previous studies can be environmental protection and cost reduction that the two factors are compared and the results of the two methods are analyzed.
کلیدواژه‌های انگلیسی مقاله exchange locations,vehicle routing problem,NSGA-II and MOPSO vehicle routing problem,time constraints
نویسندگان مقاله Ruhollah Ebrahimi Gorji |
Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran.

Hamed Soleimani |
Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran.

Behrouz Afshar-Nadjafi |
Faculty of Industrial and Mechanical Engineering, Qazvin Branch, Islamic Azad University, Qazvin, Iran.

نشانی اینترنتی https://jiems.icms.ac.ir/article_152907_0ae345433dfa9085ad614f1ea225193d.pdf
فایل مقاله فایلی برای مقاله ذخیره نشده است
کد مقاله (doi)
زبان مقاله منتشر شده en
موضوعات مقاله منتشر شده
نوع مقاله منتشر شده
برگشت به: صفحه اول پایگاه   |   نسخه مرتبط   |   نشریه مرتبط   |   فهرست نشریات