An approach using Lagrangian/surrogate relaxation for lot-sizing with transportation costs
Autor(a) principal: | |
---|---|
Data de Publicação: | 2009 |
Outros Autores: | , , |
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-74382009000200002 |
Resumo: | The aim of this work was to study a distribution and lot-sizing problem that considers costs with transportation to a company warehouse as well as, inventory, production and setup costs. The logistic costs are associated with necessary containers to pack produced items. The company negotiates a long-term contract in which a fixed cost per period is associated with the transportation of the items. On the other hand, a limited number of containers are available with a lower cost than the average cost. If an occasional demand increase occurs, other containers can be utilized; however, their costs are higher. A mathematical model was proposed in the literature and solved using the Lagrangian heuristic. Here, the use of the Lagrangian/surrogate heuristic to solve the problem is evaluated. Moreover, an extension of the literature model is considered adding capacity constraints and allowing backlogging. Computational tests show that Lagrangian/surrogate heuristics are competitive, especially when the capacity constraints are tight. |
id |
SOBRAPO-1_8e531ce49827799703b7abdcb71057b3 |
---|---|
oai_identifier_str |
oai:scielo:S0101-74382009000200002 |
network_acronym_str |
SOBRAPO-1 |
network_name_str |
Pesquisa operacional (Online) |
repository_id_str |
|
spelling |
An approach using Lagrangian/surrogate relaxation for lot-sizing with transportation costslot-sizingtransportation costsLagrangian/surrogate relaxationThe aim of this work was to study a distribution and lot-sizing problem that considers costs with transportation to a company warehouse as well as, inventory, production and setup costs. The logistic costs are associated with necessary containers to pack produced items. The company negotiates a long-term contract in which a fixed cost per period is associated with the transportation of the items. On the other hand, a limited number of containers are available with a lower cost than the average cost. If an occasional demand increase occurs, other containers can be utilized; however, their costs are higher. A mathematical model was proposed in the literature and solved using the Lagrangian heuristic. Here, the use of the Lagrangian/surrogate heuristic to solve the problem is evaluated. Moreover, an extension of the literature model is considered adding capacity constraints and allowing backlogging. Computational tests show that Lagrangian/surrogate heuristics are competitive, especially when the capacity constraints are tight.Sociedade Brasileira de Pesquisa Operacional2009-08-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382009000200002Pesquisa Operacional v.29 n.2 2009reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/S0101-74382009000200002info:eu-repo/semantics/openAccessMolina,FlavioSantos,Maristela Oliveira dosToledo,Franklina M. B.Araujo,Silvio Alexandre deeng2009-10-09T00:00:00Zoai:scielo:S0101-74382009000200002Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2009-10-09T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false |
dc.title.none.fl_str_mv |
An approach using Lagrangian/surrogate relaxation for lot-sizing with transportation costs |
title |
An approach using Lagrangian/surrogate relaxation for lot-sizing with transportation costs |
spellingShingle |
An approach using Lagrangian/surrogate relaxation for lot-sizing with transportation costs Molina,Flavio lot-sizing transportation costs Lagrangian/surrogate relaxation |
title_short |
An approach using Lagrangian/surrogate relaxation for lot-sizing with transportation costs |
title_full |
An approach using Lagrangian/surrogate relaxation for lot-sizing with transportation costs |
title_fullStr |
An approach using Lagrangian/surrogate relaxation for lot-sizing with transportation costs |
title_full_unstemmed |
An approach using Lagrangian/surrogate relaxation for lot-sizing with transportation costs |
title_sort |
An approach using Lagrangian/surrogate relaxation for lot-sizing with transportation costs |
author |
Molina,Flavio |
author_facet |
Molina,Flavio Santos,Maristela Oliveira dos Toledo,Franklina M. B. Araujo,Silvio Alexandre de |
author_role |
author |
author2 |
Santos,Maristela Oliveira dos Toledo,Franklina M. B. Araujo,Silvio Alexandre de |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Molina,Flavio Santos,Maristela Oliveira dos Toledo,Franklina M. B. Araujo,Silvio Alexandre de |
dc.subject.por.fl_str_mv |
lot-sizing transportation costs Lagrangian/surrogate relaxation |
topic |
lot-sizing transportation costs Lagrangian/surrogate relaxation |
description |
The aim of this work was to study a distribution and lot-sizing problem that considers costs with transportation to a company warehouse as well as, inventory, production and setup costs. The logistic costs are associated with necessary containers to pack produced items. The company negotiates a long-term contract in which a fixed cost per period is associated with the transportation of the items. On the other hand, a limited number of containers are available with a lower cost than the average cost. If an occasional demand increase occurs, other containers can be utilized; however, their costs are higher. A mathematical model was proposed in the literature and solved using the Lagrangian heuristic. Here, the use of the Lagrangian/surrogate heuristic to solve the problem is evaluated. Moreover, an extension of the literature model is considered adding capacity constraints and allowing backlogging. Computational tests show that Lagrangian/surrogate heuristics are competitive, especially when the capacity constraints are tight. |
publishDate |
2009 |
dc.date.none.fl_str_mv |
2009-08-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-74382009000200002 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382009000200002 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1590/S0101-74382009000200002 |
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.29 n.2 2009 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_ |
1750318016974815232 |