Minimum cable problem and optimal cost realization in the communication network

Zimo Wang

doi:10.1117/12.2631812

14 April 2022 Minimum cable problem and optimal cost realization in the communication network

Zimo Wang

Proceedings Volume 12178, International Conference on Signal Processing and Communication Technology (SPCT 2021); 121781H (2022) https://doi.org/10.1117/12.2631812
Event: International Conference on Signal Processing and Communication Technology (SPCT 2021), 2021, Tianjin, China

Abstract

This paper discusses the shortest length of the total cable between nodes in an indoor communication network for the design of an indoor distribution system.Using the distribution particle group algorithm, with the shortest between the node cable length as the goal, realize the system optimization design, the cable connection path between the node abstract for multi-branch no return traveler problem, based on the particle group intelligent optimization algorithm, optimize the layout of the indoor communication network nodes, so as to achieve the lightweight design and the optimal cost of the whole communication system.

Citation Download Citation

Zimo Wang "Minimum cable problem and optimal cost realization in the communication network", Proc. SPIE 12178, International Conference on Signal Processing and Communication Technology (SPCT 2021), 121781H (14 April 2022); https://doi.org/10.1117/12.2631812

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available