Cost Sensitive Multi-Granulation Preference Relation Rough Set for Ordinal Decision System

The preference analysis is a class of important issues in multi-criteria ordinal decision making.The rough set is an effective approach to handle preference analysis.In order to solve the multi-criteria preference analysis problems,this paper improves the preference relation rough set model and expands it to multi-granulation cases.Cost is also an important issue in the field of decision analysis.Taking the cost into consideration,we also expand the model to the cost sensitive multi-granulation preference relation rough set.Some theorems are represented,and the granule structure selection based on approximation quality is investigated.The experimental results show that the multi-granulation preference rough set approach with the consideration of cost has a better performance in granule structure selection than that without cost consideration.

Interactive group decision making procedure based on uncertain multiplicative linguistic preference relations

Group decision making problems are investigated with uncertain multiplicative linguistic preference relations.An unbalanced multiplicative linguistic label set is introduced,which can be used by the experts to express their linguistic preference information over alternatives.The uncertain linguistic weighted geometric mean operator is utilized to aggregate all the individual uncertain multiplicative linguistic preference relations into a collective one,and then a simple approach is developed to determine the experts＇ weights by utilizing the consensus degrees among the individual uncertain multiplicative linguistic preference relations and the collective uncertain multiplicative linguistic preference relations.Furthermore,a practical interactive procedure for group decision making is proposed based on uncertain multiplicative linguistic preference relations,in which a possibility degree formula and a complementary matrix are used to rank the given alternatives.Finally,the proposed procedure is applied to solve the group decision making problem of a manufacturing company searching the best global supplier for one of its most critical parts used in assembling process.

A novel model on dynamic resource allocation in optical networks

A novel model on dynamic resource allocation in the WDM optical networks is proposed, basing on the integrated considerations of the impacts of transmission impairments and service classification on dynamic resource allocation in the optical layer. In this model, the priorities of optical connection requests are mapped into different thresholds of transmission impairments, and a uniform method which is adopted to evaluate the virtual wavelength path (VWP) candidates is defined. The Advanced Preferred Wavelength Sets Algorithm (A-PWS) and the heuristic Dynamic Min-Cost & Optical Virtual Wavelength Path Algorithm (DMC-OVWP) are presented addressing the routing and wavelength assignment (RWA) problem based on dynamic traffic and multi priorities in wavelength-routed optical networks. For a received optical connection request, DMC-OVWP is employed to calculate a list of the VWP candidates, and an appropriate VWP which matches the request's priority is picked up to establish the lightpath by analyzing the transmission qualities of the VWP candidates.