Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem
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...
Saved in:
Published in | The Journal of the Operational Research Society Vol. 64; no. 10; pp. 1461 - 1473 |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
London
Taylor & Francis
01.10.2013
Palgrave Macmillan Palgrave Macmillan UK Taylor & Francis Ltd |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!