Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem

• Published in: The Journal of the Operational Research Society Vol. 64; no. 10; pp. 1461 - 1473
• Main Author: Sbihi, A
• Format: Journal Article
• Language: English
• Published: London Taylor & Francis 01.10.2013; Palgrave Macmillan; Palgrave Macmillan UK; Taylor & Francis Ltd
• Subjects: Algorithms; Business and Management; Capital budgeting; combinatorial optimization; Dynamic programming; expanding; General Paper; General Papers; Heuristic; Heuristics; integer programming; Iterative solutions; knapsack; Knapsack problem; Management; metaheuristics; multiple-choice; Neighborhoods; Objective functions; Operations research; Operations Research/Decision Theory; Optimal solutions; Search strategies; Studies; Taboos; Tabu search; combinatorial optimization; expanding; knapsack; metaheuristics; integer programming; multiple-choice

In this paper, we develop a perturbed reactive-based neighbourhood search algorithm for the expanding constraint multiple-choice knapsack problem. It combines reactive tabu search with some specific neighbourhood search strategies to approximately solve the problem. The tests were conducted on rando...