Abstract
For solving the problem of multicast routing, ant colony algorithm (ACO) has insufficient optimization ability. The paper proposes a routing algorithm which combines quantum computing and max min ACO. The algorithm uses quantum bit probability amplitude to encode the link, and dynamically adjusts quantum revolving gate to update the quantum coding on the link, so as to meet the cost optimization under constraint conditions, combined with the maximum and minimum pheromone decision mechanism to find the optimal link path, effectively control the evolution speed and direction, and enhance the convergence performance of the algorithm. The simulation results show that the algorithm can effectively control the evolution speed and direction, and is better than ant colony algorithm in the optimization ability and convergence performance.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
