دانلود مقاله انگلیسی رایگان:خوشه بندی مناطق هند براساس نیازهای زنجیره تامین - 2021
بلافاصله پس از پرداخت دانلود کنید
دانلود مقاله انگلیسی زنجیره تامین رایگان
  • Clustering of Indian districts based on supply chain requirements Clustering of Indian districts based on supply chain requirements
    Clustering of Indian districts based on supply chain requirements

    سال انتشار:

    2021


    عنوان انگلیسی مقاله:

    Clustering of Indian districts based on supply chain requirements


    ترجمه فارسی عنوان مقاله:

    خوشه بندی مناطق هند براساس نیازهای زنجیره تامین


    منبع:

    Sciencedirect - Elsevier - Materials Today: Proceedings, Corrected proof: doi:10:1016/j:matpr:2021:02:292


    نویسنده:

    A. Baskar


    چکیده انگلیسی:

    Facility location problems refer to the selection and placement of a facility to best meet the intended requirements. The problem often consists of fixing manufacturing premises, process industry or office location that minimises the total weighted distances between the data points and the selected centre. The weights may be the constraints or preferences among the data points. The solution should comply with the stated or implied constraints and maximise the profit. Distance is one of the important con- straints that have a direct impact on supply chain costs. This paper considers the 661 districts of India (2011 census) as the data points and finds the centres by clustering the districts into the predefined number of clusters. These centres and number of districts attached to each centre vary depends on the supply chain requirements. We can assume that the main customers are located at the district headquarters and products are to be transmitted from the centres with minimum time and cost to these points. Different algorithms are used for fixing a facility; based on the population, based on the distance and so on. It is assumed that the districts’ headquarters represent the entire districts. Geodetic coordinates are collected for these 661 districts and Haversine formulae are used for converting them into earth-centric earth fixed (ECEF) × x,y and z coordinates. Using these coordinates, the popular Weiszfeld’s algorithm is used in addition to four other implementations to solve and find the clusters and total distance among the dis- tricts in each cluster. All algorithms are coded in MATLAB 2012a and run in an i5 PC with 4 GB RAM.© 2021 Elsevier Ltd. All rights reserved. Selection and Peer-review under responsibility of the scientific committee of the International Mechan- ical Engineering Congress 2019: Materials Science.
    Keywords: Facility Location | Clustering | Fermat-Weber Problem | Weiszfeld’s Algorithm


    سطح: متوسط
    تعداد صفحات فایل pdf انگلیسی: 6
    حجم فایل: 846 کیلوبایت

    قیمت: رایگان


    توضیحات اضافی:




اگر این مقاله را پسندیدید آن را در شبکه های اجتماعی به اشتراک بگذارید (برای به اشتراک گذاری بر روی ایکن های زیر کلیک کنید)

تعداد نظرات : 0

الزامی
الزامی
الزامی
rss مقالات ترجمه شده rss مقالات انگلیسی rss کتاب های انگلیسی rss مقالات آموزشی
logo-samandehi