Referenced Items are not available for this document.
Open Access
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
)
Date of Publication: Feb. 2003
- Page(s):
- 8 - 13
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 17 January 2012
- Issue Date :
- Feb. 2003
- Sponsored by :
- Tsinghua University Press (TUP)
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
