Theory, Software and Testing Examples in Decision Support Systems

This volume summarizes the results of a four-year cooperative contracted study "Theory, Software and Testing Examples for Decision Support Systems" conducted in Poland by four institutions: the Institute of Automatic Control, Warsaw University of Technology, the System Research Institute of the Polish Academy of Sciences, the Institute of Control and Systems Engineering, Academy of Mining and Metallurgy in Cracow, and the Institute of Informatics, University of Warsaw in cooperation with the Methodology of the Decision Analysis Project of the System and Decision Sciences Program at IIASA. This research was supported mostly by IIASA funds in Polish national currency, but also by other sources and research grants in Poland, such as the grant RP.1.02 of the Ministry of Education for research in optimization and automatic control; totally, it represents the results of a part-time work of about 30 researchers from these institutions. This volume concentrates on the theoretical and methodological advances of this cooperative study, although it describes also experiences of applications in the area of programming the development of chemical industry together with a decision support system for such purposes as well as presents short descriptions of eight software packages (prototype decision support systems, multiobjective mathematical programming packages and a pilot negotiation support system) that are available together with more detailed documentation as scientific software constituting a part of results of this study. The research on the Polish side was coordinated by Professor Andrzej P. Wierzbicki and on IIASA's side by Dr. Andrzej Lewandowski, the project leader of the Methodology of Decision Analysis; they served also as the editors of this volume

Theory, Software and Testing Examples for Decision Support Systems

Research in methodology of Decision Support Systems is one of the activities within the System and Decision Sciences Program which was initiated seven years ago and is still in the center of interests of SDS. During these years several methodological approaches and software tools have been developed; among others the DIDAS (Dynamic Interactive Decision Analysis and Support) and SCDAS (Selection Committed Decision Analysis and Support). Both methodologies gained a certain level of popularity and have been successfully applied in other IIASA programs and projects as well as in many scientific institutions. Since development and testing the software and methodologies on real life examples requires certain -- rather high -- resources, it was decided to establish a rather extensive international collaboration with other scientific institutions in various NMO countries. This volume presents the result of the second phase of such a cooperation between the SDS Program and the four scientific institutions in Poland. The research performed during this stage related mostly to converting the decision support software developed during the previous phase, from the mainframe to the microcomputer, ensuring simultaneously high level of rebustness, efficiency and user friendliness. Several new theoretical developments, like new non-simplex algorithm for linear programming, new algorithms for mixed-integer programming and job shop scheduling are also described in the volume. Finally, it presents also new theoretical developments relating to supporting the processes of negotiations as well as the methodological issues on application the Decision Support Systems in industry management

Methodology and Software for Interactive Decision Support

These Proceedings report the scientific results of an International Workshop on "Methodology and Software for Interactive Decision Support" organized jointly by the System and Decision Sciences Program of IIASA and The National Committee for Applied Systems Analysis and Management in Bulgaria. Several other Bulgarian institutions sponsored the workshop -- The Committee for Science to the Council of Ministers, The State Committee for Research and Technology and The Bulgarian Industrial Association. The workshop was held in Albena, on the Black Sea Coast. In the first section, "Theory and Algorithms for Multiple Criteria Optimization," new theoretical developments in multiple criteria optimization are presented. In the second section, "Theory, Methodology and Software for Decision Support Systems," the principles of building decision support systems are presented as well as software tools constituting the building components of such systems. Moreover, several papers are devoted to the general methodology of building such systems or present experimental design of systems supporting certain class of decision problems. The third section addresses issues of "Applications of Decision Support Systems and Computer Implementations of Decision Support Systems." Another part of this section has a special character. Beside theoretical and methodological papers, several practical implementations of software for decision support have been presented during the workshop. These software packages varied from very experimental and illustrative implementations of some theoretical concept to well developed and documented systems being currently commercially distributed and used for solving practical problems

Aspiration Based Decision Support Systems

This book focuses the methodology of decision analysis and support related to the principle of reference point optimization (developed by the editors of this volume and called also variously: aspiration-led decision support, quasi-satisfying framework of rationality, DIDAS methodology etc.). The selection principle applied for this volume was to concentrate on advances of theory and methodology, related to the focusing theme, to supplement them by experiences and methodological advances gained through wide applications and tests in one particular application area - the programming of development of industrial structures in chemical industry, and finally to give a very short description of various software products developed in the contracted study agreement

