International Journal of Engineering، جلد ۲۵، شماره ۴، صفحات ۲۹۳-۳۰۲

عنوان فارسی
چکیده فارسی مقاله
کلیدواژه‌های فارسی مقاله

عنوان انگلیسی A Facility Location Problem with Tchebychev Distance in the Presence of a Probabilistic Line Barrier
چکیده انگلیسی مقاله This paper considers the Tchebychev distance for a facility location problem with a probabilistic line barrier in the plane. In particular, we develop a mixed-integer nonlinear programming (MINLP) model for this problem that minimizes the total Tchebychev distance between a new facility and the existing facilities. A numerical example is solved to show the validity of the developed model. Because of difficulty in solving this problem while increasing the number of existing facilities, we propose and design an efficient meta-heuristic algorithm, namely differential evolution (DE), for the given problem. Finally, the associated results are compared with the exact solution and lower bound for the different-sized problems.
کلیدواژه‌های انگلیسی مقاله

نویسندگان مقاله Mehdi Amiri-Aref |
Industrial Engineering, Mazandaran University of Science & Technology

Reza Tavakkoli-Moghaddam |
Industrial Engineering, University of Tehran

Farzad Mahmood-Soltani |
Department of Industrial Engineering, Mazandaran University of Science and Technology

nikbaksh Javadian |
Department of Industrial Engineering, Mazandaran University of Science and Technology


نشانی اینترنتی http://www.ije.ir/article_72039_0fbf5adf8ec790efa575520a5c7cb048.pdf
فایل مقاله اشکال در دسترسی به فایل - ./files/site1/rds_journals/409/article-409-2062971.pdf
کد مقاله (doi)
زبان مقاله منتشر شده en
موضوعات مقاله منتشر شده
نوع مقاله منتشر شده
برگشت به: صفحه اول پایگاه   |   نسخه مرتبط   |   نشریه مرتبط   |   فهرست نشریات