Abstract
Combinatorial problems with NP-hard complexity appear frequently in operational research. Making robust algorithms that solve these combinatorial problems is of interest in operational research. In this article, a binarization mechanism is proposed so that continuous metaheuristics can solve combinatorial problems. The binarization mechanism uses the concept of percentile. This percentile mechanism is applied to the ant lion algorithm. The NP-hard knapsack problem (MKP) was used to verify our algorithm. Additionally, the binary percentile algorithm was compared with other algorithms that have recently has solved the MKP, observing that the percentile algorithm produces competitive results.
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.
