Abstract
In this paper, we introduce a hybrid optimization algorithm with the Branch-and-Bound Method and the Ant Colony Optimization to solve the multi-chromosomal reversal median problem. We convert the large-scale genome into TSP maps at first. Then we use a hybrid optimization algorithm with the Branch-and-Bound Method and the Ant Colony Optimization to solve the problem. In our improved algorithm, we increase the search speed by implement multi-branch parallel search of ACO. Our extensive experiments on simulated datasets show that this median solver is efficient.
Sign-in/Register to access full text options 
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.
