این سایت در حال حاضر پشتیبانی نمی شود و امکان دارد داده های نشریات بروز نباشند
International Journal of Engineering، جلد ۲۸، شماره ۵، صفحات ۷۱۷-۷۲۹
عنوان فارسی
چکیده فارسی مقاله
کلیدواژه‌های فارسی مقاله
عنوان انگلیسی A Reliable Multi-objective p-hub Covering Location Problem Considering of Hubs Capabilities
چکیده انگلیسی مقاله In the facility location problem usually reducing total transferring cost and time are common objectives. Designing of a network with hub facilities can improve network efficiency. In this study a new model is presented for P-hub covering location problem. In the p-hub covering problem it is attempted to locate hubs and allocate customers to established hubs while allocated nodes to hubs are inside of related hubs covering radius. In this paper we attempt to consider capability of established hubs according to their corresponding capabilities on sorting operation. Moreover the reliability of network is considered in the proposed model as an objective. The proposed multi objective model is solved by ε-constraint algorithm for small size instances. For large scale instances a non-dominated sorting genetic algorithm (NSGA-II) is presented to obtain Pareto solutions and its performance is compared with results of ε-constraint algorithm. The model and solution algorithm were analyzed by more numerical examples and some sensitivity analysis have been done. The analysis confirms that the network extracted by the proposed model is more efficient than classic networks.
کلیدواژه‌های انگلیسی مقاله
نویسندگان مقاله mohammad rezanezhad |
Industrial Engineering, Shahed University

Mahdi Bashiri |
Industrial Engineering, Shahed University

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