IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v255y2015icp105-113.html
   My bibliography  Save this article

On multi-objective optimization aided drawing of special graphs

Author

Listed:
  • Žilinskas, A.
  • Varoneckas, A.

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.

Suggested Citation

  • Žilinskas, A. & Varoneckas, A., 2015. "On multi-objective optimization aided drawing of special graphs," Applied Mathematics and Computation, Elsevier, vol. 255(C), pages 105-113.
    • Handle: RePEc:eee:apmaco:v:255:y:2015:i:c:p:105-113
    DOI: 10.1016/j.amc.2014.08.010
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300314011047
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2014.08.010?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:apmaco:v:255:y:2015:i:c:p:105-113. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.