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

Fuzzy linear programming technique for multiattribute group decision making in fuzzy environments

INFORMATION SCIENCES 2004年第1-4期158卷 263-275页

作者： Li, DF Yang, JB Univ Manchester Inst Sci & Technol Manchester Sch Management Manchester M60 1QD Lancs England

The aim of this paper is to develop a linear programming technique for multidimensional analysis of preferences in multiattribute group decision making under fuzzy environments. Fuzziness is inherent in decision data and group decision making processes, and linguistic variables are well suited to assessing an alternative on qualitative attributes using fuzzy ratings. A crisp decision matrix can be converted into a fuzzy decision matrix once the decision makers' fuzzy ratings have been extracted. In this paper, we first define group consistency and inconsistency indices based on preferences to alternatives given by decision makers and construct a linear programming decision model based on the distance of each alternative to a fuzzy positive ideal solution which is unknown. Then the fuzzy positive ideal solution and the weights of attributes are estimated using the new decision model based on the group consistency and inconsistency indices. Finally, the distance of each alternative to the fuzzy positive ideal solution is calculated to determine the ranking order of all alternatives. A numerical example is examined to demonstrate the implementation process of the technique. (C) 2003 Elsevier Inc. All rights reserved.

关键词： fuzzy multiattribute group decision making linear programming technique for multidimensional analysis of preference linguistic variable fuzzy number linear programming

来源：评论

学校读者我要写书评

暂无评论

A hybrid heuristic algorithm for the multistage supply chain network problem

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2005年第5-6期26卷 675-685页

作者： Yeh, WC Natl Chiayi Univ Dept Appl Math e Integrat & Collaborat Lab Taichung 408 Taiwan

In recent years, many developments in logistics were connected to the need for information in an efficient supply chain flow. The supply chain is often represented as a network called a supply chain network (SCN) that is comprised of nodes that represent facilities (suppliers, plants, distribution centers and customers). Arcs connect these nodes along with the production flow. A multistage SCN (MSCN) is a sequence of multiple SCN stages. The flow can only be transferred between two consecutive stages. The MSCN problem involves the choice of facilities (plants and distribution centers) to be opened and the distribution network design must satisfy the demand with minimum cost. In this paper, a revised mathematical model is first proposed to correct the fatal error appearing in the existing models. An efficient hybrid heuristic algorithm (HHA) was developed by combining a greedy method (GM), the linear programming technique (LP) and three local search methods (LSMs) (always used in solving the scheduling problem). The pair-wise exchange procedure (XP), the insert procedure (IP) and the remove procedure (RP) to solve the MSCN problem. Preliminary computational experiments demonstrate the efficiency and performance of the proposed HHA.

关键词： greedy method heuristic algorithm linear programming technique multistage supply chain network

来源：评论

学校读者我要写书评

暂无评论

An efficient memetic algorithm for the multi-stage supply chain network problem

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2006年第7-8期29卷 803-813页

作者： Yeh, Wei-Chang Natl Tsing Hua Univ Dept Ind Engn & Engn Management Hsinchu 300 Taiwan

A supply chain is dynamic and involves the constant flow of information, production, services, and funds from suppliers to customers between different stages. In this paper, a memetic algorithm (MA, a hybrid genetic algorithm) is developed to find the strategy that can give the lowest cost of the physical distribution flow. The proposed MA is combined with the genetic algorithm (GA), a multi-greedy heuristic method (GH), three local search methods (LSMs): the pairwise exchange procedure (XP), the insert procedure (IP), and the remove procedure (RP), the Fibonacci number procedure, and the linear programming technique (LP) to improve the tradition genetic algorithm (GA). Preliminary computational experiments demonstrate the efficiency and performance of the proposed MA.

关键词： Fibonacci number genetic algorithm greedy heuristic algorithm linear programming technique local search methods memetic algorithm network supply chain

来源：评论

学校读者我要写书评

暂无评论

Time-optimal control of kinematically redundant manipulators with limit heat characteristics of actuators

引用

ADVANCED ROBOTICS 2002年第8期16卷 735-749页

