Bounding Fronts in Multi-Objective Combinatorial Optimization with Application to Aesthetic Drawing of Business Process Diagrams
The main concept of branch and bound is to detect subsets of feasible solutions which cannot contain optimal solutions. In multi-objective optimization a bounding front is used—a set of bounding vectors in the objective space dominating all possible objective vectors corresponding to the subset of feasible solutions. The subset cannot contain Pareto optimal (efficient) solutions if each bounding vector in the bounding front corresponding to this subset is dominated by at least one already known decision vector. The simplest bounding front corresponds to a single ideal vector composed of lower bounds for each objective function. However, the bounding fronts with multiple bounding vectors may be tighter and therefore their use may discard more subsets of feasible solutions. In this chapter we investigate the use of bounding vectors and bounding fronts in multi-objective optimization aided to aesthetic drawing of special graphs—business process diagrams. An experimental investigation shows that the use of the bounding front considerably reduces the number of function evaluations and computational time.
The support by Agency for Science, Innovation and Technology (MITA) trough the grant Nr.31V-145 is acknowledged.
- 2.Bennett, C., Ryall, J., Spalteholz, L., Gooch, A.: The aesthetics of graph visualization. In: Cunningham, D.W., Meyer, G., Neumann, L. (eds.) Computational Aesthetics in Graphics, Visualization, and Imaging, pp. 1–8. Elsevier/Morgan Kaufmann, San Francisco (2007)Google Scholar
- 5.Owen, M., Jog, R.: BPMN and business process management. http://www.bpmn.org (2003)
- 8.Purchase, H., McGill, M., Colpoys, L., Carrington, D.: Graph drawing aesthetics and the comprehension of UML class diagrams: an empirical study. In: Proceedings of the 2001 Asia-Pacific Symposium on Information Visualisation, vol. 9, pp. 129–137 (2001)Google Scholar
- 12.Žilinskas, J., Goldengorin, B., Pardalos, P.M.: Pareto-optimal front of cell formation problem in group technology. J. Global Optim. (2014, in press). Doi: 10.1007/s10898-014-0154-6Google Scholar