Classical Center Location Problem Under Uncertain Environment

الموضوعات : مجله بین المللی ریاضیات صنعتی

A. Soltanpour‎‎ ¹ , F. Baroughi‎‎ ² , B. Alizadeh ³

1 - Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran.
2 - Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran.
3 - Department of Applied Mathematics, Faculty of Basic Sciences, Sahand University of Technology, Tabriz, Iran.

تاريخ الإرسال : 05 السبت , شعبان, 1439 تاريخ التأكيد : 05 السبت , شعبان, 1439 تاريخ الإصدار : 10 الجمعة , ذو الحجة, 1438

الکلمات المفتاحية: Location Problem, $p$-center, uncertainty theory, Uncertain Programming&amp, lrm, ,

ملخص المقالة :

This paper investigates the $p$-center location problem on a network in which vertex weights and distances between vertices are uncertain. The concepts of the $\alpha$-$p$-center and the expected $p$-center are introduced. It is shown that the $\alpha$-$p$-center and the expected $p$-center models can be transformed into corresponding deterministic models. Finally, linear time algorithms for finding the 1-center and \\2-center of uncertain unweighted trees are ‎proposed.‎