Download Multi-objective Group Decision Making: Methods, Software and by Jie Lu; Guangquan Zhang; Da Ruan PDF

By Jie Lu; Guangquan Zhang; Da Ruan

This publication proposes a suite of types to explain fuzzy multi-objective choice making (MODM), fuzzy multi-criteria choice making (MCDM), fuzzy crew selection making (GDM) and fuzzy multi-objective staff decision-making difficulties, respectively. It additionally supplies a collection of similar tools (including algorithms) to resolve those difficulties. One distinguishing characteristic of this e-book is that it presents selection help structures software program for readers to use those proposed equipment. a suite of real-world purposes and a few new instructions during this sector are then defined to extra show readers how you can use those tools and software program of their perform.

Show description

Read Online or Download Multi-objective Group Decision Making: Methods, Software and Applications With Fuzzy Set Techniques PDF

Similar programming books

Pro Design Patterns in Swift

The speedy programming language has reworked the area of iOS improvement and began a brand new age of recent improvement. seasoned layout styles in quick indicates you ways to harness the ability and suppleness of fast to use an important and enduring layout styles for your functions, taking your improvement initiatives to grasp point.

Multi-objective Group Decision Making: Methods, Software and Applications With Fuzzy Set Techniques

This publication proposes a suite of types to explain fuzzy multi-objective choice making (MODM), fuzzy multi-criteria choice making (MCDM), fuzzy staff selection making (GDM) and fuzzy multi-objective workforce decision-making difficulties, respectively. It additionally supplies a collection of similar tools (including algorithms) to unravel those difficulties.

Principles and Practice of Constraint Programming - CP 2005: 11th International Conference, CP 2005, Sitges, Spain, October 1-5, 2005. Proceedings

This publication constitutes the refereed court cases of the eleventh foreign convention on ideas and perform of Constraint Programming, CP 2005, held in Sitges, Spain, in October 2005. The forty eight revised complete papers and 22 revised brief papers awarded including prolonged abstracts of four invited talks and forty abstracts of contributions to the doctoral scholars software in addition to 7 abstracts of contributions to a platforms demonstration consultation have been conscientiously reviewed and chosen from 164 submissions.

Integer Programming and Combinatorial Optimization: 7th International IPCO Conference Graz, Austria, June 9–11, 1999 Proceedings

This booklet constitutes the refereed court cases of the seventh foreign convention on Integer Programming and Combinatorial Optimization, IPCO'99, held in Graz, Austria, in June 1999. The 33 revised complete papers offered have been conscientiously reviewed and chosen from a complete of ninety nine submissions. one of the subject matters addressed are theoretical, computational, and application-oriented elements of approximation algorithms, department and certain algorithms, computational biology, computational complexity, computational geometry, slicing aircraft algorithms, diaphantine equations, geometry of numbers, graph and community algorithms, on-line algorithms, polyhedral combinatorics, scheduling, and semidefinite courses.

Additional info for Multi-objective Group Decision Making: Methods, Software and Applications With Fuzzy Set Techniques

Sample text

But obviously this method is slow and sometimes, group members may feel resentful at having their ideas voted as unpopular. • Ranking rule Several similar ranking methods have been used in practice and all assume the group has a number of alternatives. One is to let group members individually give a score to each alternative. Suppose the group has five alternatives, each member ranks each alternative from 1 (lowest) to 10 (highest). The votes are then calculated and the alternative with the highest total score is selected.

Although it may be too expensive for all group members to have complete information for their decision tasks, information sharing is the most important element to improve the quality of group decision. Another related issue is about bargaining and negotiation in group decision process. A decision group should be negotiable in order to achieve a consensus-based solution. When a common decision fails, it becomes necessary for group members to start bargaining or negotiating until a consensus is reached.

The key idea behind GP is to minimise the deviations from goals or aspiration levels set by decision makers. GP therefore, in most cases, seems to yield a satisfactory solution rather than an optimisation one. By introducing the auxiliary variables, the Linear GP (LGP) problem can be converted to an equivalent linear programming problem. The third class, interactive methods, requires more decision makers involvement in the solution process. The interaction takes place through decision makers-computer interface at the each iteration.

Download PDF sample

Rated 4.70 of 5 – based on 42 votes