检索结果-内蒙古大学图书馆

An interactive algorithm for multicriteria decision making: The attainable reference point method

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS 2001年第3期31卷 194-198页

作者： Wang, XMM Qin, ZLL Hu, YD Shanghai Jiao Tong Univ Dept Math Appl Shanghai Peoples R China Nantong Inst Technol Nantong Peoples R China Wunzhou Univ Sch Math & Informat Sci Wunzhou Peoples R China

An interactive algorithm the attainable reference point method is proposed for finding a satisfactory solution to a general multicriteria decision making problem, The decision-maker is only required to modify the reference value of the satisfactory objectives to generate a new attainable reference point in each iteration step, The lexicographic weighted Tchebycheff program associated with the attainable reference point is constructed to guarantee the efficiency of all discussed points. The value of the unsatisfactory objective chosen by the decision-maker is improved to be satisfactory, Thus its reference value doesn't need to be modified again in later iterations, and a satisfactory solution can be derived in finite steps. A numerical example is presented to demonstrate the feasibility and efficiency of the proposed method.

关键词： interactive algorithm multicriteria decision making reference point

来源：评论

学校读者我要写书评

暂无评论

A New interactive algorithm for Continuous Multiple Criteria Problems: A Portfolio Optimization Example

引用

INTERNATIONAL JOURNAL OF INFORMATION TECHNOLOGY & DECISION MAKING 2021年第1期20卷 371-398页

作者： Karakaya, Gulsah Sakar, Ceren Tuncer Middle East Tech Univ Dept Business Adm TR-06800 Ankara Turkey Hacettepe Univ Dept Ind Engn TR-06800 Ankara Turkey

In continuous multiple criteria problems, finding a distinct preferred solution for a decision maker (DM) is not straightforward. There are few recent studies proposed for this task, and the algorithms developed are cognitively difficult and complex for the DM in general. We propose a novel interactive algorithm to guide the DM in converging highly-preferred solutions in continuous multiple criteria problems. We test our algorithm on portfolio optimization problems formed with the stocks included in the S&P 100 index using expected return, liquidity, conditional value at risk, and mean absolute deviation as criteria. We simulate DM responses with linear and nonlinear preference functions and use various weights for the criteria. The experiments show that our algorithm is able to find highly-preferred solutions in considerably low number of iterations. We also test our algorithm against benchmark algorithms and demonstrate that our algorithm produces superior or comparable results.

关键词： Multiple criteria decision making interactive algorithm continuous problem portfolio optimization

来源：评论

学校读者我要写书评

暂无评论

An interactive algorithm for multiple criteria constrained sorting problem

引用

ANNALS OF OPERATIONS RESEARCH 2018年第1-2期267卷 447-466页

作者： Ozpeynirci, Selin Ozpeynirci, Ozgur Mousseau, Vincent Izmir Univ Econ Ind Engn Dept Izmir Turkey Izmir Univ Econ Dept Logist Management Izmir Turkey Univ Paris Saclay Cent Supelec Lab Genie Ind Chatenay Malabry France

In this study, we consider the multiple criteria constrained sorting problem and propose an interactive algorithm. The problem is to assign alternatives evaluated on multiple criteria to sorted categories where categories may have size restrictions. The proposed interactive algorithm determines the eligible categories for each alternative and the alternatives with a single eligible category are assigned to the corresponding categories. In case of no such alternative exists, the algorithm asks the DM to assign an alternative to a category and proceeds. The algorithm has the capability to detect and resolve any inconsistencies that may arise during the iterations. We implement the algorithm on two different real life problems considering two underlying sorting methods, MR-Sort and UTADIS and present the computational results.

关键词： Multiple criteria analysis Constrained sorting interactive algorithm

来源：评论

学校读者我要写书评

暂无评论

An interactive algorithm for resource allocation with balance concerns

引用

OR SPECTRUM 2021年第4期43卷 983-1005页

作者： Ozpeynirci, Selin Ozpeynirci, Ozgur Mousseau, Vincent Izmir Univ Econ Dept Ind Engn Izmir Turkey Univ Paris Saclay CentraleSupelec MICS Math & Informat Complexite & Syst Gif Sur Yvette France Izmir Univ Econ Dept Logist Management Izmir Turkey

