نتایج جستجو برای: compromise solution approach
تعداد نتایج: 1694063 فیلتر نتایج به سال:
The aim of this paper is to adopt a compromise ratio (CR) methodology for fuzzy multi-attribute single-expert decision making proble. In this paper, the rating of each alternative has been described by linguistic terms, which can be expressed as triangular fuzzy numbers. The compromise ratio method for fuzzy multiattribute single expert decision making has been considered here by taking the ran...
this research uses a comprehensive method to solve a combinatorial problem of distribution network expansion planning (dnep) problem. the proposed multi-objective scheme aims to improve power system's accountability and system performance parameters, simultaneously, in the lowest possible costs. the dynamic programming approach is implemented in order to find the optimal sizing, siting and...
acceptance and commitment therapy (act) is a new development within behavioral therapy. its goal is to promote psychological flexibility. numerous studies show that suffering results when people attempt to avoid their inner experiences (experiential avoidance). this experiential avoidance often leads to rigid and inflexible behavior that also leads them to compromise their goals and what is imp...
The VIKOR method was introduced as a Multi-Attribute Decision Making (MADM) method to solve discrete decision-making problems with incommensurable and conflicting criteria. This method focuses on ranking and selecting from a set of alternatives based on the particular measure of “closeness” to the “ideal” solution. The multi-criteria measure for compromise ranking is developed from the l−p metr...
In optimal design problems we have to determine a set of design parameters such that a given mechanism satisfies a list of requirements. In practice however these requirements may be classified as either compulsory or relaxable. For classical optimal design methodologies, it is very difficult to find the solutions that satisfy compulsory requirements simultaneously and make the best compromise ...
The work presented in this thesis aims at proposing methods for computing bicycle paths across a metropolitan. Unlike the problem of the classical shortest path, here the context is multiobjective because several criteria such as distance, safety and effort must be considered in the path computation. In a multiobjective problem, there is no single solution, but a set of compromise solutions. Th...
In this paper, time-modulation is exploited for the synthesis of monopulse sub-arrayed antennas. The solution of the compromise sum-difference problem is obtained by setting the set of static excitations to an optimal sum set and synthesizing the “best compromise” difference pattern through a Continuous Partition Method (CPM ) based approach. The array elements are aggregated into sub-arrays co...
In order to solve the group decision making problems with ordinal interval preference information, a new decision method is proposed based on VIKOR method. The VIKOR method of compromise ranking determines a compromise solution, providing a maximum “group utility” for the “majority” and a minimum of an “individual regret” for the “opponent”, which is an effective tool in multi-attribute decisio...
Some performance issues of transactional memory are caused by unnecessary abort situations where non serializable and yet non conflicting transactions are scheduled to execute concurrently. Smartly relaxing the isolation properties of transactions may overcome these issues and attain considerable performance improvements. However, it is known that relaxing isolation restrictions may lead to run...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید