On multi-objective optimization aided drawing of special graphs

A. Žilinskas and A. Varoneckas

Applied Mathematics and Computation, 2015, vol. 255, issue C, 105-113

Abstract: A special graph drawing problem related to the visualization of business process diagrams is considered. It is requested to find aesthetically looking paths between the given pairs of vertices of a grid, where the vertices represent the business process flow objects, and the paths represent the sequence flow. The sites of flow objects on the grid are fixed, and the sequence flow is defined. We state the problem of search for aesthetically looking paths as a problem of combinatorial multi-objective optimization, where the objectives correspond to the generally recognized criteria of aesthetics. To find a solution precisely, the algorithm of linear binary programming CPLEX was applied. For a faster solution, supposed for an interactive mode, a heuristic algorithm is developed. The experimental comparison of the mentioned algorithms is performed to substantiate the applicability of the latter.

Keywords: Multi-objective optimization; Linear programming; Heuristics; Aesthetic graph drawing; Business process diagrams (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300314011047
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:255:y:2015:i:c:p:105-113

DOI: 10.1016/j.amc.2014.08.010

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().