Particle Swarm Optimization

Particle swarm optimization (PSO) is a population based stochastic optimization technique influenced by the social behavior of bird flocking or fish schooling.PSO shares many similarities with evolutionary computation techniques such as Genetic Algorithms (GA). The system is initialized with a population of random solutions and searches for optima by updating generations. However, unlike GA, PSO has no evolution operators such as crossover and mutation. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. This book represents the contributions of the top researchers in this field and will serve as a valuable tool for professionals in this interdisciplinary field

Domination and Decomposition in Multiobjective Programming

During the last few decades, multiobjective programming has received much attention for both its numerous theoretical advances as well as its continued success in modeling and solving real-life decision problems in business and engineering. In extension of the traditionally adopted concept of Pareto optimality, this research investigates the more general notion of domination and establishes various theoretical results that lead to new optimization methods and support decision making. After a preparatory discussion of some preliminaries and a review of the relevant literature, several new findings are presented that characterize the nondominated set of a general vector optimization problem for which the underlying domination structure is defined in terms of different cones. Using concepts from linear algebra and convex analysis, a well known result relating nondominated points for polyhedral cones with Pareto solutions is generalized to nonpolyhedral cones that are induced by positively homogeneous functions, and to translated polyhedral cones that are used to describe a notion of approximate nondominance. Pareto-oriented scalarization methods are modified and several new solution approaches are proposed for these two classes of cones. In addition, necessary and sufficient conditions for nondominance with respect to a variable domination cone are developed, and some more specific results for the case of Bishop-Phelps cones are derived. Based on the above findings, a decomposition framework is proposed for the solution of multi-scenario and large-scale multiobjective programs and analyzed in terms of the efficiency relationships between the original and the decomposed subproblems. Using the concept of approximate nondominance, an interactive decision making procedure is formulated to coordinate tradeoffs between these subproblems and applied to selected problems from portfolio optimization and engineering design. Some introductory remarks and concluding comments together with ideas and research directions for possible future work complete this dissertation

Solving the waste collection problem from a multiobjective perspective: New methodologies and case studies

Fecha de lectura Tesis Doctoral: 19 de marzo de 2018.Economía Aplicada ( Matemáticas) Resumen tesis: El tratamiento de residuos es un tema de estudio por parte de las administraciones locales a nivel mundial. Distintos factores han de tenerse en cuenta para realizar un servicio eficiente. En este trabajo se desarrolla una herramienta para analizar y resolver el problema de la recogida de residuos sólidos en Málaga. Tras un análisis exhaustivo de los datos, se aborda el problema real como un problema de rutas multiobjetivo con capacidad limitada. Para los problemas multiobjetivo, no suele existir una única solución óptima, sino un conjunto de soluciones eficientes de Pareto. Las características del problema hacen inviable su resolución de forma exacta, por lo que se aplican distintas estrategias metaheurísticas para obtener una buena aproximación. En particular, se combinan las técnicas de GRASP, Path Relinking y Variable Neighborhood Search, que son adaptadas a la perspectiva multicriterio. Se trata de una aproximación en dos fases: una primera aproximación de la frontera eficiente se genera mediante un GRASP multiobjetivo. Tres son los métodos propuestos para la primera aproximación, dos de ellos derivados de la publicación de Martí et al. (2015) y el último se apoya en la función escalarizada de logro de Wierzbicki (Wierzbicki, 1980) para distintas combinaciones de pesos. A continuación, esta aproximación es mejorada con una versión de Path Relinking o Variable Neighborhood Search, con un punto de referencia diseñado para problemas multiobjetivo. Una vez generada la aproximación de la frontera eficiente, el proceso de obtención de la solución que más se adecúa a las preferencias de los gestores se basa en el desarrollo de un método interactivo sin trade – off, derivado de la filosofía NAUTILUS (Miettinen et al. 2010). Para evitar gastos de cómputo extensos, esta metodología se apoya en una pre - computación de los elementos de la frontera eficiente