Inverse multiobjective shortest path problem under the bottleneck type weighted Hamming distance

سال انتشار: 1396
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 346

فایل این مقاله در 6 صفحه با فرمت PDF قابل دریافت می باشد

استخراج به نرم افزارهای پژوهشی:

لینک ثابت به این مقاله:

شناسه ملی سند علمی:

ICIORS10_087

تاریخ نمایه سازی: 11 شهریور 1397

چکیده مقاله:

Given a network G = (V, A, c), a source node s and a set of directed paths ᴨ from s to all other nodes, an inverse multiobjective shortest path problem is to modify the cost matrix c as little as possible so that every path P in ᴨ becomes an efficient path. The modification can be measured by various distances. In this paper, we consider the bottleneck type weighted Hamming distance and propose an algorithm to solve the inverse multiobjective shortest path problem under the bottleneck type weighted Hamming distance when the network is an augmented tree.

کلیدواژه ها:

multiobjective shortest path problem ، inverse problem ، Hamming distances

نویسندگان

Mobarakeh Karimi

Department of Mathematics, University of Birjand

Massoud Aman

Department of Mathematics, University of Birjand