- 期刊
- OpenAccess
Oriented Networks Design Problem
並列摘要
The design of interconnection networks is very popular in computer science. In this paper we introduce a novel problem, the design of oriented networks. The underlying structure of such networks is a directed graph with weights on the arcs, which are the number of paths of the routing that traverse the arc. The cost of a network with a routing is defined as a sum of arc costs that are computed with concave increasing cost function depending on weights over directed arcs. The objective is to find the routing that is optimal in terms of costs. The corresponding minimization problem is approached with a local search type heuristics. New local search neighborhood is defined and analyzed.
延伸閱讀
- Li, J., & Zhu, J. (2013). The Capacity Expansion Path Problem in Networks. Journal of Applied Mathematics, 2013(), 614-617-057. https://doi.org/10.1155/2013/156901
- WANG, C. Y., LIAO, H. Y. M., & YEH, I. H. (2023). Designing Network Design Strategies Through Gradient Path Analysis. Journal of Information Science and Engineering, 39(4), 975-995. https://doi.org/10.6688/JISE.202307_39(4).0016
- 黎育瑞（2008）。THEORY OF OPTICAL NETWORK MONITORING AND SYSTEM DESIGN〔碩士論文，大同大學〕。華藝線上圖書館。https://www.airitilibrary.com/Article/Detail?DocID=U0081-0607200917243647
- 陳彥良（2013）。A Study on Service-Oriented Network Management〔碩士論文，國立暨南國際大學〕。華藝線上圖書館。https://doi.org/10.6837/NCNU.2013.00048
- Wang, Z., Liang, J., & Liu, Y. (2012). Mathematical Problems for Complex Networks. Mathematical Problems in Engineering, 2012(), 1192-1196. https://doi.org/10.1155/2012/934680