Ching-Lai Hwang

Bio: Ching-Lai Hwang is an academic researcher from Kansas State University. The author has contributed to research in topics: Linear programming & Decision analysis. The author has an hindex of 34, co-authored 53 publications receiving 25558 citations. Previous affiliations of Ching-Lai Hwang include Fairleigh Dickinson University & Wichita State University.

Multiple Attribute Decision Making: Methods and Applications

Abstract: I. Introduction.- II. Multiple Attribute Decision Making - An Overview.- 2.1 Basics and Concepts.- 2.2 Classifications of MADM Methods.- 2.2.1 Classification by Information.- 2.2.2 Classification by Solution Aimed At.- 2.2.3 Classification by Data Type.- 2.3 Description of MADM Methods.- Method (1): DOMINANCE.- Method (2): MAXIMIN.- Method (3): MAXIMAX.- Method (4): CONJUNCTIVE METHOD.- Method (5): DISJUNCTIVE METHOD.- Method (6): LEXICOGRAPHIC METHOD.- Method (7): LEXICOGRAPHIC SEMIORDER METHOD.- Method (8): ELIMINATION BY ASPECTS (EBA).- Method (9): LINEAR ASSIGNMENT METHOD (LAM).- Method (10): SIMPLE ADDITIVE WEIGHTING METHOD (SAW).- Method (11): ELECTRE (Elimination et Choice Translating Reality).- Method (12): TOPSIS (Technique for Order Preference by Similarity to Ideal Solution).- Method (13): WEIGHTED PRODUCT METHOD.- Method (14): DISTANCE FROM TARGET METHOD.- III. Fuzzy Sets and their Operations.- 3.1 Introduction.- 3.2 Basics of Fuzzy Sets.- 3.2.1 Definition of a Fuzzy Set.- 3.2.2 Basic Concepts of Fuzzy Sets.- 3.2.2.1 Complement of a Fuzzy Set.- 3.2.2.2 Support of a Fuzzy Set.- 3.2.2.3 ?-cut of a Fuzzy Set.- 3.2.2.4 Convexity of a Fuzzy Set.- 3.2.2.5 Normality of a Fuzzy Set.- 3.2.2.6 Cardinality of a Fuzzy Set.- 3.2.2.7 The mth Power of a Fuzzy Set.- 3.3 Set-Theoretic Operations with Fuzzy Sets.- 3.3.1 No Compensation Operators.- 3.3.1.1 The Min Operator.- 3.3.2 Compensation-Min Operators.- 3.3.2.1 Algebraic Product.- 3.3.2.2 Bounded Product.- 3.3.2.3 Hamacher's Min Operator.- 3.3.2.4 Yager's Min Operator.- 3.3.2.5 Dubois and Prade's Min Operator.- 3.3.3 Full Compensation Operators.- 3.3.3.1 The Max Operator.- 3.3.4 Compensation-Max Operators.- 3.3.4.1 Algebraic Sum.- 3.3.4.2 Bounded Sum.- 3.3.4.3 Hamacher's Max Operator.- 3.3.4.4 Yager's Max Operator.- 3.3.4.5 Dubois and Prade's Max Operator.- 3.3.5 General Compensation Operators.- 3.3.5.1 Zimmermann and Zysno's ? Operator.- 3.3.6 Selecting Appropriate Operators.- 3.4 The Extension Principle and Fuzzy Arithmetics.- 3.4.1 The Extension Principle.- 3.4.2 Fuzzy Arithmetics.- 3.4.2.1 Fuzzy Number.- 3.4.2.2 Addition of Fuzzy Numbers.- 3.4.2.3 Subtraction of Fuzzy Numbers.- 3.4.2.4 Multiplication of Fuzzy Numbers.- 3.4.2.5 Division of Fuzzy Numbers.- 3.4.2.6 Fuzzy Max and Fuzzy Min.- 3.4.3 Special Fuzzy Numbers.- 3.4.3.1 L-R Fuzzy Number.- 3.4.3.2 Triangular (or Trapezoidal) Fuzzy Number.- 3.4.3.3 Proof of Formulas.- 3.4.3.3.1 The Image of Fuzzy Number N.- 3.4.3.3.2 The Inverse of Fuzzy Number N.- 3.4.3.3.3 Addition and Subtraction.- 3.4.3.3.4 Multiplication and Division.- 3.5 Conclusions.- IV. Fuzzy Ranking Methods.- 4.1 Introduction.- 4.2 Ranking Using Degree of Optimality.- 4.2.1 Baas and Kwakernaak's Approach.- 4.2.2 Watson et al.'s Approach.- 4.2.3 Baldwin and Guild's Approach.- 4.3 Ranking Using Hamming Distance.- 4.3.1 Yager's Approach.- 4.3.2 Kerre's Approach.- 4.3.3 Nakamura's Approach.- 4.3.4 Kolodziejczyk's Approach.- 4.4 Ranking Using ?-Cuts.- 4.4.1 Adamo's Approach.- 4.4.2 Buckley and Chanas' Approach.- 4.4.3 Mabuchi's Approach.- 4.5 Ranking Using Comparison Function.- 4.5.1 Dubois and Prade's Approach.- 4.5.2 Tsukamoto et al.'s Approach.- 4.5.3 Delgado et al.'s Approach.- 4.6 Ranking Using Fuzzy Mean and Spread.- 4.6.1 Lee and Li's Approach.- 4.7 Ranking Using Proportion to The Ideal.- 4.7.1 McCahone's Approach.- 4.8 Ranking Using Left and Right Scores.- 4.8.1 Jain's Approach.- 4.8.2 Chen's Approach.- 4.8.3 Chen and Hwang's Approach.- 4.9 Ranking with Centroid Index.- 4.9.1 Yager's Centroid Index.- 4.9.2 Murakami et al.'s Approach.- 4.10 Ranking Using Area Measurement.- 4.10.1 Yager's Approach.- 4.11 Linguistic Ranking Methods.- 4.11.1 Efstathiou and Tong's Approach.- 4.11.2 Tong and Bonissone's Approach.- V. Fuzzy Multiple Attribute Decision Making Methods.- 5.1 Introduction.- 5.2 Fuzzy Simple Additive Weighting Methods.- 5.2.1 Baas and Kwakernaak's Approach.- 5.2.2 Kwakernaak's Approach.- 5.2.3 Dubois and Prade's Approach.- 5.2.4 Cheng and McInnis's Approach.- 5.2.5 Bonissone's Approach.- 5.3 Analytic Hierarchical Process (AHP) Methods.- 5.3.1 Saaty's AHP Approach.- 5.3.2 Laarhoven and Pedrycz's Approach.- 5.3.3 Buckley's Approach.- 5.4 Fuzzy Conjunctive/Disjunctive Method.- 5.4.1 Dubois, Prade, and Testemale's Approach.- 5.5 Heuristic MAUF Approach.- 5.6 Negi's Approach.- 5.7 Fuzzy Outranking Methods.- 5.7.1 Roy's Approach.- 5.7.2 Siskos et al.'s Approach.- 5.7.3 Brans et al.'s Approach.- 5.7.4 Takeda's Approach.- 5.8 Maximin Methods.- 5.8.1 Gellman and Zadeh's Approach.- 5.8.2 Yager's Approach.- 5.9 A New Approach to Fuzzy MADM Problems.- 5.9.1 Converting Linguistic Terms to Fuzzy Numbers.- 5.9.2 Converting Fuzzy Numbers to Crisp Scores.- 5.9.3 The Algorithm.- VI. Concluding Remarks.- 6.1 MADM Problems and Fuzzy Sets.- 6.2 On Existing MADM Solution Methods.- 6.2.1 Classical Methods for MADM Problems.- 6.2.2 Fuzzy Methods for MADM Problems.- 6.2.2.1 Fuzzy Ranking Methods.- 6.2.2.2 Fuzzy MADM Methods.- 6.3 Critiques of the Existing Fuzzy Methods.- 6.3.1 Size of Problem.- 6.3.2 Fuzzy vs. Crisp Data.- 6.4 A New Approach to Fuzzy MADM Problem Solving.- 6.4.1 Semantic Modeling of Linguistic Terms.- 6.4.2 Fuzzy Scoring System.- 6.4.3 The Solution.- 6.4.4 The Advantages of the New Approach.- 6.5 Other Multiple Criteria Decision Making Methods.- 6.5.1 Multiple Objective Decision Making Methods.- 6.5.2 Methods of Group Decision Making under Multiple Criteria.- 6.5.2.1 Social Choice Theory.- 6.5.2.2 Experts Judgement/Group Participation.- 6.5.2.3 Game Theory.- 6.6 On Future Studies.- 6.6.1 Semantics of Linguistic Terms.- 6.6.2 Fuzzy Ranking Methods.- 6.6.3 Fuzzy MADM Methods.- 6.6.4 MADM Expert Decision Support Systems.- VII. Bibliography.

