TY - JOUR T1 - Simultaneous Location-Allocation of multiple Facilities using Multi-objective Evolutionary Algorithm based on Decomposition TT - مکانیابی و تخصیص همزمان انواع مراکز خدماتی با استفاده از الگوریتم تکاملی چندهدفه مبتنی بر تجزیه JF - kntu-jgit JO - kntu-jgit VL - 9 IS - 2 UR - http://jgit.kntu.ac.ir/article-1-822-en.html Y1 - 2021 SP - 29 EP - 49 KW - Location-Allocation KW - GIS KW - Multi-objective optimization KW - MOEA/D KW - P-median model. N2 - Choosing the proper location for service centers can play an important role in reducing travel costs for users, desirable use of the land, and regulation of interactions among different facilities. When Location-Allocation (L.A.) problem of any new service centers is solved for multiple facilities independently, only the effects of existing land uses are taken into consideration , while the establishment of one facility, due to its impact on the surrounding space, may cause limitations for the establishment of other required facilities. By locating all the required centers simultaneously, better results can be obtained for the arrangement of the centers in an area. The main objective of this study is to solve the L.A. problem for several service centers with similar or dissimilar services in GIS environment simultaneously. For this purpose, the Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) algorithm has been used to optimize the three objective functions including minimizing travel costs, maximizing the suitability of selected sites, and maximizing the compatibility among the new service centers. The results showed that by using this method, acceptable solutions for the arrangement of different service centers in the study area have been obtained according to the defined objectives. The comparison of the results with Non-Dominated Sorting Genetic Algorithm II (NSGA_II), as one of the most common optimization algorithms, based on various criteria, showed that MOEA/D method has performed well in finding optimized answers so that none of the solutions of this method were dominated by the solutions of the NSGA_II, while the reverse was not true. Besides, from the point of view of the closeness of the answers to the ideal point, MOEA/D has generated better solutions (0.16) and the covered time has been 25% of NSGA_ II method. M3 10.52547/jgit.9.2.29 ER -