Abstract
Many real-world problems in logistics, transport, and manufacturing can be modeled as combinatorial optimization problems. In this work, a hybrid variant of meta-heuristic algorithm ant colony optimization (ACO) is used. Different variants of ant colony optimization have been applied to the quadratic assignment problem (QAP). In this paper a hybrid approach is proposed, which is combination of Ant system and other meta-heuristic approaches to take benefits of both methods. This hybrid approach is accompanied by a local search technique. Moreover, a comparative analysis is done using QAPLIB.
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.
