Accelerating benders decomposition with heuristicmaster problem solutions

Detalhes bibliográficos
Autor(a) principal: Costa,Alysson M.
Data de Publicação: 2012
Outros Autores: Cordeau,Jean-François, Gendron,Bernard, Laporte,Gilbert
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-74382012000100002
Resumo: In this paper, a general scheme for generating extra cuts during the execution of a Benders decomposition algorithm is presented. These cuts are based on feasible and infeasible master problem solutions generated by means of a heuristic. This article includes general guidelines and a case study with a fixed charge network design problem. Computational tests with instances of this problem show the efficiency of the strategy. The most important aspect of the proposed ideas is their generality, which allows them to be used in virtually any Benders decomposition implementation.
id SOBRAPO-1_ad4898212a2bce67be55a6ceeb0d6fbc
oai_identifier_str oai:scielo:S0101-74382012000100002
network_acronym_str SOBRAPO-1
network_name_str Pesquisa operacional (Online)
repository_id_str
spelling Accelerating benders decomposition with heuristicmaster problem solutionsBenders decompositionextra cuts generationmixed-integer programmingIn this paper, a general scheme for generating extra cuts during the execution of a Benders decomposition algorithm is presented. These cuts are based on feasible and infeasible master problem solutions generated by means of a heuristic. This article includes general guidelines and a case study with a fixed charge network design problem. Computational tests with instances of this problem show the efficiency of the strategy. The most important aspect of the proposed ideas is their generality, which allows them to be used in virtually any Benders decomposition implementation.Sociedade Brasileira de Pesquisa Operacional2012-04-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382012000100002Pesquisa Operacional v.32 n.1 2012reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/S0101-74382012005000005info:eu-repo/semantics/openAccessCosta,Alysson M.Cordeau,Jean-FrançoisGendron,BernardLaporte,Gilberteng2012-05-02T00:00:00Zoai:scielo:S0101-74382012000100002Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2012-05-02T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false
dc.title.none.fl_str_mv Accelerating benders decomposition with heuristicmaster problem solutions
title Accelerating benders decomposition with heuristicmaster problem solutions
spellingShingle Accelerating benders decomposition with heuristicmaster problem solutions
Costa,Alysson M.
Benders decomposition
extra cuts generation
mixed-integer programming
title_short Accelerating benders decomposition with heuristicmaster problem solutions
title_full Accelerating benders decomposition with heuristicmaster problem solutions
title_fullStr Accelerating benders decomposition with heuristicmaster problem solutions
title_full_unstemmed Accelerating benders decomposition with heuristicmaster problem solutions
title_sort Accelerating benders decomposition with heuristicmaster problem solutions
author Costa,Alysson M.
author_facet Costa,Alysson M.
Cordeau,Jean-François
Gendron,Bernard
Laporte,Gilbert
author_role author
author2 Cordeau,Jean-François
Gendron,Bernard
Laporte,Gilbert
author2_role author
author
author
dc.contributor.author.fl_str_mv Costa,Alysson M.
Cordeau,Jean-François
Gendron,Bernard
Laporte,Gilbert
dc.subject.por.fl_str_mv Benders decomposition
extra cuts generation
mixed-integer programming
topic Benders decomposition
extra cuts generation
mixed-integer programming
description In this paper, a general scheme for generating extra cuts during the execution of a Benders decomposition algorithm is presented. These cuts are based on feasible and infeasible master problem solutions generated by means of a heuristic. This article includes general guidelines and a case study with a fixed charge network design problem. Computational tests with instances of this problem show the efficiency of the strategy. The most important aspect of the proposed ideas is their generality, which allows them to be used in virtually any Benders decomposition implementation.
publishDate 2012
dc.date.none.fl_str_mv 2012-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-74382012000100002
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382012000100002
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/S0101-74382012005000005
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.32 n.1 2012
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_ 1750318017400537088

Registros relacionados