Lower-bounding and heuristic methods for a refuse collection vehicle routing problem

Detalhes bibliográficos
Autor(a) principal: Mourão, M. Cândida
Data de Publicação: 2000
Outros Autores: Almeida, M. Teresa
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/10400.5/27884
Resumo: A set of routes that minimizes the total collecting cost of the household refuse in a quarter of Lisbon may be obtained solving a Capacitated Arc Routing Problem (CARP) with side constraints. The CARP is known to be an NP-hard problem. We present two lower-bounding methods, both based on the transportation model, in which we have been able to incorporate some of the side constraints. We also present a three-phase heuristic to generate a near-optimal solution from the solution obtained with the first lower-bounding method. For the relative gap between the heuristic solution value and its associated lower bound value we give a theoretical worst-case bound and computational experience obtained with a set of test problems.
id RCAP_001571cb1df0ecee0ff0a3b44bb8a1b9
oai_identifier_str oai:www.repository.utl.pt:10400.5/27884
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 Lower-bounding and heuristic methods for a refuse collection vehicle routing problemRoutingLower BoundsHeuristicsA set of routes that minimizes the total collecting cost of the household refuse in a quarter of Lisbon may be obtained solving a Capacitated Arc Routing Problem (CARP) with side constraints. The CARP is known to be an NP-hard problem. We present two lower-bounding methods, both based on the transportation model, in which we have been able to incorporate some of the side constraints. We also present a three-phase heuristic to generate a near-optimal solution from the solution obtained with the first lower-bounding method. For the relative gap between the heuristic solution value and its associated lower bound value we give a theoretical worst-case bound and computational experience obtained with a set of test problems.ElsevierRepositório da Universidade de LisboaMourão, M. CândidaAlmeida, M. Teresa2023-06-05T07:02:04Z20002000-01-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10400.5/27884engMourão, M. Cândida and M. Teresa Almeida. (2000). “Lower-bounding and heuristic methods for a refuse collection vehicle routing problem”. European Journal of Operational Research. Vol. 121, No. 2: pp. 420-434. (Search PDF in 2023).0377-2217info: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:RCAAP2023-06-11T01:30:35Zoai:www.repository.utl.pt:10400.5/27884Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-19T18:00:10.525264Repositó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 Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
title Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
spellingShingle Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
Mourão, M. Cândida
Routing
Lower Bounds
Heuristics
title_short Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
title_full Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
title_fullStr Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
title_full_unstemmed Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
title_sort Lower-bounding and heuristic methods for a refuse collection vehicle routing problem
author Mourão, M. Cândida
author_facet Mourão, M. Cândida
Almeida, M. Teresa
author_role author
author2 Almeida, M. Teresa
author2_role author
dc.contributor.none.fl_str_mv Repositório da Universidade de Lisboa
dc.contributor.author.fl_str_mv Mourão, M. Cândida
Almeida, M. Teresa
dc.subject.por.fl_str_mv Routing
Lower Bounds
Heuristics
topic Routing
Lower Bounds
Heuristics
description A set of routes that minimizes the total collecting cost of the household refuse in a quarter of Lisbon may be obtained solving a Capacitated Arc Routing Problem (CARP) with side constraints. The CARP is known to be an NP-hard problem. We present two lower-bounding methods, both based on the transportation model, in which we have been able to incorporate some of the side constraints. We also present a three-phase heuristic to generate a near-optimal solution from the solution obtained with the first lower-bounding method. For the relative gap between the heuristic solution value and its associated lower bound value we give a theoretical worst-case bound and computational experience obtained with a set of test problems.
publishDate 2000
dc.date.none.fl_str_mv 2000
2000-01-01T00:00:00Z
2023-06-05T07:02:04Z
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/10400.5/27884
url http://hdl.handle.net/10400.5/27884
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Mourão, M. Cândida and M. Teresa Almeida. (2000). “Lower-bounding and heuristic methods for a refuse collection vehicle routing problem”. European Journal of Operational Research. Vol. 121, No. 2: pp. 420-434. (Search PDF in 2023).
0377-2217
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
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_ 1799131670912172032