کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6896642 1446005 2015 8 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
TSP Race: Minimizing completion time in time-sensitive applications
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
TSP Race: Minimizing completion time in time-sensitive applications
چکیده انگلیسی
In this paper, we present an approach for parallelizing computation and implementation time for problems where the objective is to complete the solution as soon after receiving the problem instance as possible. We demonstrate the approach on the TSP. We define the TSP race problem, present a computation-implementation parallelized (CIP) approach for solving it, and demonstrate CIP's effectiveness on TSP Race instances. We also demonstrate a method for determining a priori when CIP will be effective. Although in this paper we focus on TSP, our general CIP approach can be effective on other problems and applications with similar time sensitivity.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 244, Issue 1, 1 July 2015, Pages 47-54
نویسندگان
, ,