کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
396128 | 666250 | 2007 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Design of capacitated minimum spanning tree with uncertain cost and demand parameters
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
هوش مصنوعی
پیش نمایش صفحه اول مقاله

چکیده انگلیسی
The classical Capacitated Minimum Spanning Tree Problem (CMSTP) deals with finding a minimum-cost spanning tree so that the total demand of the vertices in each subtree does not exceed the capacity limitation. In most of the CMSTP models, the edge costs and the demands of the vertices in the network are assumed to be known with certainty. This paper considers the CMSTP model, where the edge costs and/or the demands are only approximately known. A fast approximate reasoning algorithm, which is based on the Esau–Williams savings heuristic and fuzzy logic rules, is proposed. The computational results of the study based on the proposed approach are also reported.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Information Sciences - Volume 177, Issue 20, 15 October 2007, Pages 4354–4367
Journal: Information Sciences - Volume 177, Issue 20, 15 October 2007, Pages 4354–4367
نویسندگان
Temel Öncan,