Multi-objective combinatorial optimization (MOCO) problems, apart from being notoriously difficult and complex to solve in reasonable computational time, they also exhibit high levels of instability in their results in case of uncertainty, which often deviate far from optimality. In this work we...

In most multi-objective optimization problems we aim at selecting the most preferred among the generated Pareto optimal solutions (a subjective selection among objectively determined solutions). In this paper we consider the robustness of the selected Pareto optimal solution in relation to...

Motivated by a proposal of the local authority for improving the existing healthcare system in the Parana State in Brazil, this article presents an optimization-based model for developing a better system for patients by aggregating various health services offered in the municipalities of Parana...

The paper by Wang and Triantaphyllou [Ranking irregularities when evaluating alternatives by using some ELECTRE methods. Omega, 2008; 36(1): 45-63] (W & T) pinpoints in an interesting way some limitations of ELECTRE II and III methods. The objective of this note is to draw the attention of the...

This paper presents an extension of the comprehensive (overall) concordance index of ELECTRE methods, which takes the interaction between criteria into account. In real-world decision-aiding situations, it is reasonable to consider only the interaction between a small number of criterion pairs....

This paper presents a new algorithm for identifying all supported non-dominated vectors (or outcomes) in the objective space, as well as the corresponding efficient solutions in the decision space, for multi-objective integer network flow problems. Identifying the set of supported non-dominated...

PROMETHEE methods are widely used in Multiple Criteria Decision Aiding (MCDA) to deal with real world decision making problems. In this paper, we propose to apply the Stochastic Multicriteria Acceptability Analysis (SMAA) to the family of PROMETHEE methods in order to explore the whole set of...

In this paper, we deal with the bi-objective non-convex combined heat and power (CHP) planning problem. A medium and long term planning problem decomposes into thousands of single period (hourly) subproblems and dynamic constraints can usually be ignored in this context. The hourly subproblem...

This paper presents a backward state reduction dynamic programming algorithm for generating the exact Pareto frontier for the bi-objective integer knapsack problem. The algorithm is developed addressing a reduced problem built after applying variable fixing techniques based on the core concept....