Algorithms for Reorganizing Branches within Enterprise Network

Milan Dordevic, Hiba Tabbara

Abstract

The problem of reorganizing branches in an enterprise network is based on a weighted graph problem formulation. The suboptimal solution to this problem is obtained by applying a two-phase algorithm. The first is to decompose the graph into different sections in such a way that those sections are equally balanced. The second phase is to find a service centre for each section. In this paper, we propose an improvement of a hybrid genetic algorithm for decomposing the graph into different sections. We also propose new algorithms for finding centres of sections and we compare them on an illustrated examples.

Download


Paper Citation


in Harvard Style

Dordevic M. and Tabbara H. (2019). Algorithms for Reorganizing Branches within Enterprise Network.In Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-758-352-0, pages 37-44. DOI: 10.5220/0007254700370044


in Bibtex Style

@conference{icores19,
author={Milan Dordevic and Hiba Tabbara},
title={Algorithms for Reorganizing Branches within Enterprise Network},
booktitle={Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2019},
pages={37-44},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007254700370044},
isbn={978-989-758-352-0},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 8th International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - Algorithms for Reorganizing Branches within Enterprise Network
SN - 978-989-758-352-0
AU - Dordevic M.
AU - Tabbara H.
PY - 2019
SP - 37
EP - 44
DO - 10.5220/0007254700370044