By Topic

Genetic tabu search for the Multi-Objective knapsack problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)
Barichard, Vincent ; LERIA, Faculty of Sciences, University of Angers, 2 Boulevard Lavoisier, 49045 Angers Cedex 01, France ; Hao, Jin-Kao

We introduce a hybrid algorithm for the 0–1 multidimensional multi-objective knapsack problem. This algorithm, called GTSMOKP, combines a genetic procedure and a tabu search operator. The algorithm is evaluated on 9 well-known benchmark instances and shows highly competitive results compared with two state-of-the-art algorithms.

Published in:

Tsinghua Science and Technology  (Volume:8 ,  Issue: 1 )