Abstract
The paper considers a co-evolutionary algorithm for solving the placement problem based on the ant colony algorithm. A modified structure of the ant algorithm is proposed. An evolving population is divided into subpopulations that evolve in parallel. The strategies implemented by subpopulations differ in constructive algorithms that are part of the ant algorithm. The heuristic of the ant colony constructive algorithm is based on the concept of sequential assignment of elements to previously placed positions of the commutation field. The developed algorithm was tested on benchmarks 19s, PrimGA1, PrimGA2. The results compared to existing algorithms are improved by 6—7 %. The total time complexity of the co-evolutionary allocation algorithm is O(n2)—O(n3).
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.
