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

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

عنوان انگلیسی A Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem
چکیده انگلیسی مقاله In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, caused consequently, increase the air pollution. In this paper, two green approaches are introduced which demand is the main uncertain parameter in both. These approaches are addressed to provide a trade-off between using available trucks and buying new hybrid trucks for evaluating total costs beside air pollution. Due to growing complexity, a Lagrangian decomposition algorithm is applied to find a tight lower bound for each approach. In this propounded algorithm, the main model is decomposed into master and subproblems to speed up convergence with a tight gap. Finally, the suggested algorithm is compared with commercial solver regarding total cost and computational time. Due to computational results for the proposed approach, the Lagrangian decomposition algorithm is provided a close lower bound in less time against commercial solver.
کلیدواژه‌های انگلیسی مقاله

نویسندگان مقاله A. Rouhani |
Department of Industrial Engineering, Shahed University, Teheran, Iran

M. Bashiri |
Department of Industrial Engineering, Shahed University, Teheran, Iran

R. Sahraeian |
Department of Industrial Engineering, Shahed University, Teheran, Iran


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