Optimization of cable cycles: a trade-off between reliability and cost
2015 (English)In: American Journal of Intelligent Systems, ISSN 2165-8978, E-ISSN 2165-8994, Vol. 5, no 2, 43-57 p.Article in journal (Refereed) Published
This paper elaborates the routing of cable cycle through available routes in a building in order to link a set of devices, in a most reasonable way. Despite of the similarities to other NP-hard routing problems, the only goal is not only to minimize the cost (length of the cycle) but also to increase the reliability of the path (in case of a cable cut) which is assessed by a risk factor. Since there is often a trade-off between the risk and length factors, a criterion for ranking candidates and deciding the most reasonable solution is defined. A set of techniques is proposed to perform an efficient and exact search among candidates. A novel graph is introduced to reduce the search-space, and navigate the search toward feasible and desirable solutions. Moreover, admissible heuristic length estimation helps to early detection of partial cycles which lead to unreasonable solutions. The results show that the method provides solutions which are both technically and financially reasonable. Furthermore, it is proved that the proposed techniques are very efficient in reducing the computational time of the search to a reasonable amount.
Place, publisher, year, edition, pages
2015. Vol. 5, no 2, 43-57 p.
Combinatorial Optimization, Cable Cycle Routing Problem, Reliability of Path, Conditional Directed Graph, Admissible Heuristic Estimation
Research subject Complex Systems – Microdata Analysis
IdentifiersURN: urn:nbn:se:du-17951OAI: oai:DiVA.org:du-17951DiVA: diva2:821447