A Scatter Search Method for the Bi-Criteria Multi-dimensional 0,1-Knapsack Problem using Surrogate Relaxation

Detalhes bibliográficos
Autor(a) principal: Silva, Carlos Gomes da
Data de Publicação: 2004
Outros Autores: Clímaco, João, Figueira, José
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
Texto Completo: http://hdl.handle.net/10316/7923
https://doi.org/10.1023/B:JMMA.0000038617.09620.02
Resumo: This paper presents a scatter search (SS) based method for the bi-criteria multi-dimensional knapsack problem. The method is organized according to the usual structure of SS: (1) diversification, (2) improvement, (3) reference set update, (4) subset generation, and (5) solution combination. Surrogate relaxation is used to convert the multi-constraint problem into a single constraint one, which is used in the diversification method and to evaluate the quality of the solutions. The definition of the appropriate surrogate multiplier vector is also discussed. Tests on several sets of large size instances show that the results are of high quality and an accurate description of the entire set of the non-dominated solutions can be obtained within reasonable computational time. Comparisons with other meta-heuristics are also presented. In the tested instances the obtained set of potentially non-dominated solutions dominates the set found with those meta-heuristics.
id RCAP_76d9ed7be76dad7d40d29e0bfe895ad4
oai_identifier_str oai:estudogeral.uc.pt:10316/7923
network_acronym_str RCAP
network_name_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository_id_str 7160
spelling A Scatter Search Method for the Bi-Criteria Multi-dimensional 0,1-Knapsack Problem using Surrogate RelaxationThis paper presents a scatter search (SS) based method for the bi-criteria multi-dimensional knapsack problem. The method is organized according to the usual structure of SS: (1) diversification, (2) improvement, (3) reference set update, (4) subset generation, and (5) solution combination. Surrogate relaxation is used to convert the multi-constraint problem into a single constraint one, which is used in the diversification method and to evaluate the quality of the solutions. The definition of the appropriate surrogate multiplier vector is also discussed. Tests on several sets of large size instances show that the results are of high quality and an accurate description of the entire set of the non-dominated solutions can be obtained within reasonable computational time. Comparisons with other meta-heuristics are also presented. In the tested instances the obtained set of potentially non-dominated solutions dominates the set found with those meta-heuristics.2004info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/7923http://hdl.handle.net/10316/7923https://doi.org/10.1023/B:JMMA.0000038617.09620.02engJournal of Mathematical Modelling and Algorithms. 3:3 (2004) 183-208Silva, Carlos Gomes daClímaco, JoãoFigueira, Joséinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2021-09-01T11:24:25Zoai:estudogeral.uc.pt:10316/7923Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T20:45:40.404919Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse
dc.title.none.fl_str_mv A Scatter Search Method for the Bi-Criteria Multi-dimensional 0,1-Knapsack Problem using Surrogate Relaxation
title A Scatter Search Method for the Bi-Criteria Multi-dimensional 0,1-Knapsack Problem using Surrogate Relaxation
spellingShingle A Scatter Search Method for the Bi-Criteria Multi-dimensional 0,1-Knapsack Problem using Surrogate Relaxation
Silva, Carlos Gomes da
title_short A Scatter Search Method for the Bi-Criteria Multi-dimensional 0,1-Knapsack Problem using Surrogate Relaxation
title_full A Scatter Search Method for the Bi-Criteria Multi-dimensional 0,1-Knapsack Problem using Surrogate Relaxation
title_fullStr A Scatter Search Method for the Bi-Criteria Multi-dimensional 0,1-Knapsack Problem using Surrogate Relaxation
title_full_unstemmed A Scatter Search Method for the Bi-Criteria Multi-dimensional 0,1-Knapsack Problem using Surrogate Relaxation
title_sort A Scatter Search Method for the Bi-Criteria Multi-dimensional 0,1-Knapsack Problem using Surrogate Relaxation
author Silva, Carlos Gomes da
author_facet Silva, Carlos Gomes da
Clímaco, João
Figueira, José
author_role author
author2 Clímaco, João
Figueira, José
author2_role author
author
dc.contributor.author.fl_str_mv Silva, Carlos Gomes da
Clímaco, João
Figueira, José
description This paper presents a scatter search (SS) based method for the bi-criteria multi-dimensional knapsack problem. The method is organized according to the usual structure of SS: (1) diversification, (2) improvement, (3) reference set update, (4) subset generation, and (5) solution combination. Surrogate relaxation is used to convert the multi-constraint problem into a single constraint one, which is used in the diversification method and to evaluate the quality of the solutions. The definition of the appropriate surrogate multiplier vector is also discussed. Tests on several sets of large size instances show that the results are of high quality and an accurate description of the entire set of the non-dominated solutions can be obtained within reasonable computational time. Comparisons with other meta-heuristics are also presented. In the tested instances the obtained set of potentially non-dominated solutions dominates the set found with those meta-heuristics.
publishDate 2004
dc.date.none.fl_str_mv 2004
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10316/7923
http://hdl.handle.net/10316/7923
https://doi.org/10.1023/B:JMMA.0000038617.09620.02
url http://hdl.handle.net/10316/7923
https://doi.org/10.1023/B:JMMA.0000038617.09620.02
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Journal of Mathematical Modelling and Algorithms. 3:3 (2004) 183-208
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.source.none.fl_str_mv reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron:RCAAP
instname_str Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
instacron_str RCAAP
institution RCAAP
reponame_str Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
collection Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
repository.name.fl_str_mv Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação
repository.mail.fl_str_mv
_version_ 1799133731372400640

Registros relacionados