رجب پور صنعتی, ستار

[ 1 ] - ارائه یک الگوریتم ابتکاری جدید برای حل مساله مکان‌یابی پوشش کلی

Set covering problem has many applications such as emergency systems, retailers’ facilities, hospitals, radar devices, and military logistics, and it is considered as Np-Hard problems. The goal of set covering problem is to find a subset such that :::::::::union::::::::: of the subset members covered the whole set. In this paper, we present a new heuristic algorithm to solve the set covering pr...