Constrained multi-objective optimization problems are common in practical engineering and more difficult to handle than unconstrained problems. In general, it is necessary find a balance between the convergence diversity of solutions as well feasibility. For constrained multi/many-objective problem, particle swarm algorithm based on two-level strategy proposed. contrast existing views, first le...

In this paper, a multi-objective method is used to optimize a heat recovery steam generator (HRSG). Two objective functions have been used in the optimization, which are irreversibility and HRSG equivalent volume. The former expresses the exergetic efficiency and the latter demonstrates the cost of the HRSG. Decision variables are geometric and operational parameters of the HRSG. The result...

In this paper, a multi-objective method is used to optimize a heat recovery steam generator (HRSG). Two objective functions have been used in the optimization, which are irreversibility and HRSG equivalent volume. The former expresses the exergetic efficiency and the latter demonstrates the cost of the HRSG. Decision variables are geometric and operational parameters of the HRSG. The results of...

Dynamic Multi-Objective Optimization Problems (DMOPs) and Many-Objective (MaOPs) are two classes of the optimization field that have potential applications in engineering. Modified Evolutionary Algorithms hybrid approaches seem to be suitable effectively deal with such problems. However, standard Crow Search Algorithm has not been considered for either DMOPs or MaOPs date. This paper proposes a...

in this paper, multi-objective uniform-diversity genetic algorithm (muga) with a diversity preserving mechanism called the ε-elimination algorithm is used for pareto optimization of 5-degree of freedom vehicle vibration model considering the five conflicting functions simultaneously. the important conflicting objective functions that have been considered in this work are, namely, vertical accel...

Vertex orderings have been successfully applied to problems in netlist clustering and for system partitioning and layout [2] , [20]. We present a vertex ordering construction that encompasses most reasonable graph traversals. Two parameters-an attraction function and a window-provide the means for achieving various graph traversals and addressing particular clustering requirements. We then use ...

The aim of this paper is to develop an interactive two-phase method that can help the Project Manager (PM) with solving the fuzzy multi-objective decision problems. Therefore, in this paper, we first revisit the related papers and focus on how to develop an interactive two-phase method. Next, we establish to consider the imprecise nature of the data by fulfilling the possibilistic programming m...

This paper presents new, carefully designed algorithms for five biobjective permutation flow shop scheduling problems that arise from the pairwise combinations of the objectives (i) makespan, (ii) the sum of the completion times of the jobs, and (iii) both, the weighted and nonweighted total tardiness of all jobs. The proposed algorithm combines two search methods, two-phase local search and Pa...