Bicriteria path problem minimizing the cost and minimizing the number of labels

Detalhes bibliográficos
Autor(a) principal: Pascoal, Marta
Data de Publicação: 2013
Outros Autores: Captivo, M. Eugénia, Clímaco, João, Laranjeira, Ana
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/44383
https://doi.org/10.1007/s10288-013-0229-0
Resumo: We address a bicriterion path problem where each arc is assigned with a cost value and a label (such as a color). The first criterion intends to minimize the total cost of the path (the summation of its arc costs), while the second intends to get the solution with a minimal number of different labels. Since these criteria, in general, are conflicting criteria we develop an algorithm to generate the set of non-dominated paths. Computational experiments are presented and results are discussed.
id RCAP_b4c1b45ae4d7bc8d5a1fa5d9542bcedb
oai_identifier_str oai:estudogeral.uc.pt:10316/44383
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 Bicriteria path problem minimizing the cost and minimizing the number of labelsWe address a bicriterion path problem where each arc is assigned with a cost value and a label (such as a color). The first criterion intends to minimize the total cost of the path (the summation of its arc costs), while the second intends to get the solution with a minimal number of different labels. Since these criteria, in general, are conflicting criteria we develop an algorithm to generate the set of non-dominated paths. Computational experiments are presented and results are discussed.Springer2013info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articlehttp://hdl.handle.net/10316/44383http://hdl.handle.net/10316/44383https://doi.org/10.1007/s10288-013-0229-0https://doi.org/10.1007/s10288-013-0229-0enghttps://doi.org/10.1007/s10288-013-0229-0Pascoal, MartaCaptivo, M. EugéniaClímaco, JoãoLaranjeira, Anainfo: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-06-29T10:02:52Zoai:estudogeral.uc.pt:10316/44383Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T21:00:48.325912Repositó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 Bicriteria path problem minimizing the cost and minimizing the number of labels
title Bicriteria path problem minimizing the cost and minimizing the number of labels
spellingShingle Bicriteria path problem minimizing the cost and minimizing the number of labels
Pascoal, Marta
title_short Bicriteria path problem minimizing the cost and minimizing the number of labels
title_full Bicriteria path problem minimizing the cost and minimizing the number of labels
title_fullStr Bicriteria path problem minimizing the cost and minimizing the number of labels
title_full_unstemmed Bicriteria path problem minimizing the cost and minimizing the number of labels
title_sort Bicriteria path problem minimizing the cost and minimizing the number of labels
author Pascoal, Marta
author_facet Pascoal, Marta
Captivo, M. Eugénia
Clímaco, João
Laranjeira, Ana
author_role author
author2 Captivo, M. Eugénia
Clímaco, João
Laranjeira, Ana
author2_role author
author
author
dc.contributor.author.fl_str_mv Pascoal, Marta
Captivo, M. Eugénia
Clímaco, João
Laranjeira, Ana
description We address a bicriterion path problem where each arc is assigned with a cost value and a label (such as a color). The first criterion intends to minimize the total cost of the path (the summation of its arc costs), while the second intends to get the solution with a minimal number of different labels. Since these criteria, in general, are conflicting criteria we develop an algorithm to generate the set of non-dominated paths. Computational experiments are presented and results are discussed.
publishDate 2013
dc.date.none.fl_str_mv 2013
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/44383
http://hdl.handle.net/10316/44383
https://doi.org/10.1007/s10288-013-0229-0
https://doi.org/10.1007/s10288-013-0229-0
url http://hdl.handle.net/10316/44383
https://doi.org/10.1007/s10288-013-0229-0
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv https://doi.org/10.1007/s10288-013-0229-0
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv Springer
publisher.none.fl_str_mv Springer
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_ 1799133898428383232

Registros relacionados