Please use this identifier to cite or link to this item:
Type of publication: Straipsnis konferencijos medžiagoje Clarivate Analytics Web of Science ar/ir Scopus / Article in Clarivate Analytics Web of Science or Scopus DB conference proceedings (P1a)
Field of Science: Informatika / Informatics (N009)
Author(s): Jančauskas, Vytautas;Mackutė-Varoneckienė, Aušra;Varoneckas, Audrius;Žilinskas, Antanas
Title: On the multi-objective optimization aided drawing of connectors for graphs related to business process management
Is part of: ICIST 2012 - Information and software technologies : 18th international conference, Kaunas, Lithuania, September 13-14, 2012 : proceedings / edited by Tomas Skersys, Rimantas Butleris, Rita Butkienė. Berlin : Springer, 2012
Extent: p. 87-100
Date: 2012
Series/Report no.: (Communications in Computer and Information Science. Vol. 319 1865-0929)
Keywords: Grafų vizualizacija;Daugiakriterinė optimizacija;Psichologinis eksperimentas;Verslo procesų diagramos;Visualization of graphs;Multi-objective optimization;Psychological experiment;Business process diagrams
ISBN: 9783642333071
Abstract: A problem of drawing aesthetically looking graphs is considered. We focus on graphs related to management of business processes. Vertices of a graph are visualized as rectangles (flow objects), and edges are visualized as rectangular connectors (sequence flow). A particular problem of aesthetic drawing is considered where location of vertices is fixed, and the lines representing the edges should be drawn. The latter problem is restated as a graphs oriented multi-objective combinatorial optimization problem. The generally recognized criteria of aesthetic presentation, such as the general length of lines, the number of crossings, and the number of bends, are considered as the objectives to be minimized. The attitude of the potential users of the supposed algorithms towards the relative importance of the considered criteria is elicited by a psychological experiment. The elicited information is used in the development of domain-specific multi-objective optimization algorithms. We propose for that problem a version of the metaheuristics of ant colony optimization. The efficiency is evaluated experimentally using randomized test problems of different complexity
Affiliation(s): Informatikos fakultetas
Taikomosios informatikos katedra
Vilniaus universitetas
Vytauto Didžiojo universitetas
Appears in Collections:Universiteto mokslo publikacijos / University Research Publications

Files in This Item:
marc.xml10.68 kBXMLView/Open

MARC21 XML metadata

Show full item record
Export via OAI-PMH Interface in XML Formats
Export to Other Non-XML Formats

Citations 5

checked on Sep 12, 2020

Page view(s)

checked on Mar 30, 2020


checked on Mar 30, 2020

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.