نوع مقاله : مقاله عمران
نویسندگان
1 گروه سنجش از دور و سیستم اطلاعات جغرافیایی، دانشکدة جغرافیا، دانشگاه تهران، تهران، ایران
2 ، گروه سنجش از دور و سیستم اطلاعات جغرافیایی، دانشکدة جغرافیا، دانشگاه تهران، تهران، ایران
3 گروه مهندسی نقشه،برداری، دانشکده مهندسی، دانشگاه گلستان، علی آباد کتول، ایران
چکیده
کلیدواژه‌ها
موضوعات
عنوان مقاله [English]
نویسندگان [English]
Here, an improved meta heuristic method is proposed to solve one of the most challenging nonlinear problems , known as non convex problems . In this type of problem, , we are faced with more than one minimum, all of which do not lead to the correct solution. This method is based on equipping the grey wolf meta heuristic algorithm with inequality constraints . Although various forms of the grey wolf algorithm have been proposed in the last few years, , none of them included inequality constraints, especially in the form presented here . The main advantage of the proposed algorithm in engineering applications is solving non convex optimization problems , where analytical methods may get stuck in a local minimum,, while the aforementioned algorithm is located in a global minimum . With two mathematical test , functions and one geodetic example, the efficiency of the proposed approach is evaluated.
کلیدواژه‌ها [English]
)