Abstract
This paper proposes an adaptation of the scatter search (SS) metaheuristic for approximately solving the disjunctively constrained knapsack problem (DCKP). The DCKP can be viewed as a variant of the standard knapsack pr oblem with special disjunctive constraints. Two versions of SS are presented which are organised following the usual structure of SS. The method is analysed computationally on a set of problem instances of the literature and compared to the results provided by the Cplex solver and other algorithms of the literature. For these instances, most of which cannot be solved to proven optimality in a reasonable time, the proposed method provides results of high quality within reasonable computational time.
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.
