Two stage capacitated facility location problem: Lagrangian based heuristics

Detalhes bibliográficos
Autor(a) principal: Litvinchev, Igor
Data de Publicação: 2012
Outros Autores: Mata, Miguel, Ozuna, Lucero, Saucedo, Jania, Rangel, Socorro [UNESP]
Tipo de documento: Capítulo de livro
Idioma: eng
Título da fonte: Repositório Institucional da UNESP
Texto Completo: http://dx.doi.org/10.4018/978-1-4666-2086-5.ch014
http://hdl.handle.net/11449/220153
Resumo: In the two-stage capacitated facility location problem, a single product is produced at some plants in order to satisfy customer demands. The product is transported from these plants to some depots and then to the customers. The capacities of the plants and depots are limited. The aim is to select cost minimizing locations from a set of potential plants and depots. This cost includes fixed cost associated with opening plants and depots, and variable cost associated with both transportation stages. In this work two different mixed integer linear programming formulations are considered for the problem. Several Lagrangian relaxations are analyzed and compared, a Lagrangian heuristic producing feasible solutions is presented. The results of a computational study are reported. © 2013, IGI Global.
id UNSP_ce1810de55203ade5667f6768ea6a889
oai_identifier_str oai:repositorio.unesp.br:11449/220153
network_acronym_str UNSP
network_name_str Repositório Institucional da UNESP
repository_id_str 2946
spelling Two stage capacitated facility location problem: Lagrangian based heuristicsIn the two-stage capacitated facility location problem, a single product is produced at some plants in order to satisfy customer demands. The product is transported from these plants to some depots and then to the customers. The capacities of the plants and depots are limited. The aim is to select cost minimizing locations from a set of potential plants and depots. This cost includes fixed cost associated with opening plants and depots, and variable cost associated with both transportation stages. In this work two different mixed integer linear programming formulations are considered for the problem. Several Lagrangian relaxations are analyzed and compared, a Lagrangian heuristic producing feasible solutions is presented. The results of a computational study are reported. © 2013, IGI Global.Nuevo Leon State University - UANLSão Paulo State University - UNESP, São José do Rio PretoSão Paulo State University - UNESP, São José do Rio PretoNuevo Leon State University - UANLUniversidade Estadual Paulista (UNESP)Litvinchev, IgorMata, MiguelOzuna, LuceroSaucedo, JaniaRangel, Socorro [UNESP]2022-04-28T18:59:53Z2022-04-28T18:59:53Z2012-12-01info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/bookPart421-447http://dx.doi.org/10.4018/978-1-4666-2086-5.ch014Meta-Heuristics Optimization Algorithms in Engineering, Business, Economics, and Finance, p. 421-447.http://hdl.handle.net/11449/22015310.4018/978-1-4666-2086-5.ch0142-s2.0-84900617929Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengMeta-Heuristics Optimization Algorithms in Engineering, Business, Economics, and Financeinfo:eu-repo/semantics/openAccess2022-04-28T18:59:53Zoai:repositorio.unesp.br:11449/220153Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462022-04-28T18:59:53Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false
dc.title.none.fl_str_mv Two stage capacitated facility location problem: Lagrangian based heuristics
title Two stage capacitated facility location problem: Lagrangian based heuristics
spellingShingle Two stage capacitated facility location problem: Lagrangian based heuristics
Litvinchev, Igor
title_short Two stage capacitated facility location problem: Lagrangian based heuristics
title_full Two stage capacitated facility location problem: Lagrangian based heuristics
title_fullStr Two stage capacitated facility location problem: Lagrangian based heuristics
title_full_unstemmed Two stage capacitated facility location problem: Lagrangian based heuristics
title_sort Two stage capacitated facility location problem: Lagrangian based heuristics
author Litvinchev, Igor
author_facet Litvinchev, Igor
Mata, Miguel
Ozuna, Lucero
Saucedo, Jania
Rangel, Socorro [UNESP]
author_role author
author2 Mata, Miguel
Ozuna, Lucero
Saucedo, Jania
Rangel, Socorro [UNESP]
author2_role author
author
author
author
dc.contributor.none.fl_str_mv Nuevo Leon State University - UANL
Universidade Estadual Paulista (UNESP)
dc.contributor.author.fl_str_mv Litvinchev, Igor
Mata, Miguel
Ozuna, Lucero
Saucedo, Jania
Rangel, Socorro [UNESP]
description In the two-stage capacitated facility location problem, a single product is produced at some plants in order to satisfy customer demands. The product is transported from these plants to some depots and then to the customers. The capacities of the plants and depots are limited. The aim is to select cost minimizing locations from a set of potential plants and depots. This cost includes fixed cost associated with opening plants and depots, and variable cost associated with both transportation stages. In this work two different mixed integer linear programming formulations are considered for the problem. Several Lagrangian relaxations are analyzed and compared, a Lagrangian heuristic producing feasible solutions is presented. The results of a computational study are reported. © 2013, IGI Global.
publishDate 2012
dc.date.none.fl_str_mv 2012-12-01
2022-04-28T18:59:53Z
2022-04-28T18:59:53Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/bookPart
format bookPart
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://dx.doi.org/10.4018/978-1-4666-2086-5.ch014
Meta-Heuristics Optimization Algorithms in Engineering, Business, Economics, and Finance, p. 421-447.
http://hdl.handle.net/11449/220153
10.4018/978-1-4666-2086-5.ch014
2-s2.0-84900617929
url http://dx.doi.org/10.4018/978-1-4666-2086-5.ch014
http://hdl.handle.net/11449/220153
identifier_str_mv Meta-Heuristics Optimization Algorithms in Engineering, Business, Economics, and Finance, p. 421-447.
10.4018/978-1-4666-2086-5.ch014
2-s2.0-84900617929
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Meta-Heuristics Optimization Algorithms in Engineering, Business, Economics, and Finance
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv 421-447
dc.source.none.fl_str_mv Scopus
reponame:Repositório Institucional da UNESP
instname:Universidade Estadual Paulista (UNESP)
instacron:UNESP
instname_str Universidade Estadual Paulista (UNESP)
instacron_str UNESP
institution UNESP
reponame_str Repositório Institucional da UNESP
collection Repositório Institucional da UNESP
repository.name.fl_str_mv Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)
repository.mail.fl_str_mv
_version_ 1803047189117665280

Registros relacionados