b a c k g r o u n d & aim: in many studies, the survival of patients with chronic kidney disease who are treated with peritoneal dialysis technique has been considered, while this is possible in peritoneal dialysis  patients  to switch  to another  treatment.  to achieve  more  accurate  estimation  of patient survival is necessary to examine all events. the purpose of this study is to estimate...

A nadir point is constructed by the worst objective values of the solutions of the entire Pareto-optimal set. Along with the ideal point, the nadir point provides the range of objective values within which all Pareto-optimal solutions must lie. Thus, a nadir point is an important point to researchers and practitioners interested in multi-objective optimization. Besides, if the nadir point can b...

A statistical analysis of functional data, obtained as reflectance values measured using a hyperspectral sensor, was used to determine water content in vine leaves. Our study was conducted using a sample of 80 vine leaves whose water content was determined by calculating the weight difference between leaves before and after drying in an oven. Two regression models, one linear and the other non-...

The interactive algorithms are often used [2] to solve multicriteria linear integer programming problems (MCIP). These algorithms [3, 6, 7, 11, 13] are modifications of interactive approaches solving multicriteria linear problems that include the integrality constraints. Linear integer programming problems are used as scalarizing problems in these interactive algorithms. These problems are NP-d...

The dynamic window approach is a well known navigation scheme developed by Fox et. al. [1] and extended by Brock and Khatib [2]. It is safe by construction and has been shown to perform very efficiently in experimental setups. However, one can construct examples where the proposed scheme fails to attain the goal configuration. What has been lacking is a theoretical treatment of the algorithm’s ...

We propose a learning-oriented interactive algorithm for solving multicriteria linear integer programming (MCLIP) problems, considered as multicriteria decision making problems. At each iteration, the DM may partition the criteria set into at most seven classes, namely: improvement, improvement by a desired amount, deterioration, deterioration by at most a certain amount, nondeterioration, chan...

This paper describes a new Preference-based Interactive Evolutionary (PIE) algorithm for multi-objective optimization which exploits the advantages of both evolutionary algorithms andmultiple criteria decision making approaches. Our algorithm uses achievement scalarizing functions and the potential of population based evolutionary algorithms to help the decision maker to direct the search towar...

Multiple criteria decision making (MCDM) literature concentrates on the concept of conflicting objectives, which is related to focusing on the need of trading off. Most approaches to eliciting preferences of the decision maker (DM) are built accordingly on contradistinguishing different attainable levels of objectives. We propose to pay attention to the non-conflicting aspects of decision makin...

We consider multiple criteria decision-making problems where a group of decision-makers wants to find the most preferred solution from a discrete set of alternatives. We develop a method that uses achievement scalarizing functions for charting subsets of reference points that would support a certain alternative to be the most preferred one. The resulting descriptive information is provided to t...