Multiple Objective Decision Making ― Methods and Applications: A State-of-the-Art Survey

Abstract: I. Introduction.- II. Basic Concepts and Foundations.- 1. Definitions.- 1.1 Terms for MCDM Environment.- 1.2 MCDM Solutions.- 2. Models for MADM.- 2.1 Noncompensatory Model.- 2.2 Compensatory Model.- 3. Transformation of Attributes.- 3.1 Quantification of Fuzzy Attributes.- 3.2 Normalization.- 4. Fuzzy Decision Rules.- 4.1 Definition of Fuzzy Set.- 4.2 Some Basic Operations of Fuzzy Sets.- 5. Methods for Assessing Weight.- 5.1 Eigenvector Method.- 5.2 Weighted Least Square Method.- 5.3 Entropy Method.- 5.4 Linmap.- III. Methods for Multiple Attribute Decision Making.- 1. Methods for No Preference Information Given.- 1.1.1 Dominance.- 1.1.2 Maximin.- 1.1.3 Maximax.- 2. Methods for Information on Attribute Given.- 2.1 Methods for Standard Level of Attribute Given.- 2.1.1 Conjunctive Method (Satisficing Method).- 2.1.2 Disjunctive Method.- 2.2 Methods for Ordinal Preference of Attribute Given.- 2.2.1 Lexicographic Method.- 2.2.2 Elimination By Aspects.- 2.2.3 Permutation Method.- 2.3 Methods for Cardinal Preference of Attribute Given.- 2.3.1 Linear Assignment Method.- 2.3.2 Simple Additive Weighting Method.- 2.3.3 Hierarchical Additive Weighting Method.- 2.3.4 ELECTRE Method.- 2.3.5 TOPSIS.- 2.4 Methods for Marginal Rate of Substitution of Attributes Given.- 2.4.1 Hierarchical Tradeoffs.- 3. Methods for Information on Alternative Given.- 3.1 Methods for Pairwise Preference Given.- 3.1.1 LINMAP.- 3.1.2 Interactive Simple Additive Weighting Method.- 3.2 Method for Pairwise Proximity Given.- 3.2.1 Multidimensional Scaling with Ideal Point.- IV. Applications.- 1. Commodity Selection.- 2. Facility Location (Siting) Selection.- 3. Personnel Selection.- 4. Project Selection.- 4.1 Environmental Planning.- 4.2 Land Use Planning.- 4.3 R & D Project.- 4.4 Water Resources Planning.- 4.5 Miscellaneous.- 5. Public Facility Selection.- V. Concluding Remarks.- On MADM Methods Classification.- On Applications of MADM.- On Multiple Objective Decision Making (MODM) Methods.- On Multiattribute Utility Theory (MAUT).- A Choice Rule for MADM Methods.- A Unified Approach to MADM.- On Future Study.- VI. Bibliography.- Books, Monographs, and Conference Proceedings.- Journal Articles, Technical Reports, and Theses.

