Critical review of multi-criteria decision aid methods in conceptual design phases: application to the development of a solar collector structure

At each stage of the product development process, the designers are facing an important task which consists of decision making. Two cases are observed: the problem of concept selection in conceptual design phases and, the problem of pre-dimensioning once concept choices are made. Making decisions in conceptual design phases on a sound basis is one of the most difficult challenges in engineering design, especially when innovative concepts are introduced. On the one hand, designers deal with imprecise data about design alternatives. On the other hand, design objectives and requirements are usually not clear in these phases. The greatest opportunities to reduce product life cycle costs usually occur during the first conceptual design phases. The need for reliable multi-criteria decision aid (MCDA) methods is thus greatest at early conceptual design phases. Various MCDA methods are proposed in the literature. The main criticism of these methods is that they usually yield different results for the same problem [22,23,25]. In this work, an analysis of six MCDA methods (weighed sum, weighted product, Kim & Lin, compromise programming, TOPSIS, and ELECTRE I) was conducted. Our analysis was performed via an industrial case of solar collector structure development. The objective is to define the most appropriate MCDA methods in term of three criteria: (i) the consistency of the results, (ii) the ease of understanding and, (iii) the adaptation of the decision type. The results show that TOPSIS is the most consistent MCDA method in our case

Decision support model for the selection of asphalt wearing courses in highly trafficked roads

The suitable choice of the materials forming the wearing course of highly trafficked roads is a delicate task because of their direct interaction with vehicles. Furthermore, modern roads must be planned according to sustainable development goals, which is complex because some of these might be in conflict. Under this premise, this paper develops a multi-criteria decision support model based on the analytic hierarchy process and the technique for order of preference by similarity to ideal solution to facilitate the selection of wearing courses in European countries. Variables were modelled using either fuzzy logic or Monte Carlo methods, depending on their nature. The views of a panel of experts on the problem were collected and processed using the generalized reduced gradient algorithm and a distance-based aggregation approach. The results showed a clear preponderance by stone mastic asphalt over the remaining alternatives in different scenarios evaluated through sensitivity analysis. The research leading to these results was framed in the European FP7 Project DURABROADS (No. 605404).The research leading to these results has received funding from the European Union Seventh Framework Programme (FP7/2007–2013) under Grant Agreement No. 605404

A similarity-based cooperative co-evolutionary algorithm for dynamic interval multi-objective optimization problems

The file attached to this record is the author's final peer reviewed version. The Publisher's final version can be found by following the DOI link.Dynamic interval multi-objective optimization problems (DI-MOPs) are very common in real-world applications. However, there are few evolutionary algorithms that are suitable for tackling DI-MOPs up to date. A framework of dynamic interval multi-objective cooperative co-evolutionary optimization based on the interval similarity is presented in this paper to handle DI-MOPs. In the framework, a strategy for decomposing decision variables is first proposed, through which all the decision variables are divided into two groups according to the interval similarity between each decision variable and interval parameters. Following that, two sub-populations are utilized to cooperatively optimize decision variables in the two groups. Furthermore, two response strategies, rgb0.00,0.00,0.00i.e., a strategy based on the change intensity and a random mutation strategy, are employed to rapidly track the changing Pareto front of the optimization problem. The proposed algorithm is applied to eight benchmark optimization instances rgb0.00,0.00,0.00as well as a multi-period portfolio selection problem and compared with five state-of-the-art evolutionary algorithms. The experimental results reveal that the proposed algorithm is very competitive on most optimization instances