Using Multi-objective Optimization for Automated Graph Drawing
نویسندگان
چکیده
A Genetic Algorithm (GA) is the process of constructing an optimization problem in which several objectives can be optimized at the same time. In this paper, Strength Pareto Evolutionary Algorithm (SPEA), a GA based multi-objective optimization technique, has been applied to a graph drawing (GD) problem. In this paper a measure (force equalization) which contributes to production of nicely drawing is introduced by a GA. We show that using the introduced objective and keeping the Pareto optimal solutions of the GD process in a pool, the following advantage can be achieved: A single run of the GA process leads to several suboptimal solutions which provide the user with a selection right; to choose the most effective drawing.
منابع مشابه
MULTI-OBJECTIVE OPTIMIZATION OF TIME-COST-SAFETY USING GENETIC ALGORITHM
Safety risk management has a considerable effect on disproportionate injury rate of construction industry, project cost and both labor and public morale. On the other hand time-cost optimization (TCO) may earn a big profit for project stakeholders. This paper has addressed these issues to present a multi-objective optimization model to simultaneously optimize total time, total cost and overall ...
متن کاملEnergy Absorption Analysis and Multi-objective Optimization of Tri-layer Cups Subjected to Quasi-static Axial Compressive Loading
In this paper, the energy absorption features of tri-layer explosive-welded deep-drawn cups subjected to quasi-static axial compressive loading are investigated numerically and experimentally. To produce the cups, tri-layer blanks composed of aluminum and stainless steel alloys were fabricated by an explosive-welding process and formed by a deep drawing setup. The quasi-static tests were carrie...
متن کاملMultiobjective Genetic Algorithm for a Graph Drawing Problem
In this paper we introduce an application of multiobjective optimization with genetic algorithms to the problem of graph drawing and explore the potential contribution of the genetic algorithm to solve this particular problem. Given a weighted graph, we want to find a geometric position of every vertex (layout) consistent with the weights in the graph. Among the possible solutions to this probl...
متن کاملMulti-objective optimization of discrete time–cost tradeoff problem in project networks using non-dominated sorting genetic algorithm
The time–cost tradeoff problem is one of the most important and applicable problems in project scheduling area. There are many factors that force the mangers to crash the time. This factor could be early utilization, early commissioning and operation, improving the project cash flow, avoiding unfavorable weather conditions, compensating the delays, and so on. Since there is a need to allocate e...
متن کاملA Tabu Search Based Approach for Graph Layout
This paper describes an automated tabu search based method for drawing general simple graph layouts with straight lines. To our knowledge, this is the first time tabu methods have been applied to graph drawing. We formulated the task as a multi-criteria optimization problem with a number of metrics which are used in a weighted fitness function to measure the aesthetic quality of the graph layou...
متن کامل