1,720,960 research outputs found
Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
No full textIn this paper we present new concepts of efficiency for uncertain multi-objective optimization problems. We analyze the connection between the concept of minmax robust efficiency presented by Ehrgott et al. (Eur J Oper Res, 2014, doi:10.1016/j.ejor.2014.03.013) and the upper set less order relation <=(u)(s) introduced by Kuroiwa (1998, 1999). From this connection we derive new concepts of efficiency for uncertain multi-objective optimization problems by replacing the set ordering with other set orderings. Those are namely the lower set less ordering (see Kuroiwa 1998, 1999), the set less ordering (see Nishnianidze in Soobshch Akad Nauk Gruzin SSR 114(3):489-491, 1984; Young in Math Ann 104(1):260-290, 1931, doi:10.1007/BF01457934; Eichfelder and Jahn in Vector Optimization. Springer, Berlin, 2012), the certainly less ordering (see Eichfelder and Jahn in Vector Optimization. Springer, Berlin, 2012), and the alternative set less ordering (see Ide et al. in Fixed Point Theory Appl, 2014, doi:10.1186/1687-1812-2014-83; Kobis 2014). We analyze the resulting concepts of efficiency and present numerical results on the occurrence of the various concepts. We conclude the paper with a short comparison between the concepts, and an outlook to further work
Minmax robustness for multi-objective optimization problems
No full textIn real-world applications of optimization, optimal solutions are often of limited value, because disturbances of or changes to input data may diminish the quality of an optimal solution or even render it infeasible. One way to deal with uncertain input data is robust optimization, the aim of which is to find solutions which remain feasible and of good quality for all possible scenarios, i.e., realizations of the uncertain data. For single objective optimization, several definitions of robustness have been thoroughly analyzed and robust optimization methods have been developed. In this paper, we extend the concept of minmax robustness (Ben-Tal, Ghaoui, & Nemirovski, 2009) to multi-objective optimization and call this extension robust efficiency for uncertain multi-objective optimization problems. We use ingredients from robust (single objective) and (deterministic) multi-objective optimization to gain insight into the new area of robust multi-objective optimization. We analyze the new concept and discuss how robust solutions of multi-objective optimization problems may be computed. To this end, we use techniques from both robust (single objective) and (deterministic) multi-objective optimization. The new concepts are illustrated with some linear and quadratic programming instances
An application of deterministic and robust optimization in the wood cutting industry
No full textIn the veneer cutting industry tree trunks are peeled into thin veneer strips which are cut, glued together, and pressed into bentwood pieces for seats, backrests, etc. In this work, a model for optimizing the inherent cutting problem with respect to resource efficiency is presented. Especially the heterogeneous quality of the wood renders existing models for classic cutting stock problems useless and calls for a new modeling approach. By means of the model presented in this paper, the problem is solved to optimality for real-world instances in reasonable time and applicable solutions are generated. Furthermore, in order to deal with uncertainties in the wood quality, the approach of robust optimization is applied to the problem. Robust optimization is an important tool to deal with uncertainties in the formulation of mathematical optimization models. Different concepts of robustness have been provided in the literature, one of which is the concept of minmax robust efficiency for uncertain multi-objective optimization problems. The concept of minmax robust efficiency is applied to a simplified version of the problem, robust efficient solutions are calculated, and the paper concludes with the discussion of the benefit of these solutions
The robust knapsack problem with queries
No full textWe consider robust knapsack problems where item weights are uncertain. We are allowed to query an item to find its exact weight,where the number of such queries is bounded by a given parameter Q. After these queries are made, we need to pack the items robustly, i.e., so that the choice of items is feasible for every remaining possible scenario of item weights. The central question that we consider is: Which items should be queried in order to gain maximum profit? We introduce the notion of query competitiveness for strict robustness to evaluate the quality of an algorithm for this problem, and obtain lower and upper bounds on this competitiveness for interval-based uncertainty. Similar to the study of online algorithms, we study the competitiveness under different frameworks, namely we analyze the worst-case query competitiveness for deterministic algorithms, the expected query competitiveness for randomized algorithms and the average case competitiveness for known distributions of the uncertain input data. We derive theoretical bounds for these different frameworks and evaluate them experimentally. We also extend this approach to Γ-restricted uncertainties introduced by Bertsimas and Sim. Furthermore, we present heuristic algorithms for the problem. In computational experiments considering both the interval-based and the Γ-restricted uncertainty, we evaluate their empirical performance. While the usage of a Γ-restricted uncertainty improves the nominal performance of a solution (as expected), we find that the query competitiveness gets worse
The relationship between multi-objective robustness concepts and set-valued optimization
Full text linkIn this paper, we discuss the connection between concepts of robustness for multi-objective optimization problems and set order relations. We extend some of the existing concepts to general spaces and cones using set relations. Furthermore, we derive new concepts of robustness for multi-objective optimization problems. We point out that robust multi-objective optimization can be interpreted as an application of set-valued optimization. Furthermore, we develop new algorithms for solving uncertain multi-objective optimization problems. These algorithms can be used in order to solve a special class of set-valued optimization problems.DFG 'Resource Efficiency in Interorganizational Networks' [RTG 1703
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Full text linkWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
- …