We consider a resource allocation problem where a decision maker (DM) is to distribute a certain budget among alternative projects in order to create the best portfolio. The DM aims to generate a portfolio with (1) a high return and (2) a balanced distribution of resources among categories. We assume that the DM has a quasiconcave value function and provides no explicit value for the target distribution of resources over categories. We develop an interactive approach that requires the DM to make pairwise comparisons among alternative portfolios. We present the developed approach on an illustrative example and conduct an extensive computational experiment. In majority of the instances, the incumbent solution proposed by the algorithm is either equal or very close to the best solution.

关键词： Resource allocation Balance distribution Portfolio decision analysis interactive algorithm

来源：评论

学校读者我要写书评

暂无评论

An interactive algorithm to Construct an Appropriate Nonlinear Membership Function Using Information Theory and Statistical Method

An Interactive Algorithm to Construct an Appropriate Nonline...

引用

Conference on Engineering Cyber Physical Systems - Machine Learning, Data Analytics and Smart Systems Architecting

作者： Hasuike, Takashi Katagiri, Hideki Tsubaki, Hiroe Waseda Univ Fac Sci & Engn Shinjuku Ku 3-4-1 Okubo Tokyo 1698555 Japan Hiroshima Univ Grad Sch Engn Higashihiroshima Hiroshima 7398527 Japan Natl Stat Ctr Shinjuku Ku Tokyo 1628668 Japan

This paper develops a constructing algorithm for an appropriate membership function as objectively as possible. It is important to set an appropriate membership function for real-world decision making. The main academic contribution of our proposed algorithm is to integrate a general continuous and nonlinear function with fuzzy Shannon entropy into subjective interval estimation by a heuristic method under a given probability density function based on real-world data. Two main steps of our proposed approach are to set membership values a decision maker confidently judges whether an element is included in the given set or not and to obtain other values objectively by solving a mathematical programming problem with fuzzy Shannon entropy. It is difficult to solve the problem efficiently using previous constructing approaches due to nonlinear function. In this paper, the given nonlinear membership function is approximately transformed into a piecewise linear membership function, and the appropriate values are determined. Furthermore, by introducing natural assumptions in the real-world and interactively adjusting the membership values, an algorithm to obtain the optimal condition of each appropriate membership value is developed. (C) 2015 The Authors. Published by Elsevier B.V.

关键词： Fuzzy entropy Mathematical programming interactive algorithm

来源：评论

学校读者我要写书评

暂无评论

Computer Aided Realization of Gesar Cultural and Creative Product Design System based on interactive algorithm and Cyclic Graph Theory Model 5

Computer Aided Realization of Gesar Cultural and Creative Pr...

引用

5th International Conference on Inventive Computation Technologies (ICICT)

作者： Ge, Suo Lang Sang Sichuan Minzu Coll Kangding 626001 Sichuan Peoples R China

ISBN: (数字)9781665408370

ISBN: (纸本)9781665408387;9781665408370

Computer aided realization of Gesar cultural and creative product design system based on the interactive algorithm and cyclic graph theory model is studied in the paper. For the designed graph algorithm, an SGP problem is constructed to obtain an improved non-inferior solution, and Lagrange multipliers are used to obtain the desired marginal rate of substitution between objective functions. The SGP algorithm can enable decision makers to have a deeper understanding of the decision-making system, ensuring that the solution after each iteration will be more satisfactory to the decision makers than the previous one, and the solution after each iteration is a non-inferior solution. Then, for the systematic optimization, the analysis tools of each discipline have different definition requirements for the design model. Therefore, the integration of analysis program code of each discipline under framework of MDO is still a major task of MDO. Through the experimental analysis, the comparison simulation is conducted to verify the model.

关键词： Cyclic Graph Theory Computer Aided Realization CAD Product Design Smart System interactive algorithm

来源：评论

学校读者我要写书评

暂无评论

Contact Model Based on TCAD-Experimental interactive algorithm 20

Contact Model Based on TCAD-Experimental Interactive Algorit...

引用

International Conference on Simulation of Semiconductor Processes and Devices (SISPAD)