Methods for Multiple Attribute Decision Making

Abstract: There are some classical decision rules such as dominance, maximin and maximum which are still fit for the MADM environment. They do not require the DM’s preference information, and accordingly yield the objective (vs. subjective) solution. However, the right selection of these methods for the right situation is important. (See Table 1.3 for references).

Multiple attribute decision making : an introduction

Abstract: Introduction Attribute Generation, Data and Weight Noncompensatory Methods Scoring Methods TOPSIS ELECTRE Methods for Qualitative Data Extensions

Evolutionary algorithms for solving multi-objective problems

Abstract: List of Figures. List of Tables. Preface. Foreword. 1. Basic Concepts. 2. Evolutionary Algorithm MOP Approaches. 3. MOEA Test Suites. 4. MOEA Testing and Analysis. 5. MOEA Theory and Issues. 3. MOEA Theoretical Issues. 6. Applications. 7. MOEA Parallelization. 8. Multi-Criteria Decision Making. 9. Special Topics. 10. Epilog. Appendix A: MOEA Classification and Technique Analysis. Appendix B: MOPs in the Literature. Appendix C: Ptrue & PFtrue for Selected Numeric MOPs. Appendix D: Ptrue & PFtrue for Side-Constrained MOPs. Appendix E: MOEA Software Availability. Appendix F: MOEA-Related Information. Index. References.

