این سایت در حال حاضر پشتیبانی نمی شود و امکان دارد داده های نشریات بروز نباشند
Iranian Journal of Numerical Analysis and Optimization، جلد ۱۰، شماره ۲، صفحات ۳۳-۴۸
عنوان فارسی
چکیده فارسی مقاله
کلیدواژه‌های فارسی مقاله
عنوان انگلیسی Solving biobjective network flow problem associated with minimum cost-time loading
چکیده انگلیسی مقاله We apply a primal-dual simplex algorithm for solving the biobjective min imum cost-time network flow problem such that the total shipping cost and the total shipping fixed time are considered as the first and second objective functions, respectively. To convert the proposed model into a single-objective parametric one, the weighted sum scalarization technique is commonly used. This problem is a mixed-integer programming, which the decision variables are directly dependent together. Generally, the previous works have consid ered the linear biobjective problem with the traditional network flow con straints, while in this paper, corresponding to each flow variable, a binary variable is defined. These zero-one variables are utilized to describe a fixed shipping time for positive flows. The proposed method is successful in finding all supported efficient solutions of a real numerical example.
کلیدواژه‌های انگلیسی مقاله Biobjective network flow, Minimum cost-time, Primal-dual algorithm, Fixed time
نویسندگان مقاله Omid Baghani |
Department of Applied Mathematics, Faculty of Mathematics and Computer Sciences, Hakim Sabzevari University, P.O. Box 397, Sabzevar, Iran.

Saideh Ghafoori |
Department of Mathematics, Faculty of Mathematics, Statistics and Computer Science, Semnan University, P.O. Box 363, Semnan, Iran.

نشانی اینترنتی https://ijnao.um.ac.ir/article_25356_83be479ab5da83b86e0e5ad2676a3cab.pdf
فایل مقاله فایلی برای مقاله ذخیره نشده است
کد مقاله (doi)
زبان مقاله منتشر شده en
موضوعات مقاله منتشر شده
نوع مقاله منتشر شده
برگشت به: صفحه اول پایگاه   |   نسخه مرتبط   |   نشریه مرتبط   |   فهرست نشریات