کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10348026 | 699371 | 2013 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits](/preview/png/10348026.png)
چکیده انگلیسی
We test the procedures on the Traveling Salesman Problem with Profits, where profits and costs are treated as conflicting objectives. Results are taken on randomly generated instances and on TSPLIB instances. We show that both algorithms return a guaranteed approximation with significant time sparing with respect to exact procedures. We also give empirical evidence that in the specific application the number of points returned by the approximation schemes is close to the minimum.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 40, Issue 10, October 2013, Pages 2418-2428
Journal: Computers & Operations Research - Volume 40, Issue 10, October 2013, Pages 2418-2428
نویسندگان
Carlo Filippi, Elisa Stevanato,