CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

A New Nested Partitions Method for the Minimum labeling Spanning Tree Problem

عنوان مقاله: A New Nested Partitions Method for the Minimum labeling Spanning Tree Problem
شناسه ملی مقاله: ICIORS03_186
منتشر شده در سومین کنفرانس بین المللی انجمن تحقیق در عملیات ایران در سال 1388
مشخصات نویسندگان مقاله:

Kamran Shahanaghi - Iran University of Science and Technology - Industrial Engineering
A. Zadbood - Iran University of Science and Technology. - Department of Industrial Engineering

خلاصه مقاله:
In this study, a simulation-based optimization method called the Nested Partitions Method is used. Partitioning, Random sampling, Index Promising and back tracking is applied to reach a global Optimum. In this method local search is combined with global search to get more effectiveness. It reaches a global optimumwith probability one.Here this method is applied to find the Minimum labeling Spanning Tree. Given an undirected labeled connected graph, the minimum labeling spanning tree problem seeks a spanning tree whose edges have the smallest number of distinct labels. We present a numerical example to illustrate the method comprehensively.

کلمات کلیدی:
Nested Partitions Method, The Minimum labeling Spanning Tree Problem, Simulation-basedoptimization

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/671083/