کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
475737 | 699368 | 2011 | 12 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Multi-objective and multi-constrained non-additive shortest path problems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Multi-objective and multi-constrained non-additive shortest path problems Multi-objective and multi-constrained non-additive shortest path problems](/preview/png/475737.png)
چکیده انگلیسی
Shortest path problems appear as subproblems in numerous optimization problems. In most papers concerning multiple objective shortest path problems, additivity of the objective is a de-facto assumption, but in many real-life situations objectives and criteria, can be non-additive. The purpose of this paper is to give a general framework for dominance tests for problems involving a number of non-additive criteria. These dominance tests can help to eliminate paths in a dynamic programming framework when using multiple objectives. Results on real-life multi-objective problems containing non-additive criteria are reported. We show that in many cases the framework can be used to efficiently reduce the number of generated paths.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 38, Issue 3, March 2011, Pages 605–616
Journal: Computers & Operations Research - Volume 38, Issue 3, March 2011, Pages 605–616
نویسندگان
Line Blander Reinhardt, David Pisinger,