作者： Ma, SG Watanabe, M Ibaraki Univ Fac Engn Dept Syst Engn Hitachi Ibaraki 3168511 Japan

In this study, we present a time-optimal control scheme for kinematically redundant manipulators to track a predefined geometric path, subject to the limit heat characteristics of actuators (a DC motor was assumed to be the actuator used). Constraints due to the rated torque and the rated velocity of the motor would not be valid for continuous use of manipulators, since the required mechanical output of the actuator (DC motor) exceeds its maximum power capacity and far more exceeds its heat-converted power limit. The heat-converted power limit of the DC motor is thus considered as the actuation bound of the actuator and the time-optimal trajectories are generated by using the phase-plane analysis and the linear programming technique subject to this bound. Computer simulation was also executed on a three-link planar rotary manipulator to demonstrate the effectiveness of the proposed scheme.

关键词： kinematically redundant manipulator time-optimal control limit heat characteristics of a DC motor heat-converted power phase plane analysis linear programming technique

来源：评论

学校读者我要写书评

暂无评论

POLYHEDRAL COHERENT RISK MEASURES AND INVESTMENT PORTFOLIO OPTIMIZATION

引用

CYBERNETICS AND SYSTEMS ANALYSIS 2008年第2期44卷 250-260页

作者： Kirilyuk, V. S. Natl Acad Sci Ukraine VM Glushkov Inst Cybernet Kiev Ukraine

The paper studies a class of polyhedral coherent risk measures for risk- return portfolio optimization problems under partial uncertainty, with unknown scenario probabilities estimated by some polyhedron. Such portfolio problems are reduced to linear programming problems. As an example, continuous problems of optimal investment allocation under risk of catastrophic floods are described.

关键词： polyhedral coherent risk measure conditional value-at-risk optimal portfolio problem linear programming technique catastrophic flood

来源：评论

学校读者我要写书评

暂无评论

Developments towards the slice-wise three-dimensional reconstruction of the distribution of the contrast perfusion in the myocardial muscle from biplane angiographic views

引用

The International Journal of Cardiac Imaging 1990年第2-3期5卷 213-224页

作者： Dumay, Adrie C.M. Zijdenbos, Alex P. Pinto, Ibraïn M.F. Gerbrands, Jan J. Roos, Cees Serruys, Patrick W. Reiber, Johan H.C. Thoraxcenter Erasmus University and University Hospital Rotterdam-Dijkzigt Rotterdam Netherlands Department of Electrical Engineering Delft University of Technology Delft Netherlands

In theory, radiographic myocardial perfusion imaging allows a quantitative assessment of the functional significance of a coronary stenosis. However, in the conventional two-dimensional projection images there does not exist a one-two-one relationship between a selected myocardial region of interest (ROI) and one particular coronary segment perfusing that area due to over-projection of myocardial regions in front of and behind the selected ROI perfused by other arterial segments, which may result in measurements which are difficult to interpret or even unreliable. To overcome these problems, we have developed two algorithms to determine the spatial distribution of perfusion levels in slices of the heart, selected approximately perpendicular to the left ventricular long axis, from two orthogonal angiographic views: the Segmental Reconstruction technique (SRT) and the Network programming Reconstruction technique (NPRT). Both techniques require a priori geometric information about the myocardium, which can be obtained from the epicardial coronary tree (epicardial boundaries) and the left ventricular lumen (endocardial boundaries). Using the SRT approach, pie-shaped segments are defined for each slice within the myocardial geometric constraints such that superimposition of these segments when projected in orthogonal biplane views is minimal. The reconstruction process uses a model with identical myocardial geometry and definition of segments. Each segment of the model is assigned a relative perfusion level with unit one if no other a priori information is available. In this case, the model contains geometric information only. In case a priori information about expected segmental perfusion levels is available, a level between zero and one is assigned to each segment. The a priori information on the myocardial perfusion levels can be extracted from either anatomic information about the location and severity of existing coronary arterial obstructions, or from a slice adjac

关键词： coronary flow reserve linear programming technique myocardial contrast perfusion three-dimensional reconstruction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：