Survey of multi-objective optimization methods for engineering

Abstract: A survey of current continuous nonlinear multi-objective optimization (MOO) concepts and methods is presented. It consolidates and relates seemingly different terminology and methods. The methods are divided into three major categories: methods with a priori articulation of preferences, methods with a posteriori articulation of preferences, and methods with no articulation of preferences. Genetic algorithms are surveyed as well. Commentary is provided on three fronts, concerning the advantages and pitfalls of individual methods, the different classes of methods, and the field of MOO as a whole. The Characteristics of the most significant methods are summarized. Conclusions are drawn that reflect often-neglected ideas and applicability to engineering problems. It is found that no single approach is superior. Rather, the selection of a specific method depends on the type of information that is provided in the problem, the user’s preferences, the solution requirements, and the availability of software.

Metaheuristics: From Design to Implementation

Abstract: A unified view of metaheuristics This book provides a complete background on metaheuristics and shows readers how to design and implement efficient algorithms to solve complex optimization problems across a diverse range of applications, from networking and bioinformatics to engineering design, routing, and scheduling. It presents the main design questions for all families of metaheuristics and clearly illustrates how to implement the algorithms under a software framework to reuse both the design and code. Throughout the book, the key search components of metaheuristics are considered as a toolbox for: Designing efficient metaheuristics (e.g. local search, tabu search, simulated annealing, evolutionary algorithms, particle swarm optimization, scatter search, ant colonies, bee colonies, artificial immune systems) for optimization problems Designing efficient metaheuristics for multi-objective optimization problems Designing hybrid, parallel, and distributed metaheuristics Implementing metaheuristics on sequential and parallel machines Using many case studies and treating design and implementation independently, this book gives readers the skills necessary to solve large-scale optimization problems quickly and efficiently. It is a valuable reference for practicing engineers and researchers from diverse areas dealing with optimization or machine learning; and graduate students in computer science, operations research, control, engineering, business and management, and applied mathematics.

Best-worst multi-criteria decision-making method

Abstract: In this paper, a new method, called best-worst method (BWM) is proposed to solve multi-criteria decision-making (MCDM) problems. In an MCDM problem, a number of alternatives are evaluated with respect to a number of criteria in order to select the best alternative(s). According to BWM, the best (e.g. most desirable, most important) and the worst (e.g. least desirable, least important) criteria are identified first by the decision-maker. Pairwise comparisons are then conducted between each of these two criteria (best and worst) and the other criteria. A maximin problem is then formulated and solved to determine the weights of different criteria. The weights of the alternatives with respect to different criteria are obtained using the same process. The final scores of the alternatives are derived by aggregating the weights from different sets of criteria and alternatives, based on which the best alternative is selected. A consistency ratio is proposed for the BWM to check the reliability of the comparisons. To illustrate the proposed method and evaluate its performance, we used some numerical examples and a real-word decision-making problem (mobile phone selection). For the purpose of comparison, we chose AHP (analytic hierarchy process), which is also a pairwise comparison-based method. Statistical results show that BWM performs significantly better than AHP with respect to the consistency ratio, and the other evaluation criteria: minimum violation, total deviation, and conformity. The salient features of the proposed method, compared to the existing MCDM methods, are: (1) it requires less comparison data; (2) it leads to more consistent comparisons, which means that it produces more reliable results.