کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
476477 699483 2005 26 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Experimental evaluation of solution approaches for the K-route maximum flow problem
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
Experimental evaluation of solution approaches for the K-route maximum flow problem
چکیده انگلیسی

We describe the implementation and testing of approaches for the solution of the maximum K-route flow problem. More specifically, we focus on Kishimoto's algorithm, the binary search algorithm and the K-route flow algorithm. With the aim to compare the performances of the aforementioned methods, we report results of computational experiments carried out on a large set of randomly generated problems with varying topology and arc capacities. The numerical results show that Kishimoto's algorithm is generally the fastest for solving fully random networks and 3-D grid random networks. The binary search algorithm provides the best performance in solving grid random networks. The K-route flow algorithm is generally the fastest for solving fully random networks and 3-D grid random networks with capacity range of [1,1000] and certain values of K.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 32, Issue 9, September 2005, Pages 2453–2478
نویسندگان
, ,