A New Heuristic Algorithm for Maximization Total Demands of Nodes and Number of Covered Nodes, Simultaneously
Mehdi Eghbali - Ehsan Saghehei
Mehdi Eghbali - Ehsan Saghehei
Islamic Azad University, Qazvin, Iran - Department of Industrial Engineering, Malayer Branch, Islamic Azad University, Malayer, Iran
زبان مقاله : انگلیسی |
تعداد صفحات مقاله : 11 صفحه |
نوع مقاله : مقاله شفاهی |
ISC کد مقاله در : ISC1080_345272
چکیده
The maximal covering location problem (M.C.L.P) was originally developed to determine a set of facility locations which would maximize the total customers' demand serviced by the facilities within a predetermined critical service criterion. However, on some problems that differences between the demand nodes are covered or the number of nodes each node is large, the method of solving MCLP may ignore these differences. In this paper, Heuristic solution based on the ranking of demands in each node and the number of nodes covered by each node according to a predetermined critical value is proposed. The output of this method is to maximize total demands of nodes and number of covered nodes, simultaneously. Furthermore, by providing an example, the solution algorithm is described and its results are compared with Greedy and Lagrange algorithms. Also, the results of the algorithm to solve the larger problem sizes that compared with other methods are provided. A summary and future works conclude the paper.کليدواژه ها
Heuristic solution, Maximal Covering Location Problem, Ranking, Set Covering.Introductionنحوه استناد به مقاله
در صورتی که می خواهید در اثر پژوهشی خود به این مقاله ارجاع دهید، به سادگی می توانید از عبارت زیر در بخش منابع و مراجع استفاده نمایید:Eghbali , Mehdi , 1394 , A New Heuristic Algorithm for Maximization Total Demands of Nodes and Number of Covered Nodes, Simultaneously , دوازدهمین کنفرانس بین المللی مهندسی صنایع
انتشار دهنده
محل انتشار : دوازدهمین کنفرانس بین المللی مهندسی صنایعمشخصات برگزارکننده همایش : دانشگاه خوارزمی و انجمن مهندسی صنایع ایران
تعداد مقالات : 534
کد اختصاصی :
۹۴۱۵۰-۶۲۳۰۲
a>
دیگر مقالات این رویداد
© کلیه حقوق متعلق به موسسه استنادی و پایش علم و فناوری جهان اسلام (ISC) می باشد.