Abstract: Graph partitioning is a NP-hard problem with multiple
conflicting objectives. The graph partitioning should minimize the
inter-partition relationship while maximizing the intra-partition
relationship. Furthermore, the partition load should be evenly
distributed over the respective partitions. Therefore this is a multiobjective
optimization problem (MOO). One of the approaches to
MOO is Pareto optimization which has been used in this paper. The
proposed methods of this paper used to improve the performance are
injecting best solutions of previous runs into the first generation of
next runs and also storing the non-dominated set of previous
generations to combine with later generation's non-dominated set.
These improvements prevent the GA from getting stuck in the local
optima and increase the probability of finding more optimal
solutions. Finally, a simulation research is carried out to investigate
the effectiveness of the proposed algorithm. The simulation results
confirm the effectiveness of the proposed method.
Abstract: In this paper multi-objective genetic algorithms are
employed for Pareto approach optimization of ideal Turboshaft
engines. In the multi-objective optimization a number of conflicting
objective functions are to be optimized simultaneously. The
important objective functions that have been considered for
optimization are specific thrust (F/m& 0), specific fuel consumption
( P S ), output shaft power 0 (& /&) shaft W m and overall efficiency( ) O
η .
These objectives are usually conflicting with each other. The design
variables consist of thermodynamic parameters (compressor pressure
ratio, turbine temperature ratio and Mach number).
At the first stage single objective optimization has been
investigated and the method of NSGA-II has been used for multiobjective
optimization. Optimization procedures are performed for
two and four objective functions and the results are compared for
ideal Turboshaft engine. In order to investigate the optimal
thermodynamic behavior of two objectives, different set, each
including two objectives of output parameters, are considered
individually. For each set Pareto front are depicted. The sets of
selected decision variables based on this Pareto front, will cause the
best possible combination of corresponding objective functions.
There is no superiority for the points on the Pareto front figure,
but they are superior to any other point. In the case of four objective
optimization the results are given in tables.
Abstract: The necessity of solving multi dimensional
complicated scientific problems beside the necessity of several
objective functions optimization are the most motive reason of born
of artificial intelligence and heuristic methods.
In this paper, we introduce a new method for multiobjective
optimization based on learning automata. In the proposed method,
search space divides into separate hyper-cubes and each cube is
considered as an action. After gathering of all objective functions
with separate weights, the cumulative function is considered as the
fitness function. By the application of all the cubes to the cumulative
function, we calculate the amount of amplification of each action and
the algorithm continues its way to find the best solutions. In this
Method, a lateral memory is used to gather the significant points of
each iteration of the algorithm. Finally, by considering the
domination factor, pareto front is estimated. Results of several
experiments show the effectiveness of this method in comparison
with genetic algorithm based method.