An ADD/DROP procedure for the capacitated plant location problem

Detalhes bibliográficos
Autor(a) principal: Bornstein,Claudio Thomas
Data de Publicação: 2004
Outros Autores: Campêlo,Manoel
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Pesquisa operacional (Online)
Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382004000100008
Resumo: The capacitated plant location problem with linear transportation costs is considered. Exact rules and heuristics are presented for opening or closing of facilities. A heuristic algorithm based on ADD/DROP strategies is proposed. Procedures are implemented with the help of lower and upper bounds using Lagrangean relaxation. Computational results are presented and comparisons with other algorithms are made.
id SOBRAPO-1_0ef9f3b14dc1b8448f95082d269c0ce5
oai_identifier_str oai:scielo:S0101-74382004000100008
network_acronym_str SOBRAPO-1
network_name_str Pesquisa operacional (Online)
repository_id_str
spelling An ADD/DROP procedure for the capacitated plant location problemcapacitated plant location problemADD/DROP proceduresheuristic methodsLagrangean relaxationThe capacitated plant location problem with linear transportation costs is considered. Exact rules and heuristics are presented for opening or closing of facilities. A heuristic algorithm based on ADD/DROP strategies is proposed. Procedures are implemented with the help of lower and upper bounds using Lagrangean relaxation. Computational results are presented and comparisons with other algorithms are made.Sociedade Brasileira de Pesquisa Operacional2004-04-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382004000100008Pesquisa Operacional v.24 n.1 2004reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/S0101-74382004000100008info:eu-repo/semantics/openAccessBornstein,Claudio ThomasCampêlo,Manoeleng2004-06-04T00:00:00Zoai:scielo:S0101-74382004000100008Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2004-06-04T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false
dc.title.none.fl_str_mv An ADD/DROP procedure for the capacitated plant location problem
title An ADD/DROP procedure for the capacitated plant location problem
spellingShingle An ADD/DROP procedure for the capacitated plant location problem
Bornstein,Claudio Thomas
capacitated plant location problem
ADD/DROP procedures
heuristic methods
Lagrangean relaxation
title_short An ADD/DROP procedure for the capacitated plant location problem
title_full An ADD/DROP procedure for the capacitated plant location problem
title_fullStr An ADD/DROP procedure for the capacitated plant location problem
title_full_unstemmed An ADD/DROP procedure for the capacitated plant location problem
title_sort An ADD/DROP procedure for the capacitated plant location problem
author Bornstein,Claudio Thomas
author_facet Bornstein,Claudio Thomas
Campêlo,Manoel
author_role author
author2 Campêlo,Manoel
author2_role author
dc.contributor.author.fl_str_mv Bornstein,Claudio Thomas
Campêlo,Manoel
dc.subject.por.fl_str_mv capacitated plant location problem
ADD/DROP procedures
heuristic methods
Lagrangean relaxation
topic capacitated plant location problem
ADD/DROP procedures
heuristic methods
Lagrangean relaxation
description The capacitated plant location problem with linear transportation costs is considered. Exact rules and heuristics are presented for opening or closing of facilities. A heuristic algorithm based on ADD/DROP strategies is proposed. Procedures are implemented with the help of lower and upper bounds using Lagrangean relaxation. Computational results are presented and comparisons with other algorithms are made.
publishDate 2004
dc.date.none.fl_str_mv 2004-04-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382004000100008
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382004000100008
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/S0101-74382004000100008
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv text/html
dc.publisher.none.fl_str_mv Sociedade Brasileira de Pesquisa Operacional
publisher.none.fl_str_mv Sociedade Brasileira de Pesquisa Operacional
dc.source.none.fl_str_mv Pesquisa Operacional v.24 n.1 2004
reponame:Pesquisa operacional (Online)
instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron:SOBRAPO
instname_str Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron_str SOBRAPO
institution SOBRAPO
reponame_str Pesquisa operacional (Online)
collection Pesquisa operacional (Online)
repository.name.fl_str_mv Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
repository.mail.fl_str_mv ||sobrapo@sobrapo.org.br
_version_ 1750318016272269312

Registros relacionados