作者： Feng, Peijie Kim, Jiseok Cho, Jin Pandey, Shesh Mani Narayanan, Sudarshan Tng, Michelle Liu, Bingwu Banghart, Edmund Zhu, Baofu Zhao, Pei Rahman, Muhammad Park, Yumi Jiang, Liu Benistant, Francis GLOBALFOUNDRIES Malta NY 12020 USA GLOBALFOUNDRIES Albany NY 12203 USA GLOBALFOUNDRIES Singapore 528830 Singapore

ISBN: (纸本)9781467378604

This work demonstrated a novel method utilizing Sentaurus Technology Computer Aided Design simulation along with experiments to intermediately extract Schottky barrier height and contact resistance in FinFETs. The proposed algorithm can automatically calibrate contact model based on measurement data. This interactive contact model is also capable of prediction of contact resistance sensitivity including key process features such as implant energy, dose and thermal process based on a design of experiment splits. This robust, physical and efficient contact model provides insightful understandings of the metal-semiconductor contact in FinFETs. It can be easily implemented in simulation tools for device design in state-of-art semiconductor technology development.

关键词： Schottky Contact Barrier Height FinFET TCAD interactive algorithm

来源：评论

学校读者我要写书评

暂无评论

An interactive algorithm to Construct an Appropriate Nonlinear Membership Function Using Information Theory and Statistical Method

引用

Procedia Computer Science 2015年 61卷 32-37页

作者： Takashi Hasuike Hideki Katagiri Hiroe Tsubaki Faculty of Science and Engineering Waseda University 3-4-1 Okubo Shinjuku-ku Tokyo 169-8555 Japan Graduate School of Engineering Hiroshima University 1-4-1 Kagamiyama Higashi-Hiroshima Hiroshima 739-8527 Japan National Statistics Center 19-1 Wakamatsu-cho Shinjuku-ku Tokyo 162-8668 Japan

关键词： Fuzzy entropy Mathematical programming interactive algorithm

来源：评论

学校读者我要写书评

暂无评论

An interactive approximation algorithm for multi-objective integer programs

引用

COMPUTERS & OPERATIONS RESEARCH 2018年第Aug.期96卷 80-90页

作者： Lokman, Banu Koksalan, Murat Korhonen, Pekka J. Wallenius, Jyrki Middle East Tech Univ Dept Ind Engn TR-06800 Ankara Turkey Aalto Univ Sch Business Dept Informat & Serv Econ Helsinki Finland

We develop an interactive algorithm that approximates the most preferred solution for any multi-objective integer program with a desired level of accuracy, provided that the decision maker's (DM's) preferences are consistent with a nondecreasing quasiconcave value function. Using pairwise comparisons of the DM, we construct convex cones and eliminate the inferior regions that are close to being dominated by the cones in addition to the regions dominated by the cones. The algorithm allows the DM to change the desired level of accuracy during the solution process. We test the performance of the algorithm on a set of multi-objective combinatorial optimization problems. It performs very well in terms of the quality of the solution found, the solution time, and the required preference information. (C) 2018 Elsevier Ltd. All rights reserved.

关键词： Multi-objective integer programming Approximation algorithm interactive algorithm

来源：评论

学校读者我要写书评

暂无评论

interactive algorithms for a broad underlying family of preference functions

引用

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2018年第1期265卷 248-262页

作者： Karakaya, G. Koksalan, M. Ahipasaoglu, S. D. Middle East Tech Univ Dept Business Adm TR-06800 Ankara Turkey Middle East Tech Univ Dept Ind Engn TR-06800 Ankara Turkey Singapore Univ Technol & Design Pillar Engn Syst & Design Singapore Singapore

In multi-criteria decision making approaches it is typical to consider an underlying preference function that is assumed to represent the decision maker's preferences. In this paper we introduce a broad family of preference functions that can represent a wide variety of preference structures. We develop the necessary theory and interactive algorithms for both the general family of the preference functions and for its special cases. The algorithms guarantee to find the most preferred solution (point) of the decision maker under the assumed conditions. The convergence of the algorithms are achieved by progressively reducing the solution space based on the preference information obtained from the decision maker and the properties of the assumed underlying preference functions. We first demonstrate the algorithms on a simple bi-criteria problem with a given set of available points. We also test the performances of the algorithms on three-criteria knapsack problems and show that they work well. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Multiple objective programming interactive algorithm Search space reduction

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：