Abstract
In this paper, we describe a heuristic that solves very large problem instances (one million items) of the 0/1 multiple knapsack problem. The proposed method is based on IRT heuristic and it is a pure local search technique that attempts to improve within a subset of items instead of the complete set of n items. Each time an interval of items is randomly selected to choose the set of items that can increase the total profit. The experimental work reveals an excellent scalability to solve very large problem instances against IRT and Martelo&Toth heuristic method (MTHM).
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 callMore From: International Journal of Computational Systems Engineering
Disclaimer: 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.
