Diseño e implementación de un modelo para la asignación de rutas de recolección de basuras en Econatural S.A E.S.P
El incremento de las grandes industrias y el aumento en la población, ha generado que el problema de recolección de residuos urbanos sea tratado con mayor importancia y complejidad en los últimos años, pensando siempre en mitigar el impacto ambiental y preservar la salubridad de la comunidad; lo que...
- Autores:
-
Ayala Castellanos, Brighith Lisseth
- Tipo de recurso:
- http://purl.org/coar/version/c_b1a7d7d4d402bcce
- Fecha de publicación:
- 2016
- Institución:
- Universidad Industrial de Santander
- Repositorio:
- Repositorio UIS
- Idioma:
- spa
- OAI Identifier:
- oai:noesis.uis.edu.co:20.500.14071/34782
- Palabra clave:
- Arp
Carp
Ocarp. Branch And Bound
The increase in major industries and the increase in population
has meant that the problem of urban waste collection be treated with great importance and complexity in the last years
always thinking to mitigate the environmental impact and to preserve the health of the community; which arouses the interest in investigating the world of operations research
especially the diversity of techniques applied to optimize transport. The Econatural S.A E.S.P Company provides the service for garbage collection
and a route design is constructed using a computational tool to optimize the route time of the collection program. It begins with a previous diagnosis to know the operations of the collection process
followed by the investigation of the review of the literature in addressing the problems and possible solutions
to select the appropriate modeling according to the characteristics of the company. The problem is modeled as an integer linear programming under the Capacitated Arc Routing Problem CARP
in its OCARP extension
consisting of a vehicle with the homogeneous ability to visit a set of streets at least once
defining the points of entry and exit that best fits the route minimizing the time of collection. For its solution it was used the computational tool Excel and its complement Solver Premium as well its exact Branch and Bound algorithm
defining scenarios of input nodes and outputs
taking into account parameters of proximity to roads to subsequently undertake the connections to certain surrounding neighborhoods.
- Rights
- License
- Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
id |
UISANTADR2_9c87f1899c7a2282d2d800e01924ad9c |
---|---|
oai_identifier_str |
oai:noesis.uis.edu.co:20.500.14071/34782 |
network_acronym_str |
UISANTADR2 |
network_name_str |
Repositorio UIS |
repository_id_str |
|
dc.title.none.fl_str_mv |
Diseño e implementación de un modelo para la asignación de rutas de recolección de basuras en Econatural S.A E.S.P |
dc.title.english.none.fl_str_mv |
Arp, Carp, Ocarp, Branch And Bound |
title |
Diseño e implementación de un modelo para la asignación de rutas de recolección de basuras en Econatural S.A E.S.P |
spellingShingle |
Diseño e implementación de un modelo para la asignación de rutas de recolección de basuras en Econatural S.A E.S.P Arp Carp Ocarp. Branch And Bound The increase in major industries and the increase in population has meant that the problem of urban waste collection be treated with great importance and complexity in the last years always thinking to mitigate the environmental impact and to preserve the health of the community; which arouses the interest in investigating the world of operations research especially the diversity of techniques applied to optimize transport. The Econatural S.A E.S.P Company provides the service for garbage collection and a route design is constructed using a computational tool to optimize the route time of the collection program. It begins with a previous diagnosis to know the operations of the collection process followed by the investigation of the review of the literature in addressing the problems and possible solutions to select the appropriate modeling according to the characteristics of the company. The problem is modeled as an integer linear programming under the Capacitated Arc Routing Problem CARP in its OCARP extension consisting of a vehicle with the homogeneous ability to visit a set of streets at least once defining the points of entry and exit that best fits the route minimizing the time of collection. For its solution it was used the computational tool Excel and its complement Solver Premium as well its exact Branch and Bound algorithm defining scenarios of input nodes and outputs taking into account parameters of proximity to roads to subsequently undertake the connections to certain surrounding neighborhoods. |
title_short |
Diseño e implementación de un modelo para la asignación de rutas de recolección de basuras en Econatural S.A E.S.P |
title_full |
Diseño e implementación de un modelo para la asignación de rutas de recolección de basuras en Econatural S.A E.S.P |
title_fullStr |
Diseño e implementación de un modelo para la asignación de rutas de recolección de basuras en Econatural S.A E.S.P |
title_full_unstemmed |
Diseño e implementación de un modelo para la asignación de rutas de recolección de basuras en Econatural S.A E.S.P |
title_sort |
Diseño e implementación de un modelo para la asignación de rutas de recolección de basuras en Econatural S.A E.S.P |
dc.creator.fl_str_mv |
Ayala Castellanos, Brighith Lisseth |
dc.contributor.advisor.none.fl_str_mv |
Arias Osorio, Javier Eduardo |
dc.contributor.author.none.fl_str_mv |
Ayala Castellanos, Brighith Lisseth |
dc.subject.none.fl_str_mv |
Arp Carp Ocarp. Branch And Bound |
topic |
Arp Carp Ocarp. Branch And Bound The increase in major industries and the increase in population has meant that the problem of urban waste collection be treated with great importance and complexity in the last years always thinking to mitigate the environmental impact and to preserve the health of the community; which arouses the interest in investigating the world of operations research especially the diversity of techniques applied to optimize transport. The Econatural S.A E.S.P Company provides the service for garbage collection and a route design is constructed using a computational tool to optimize the route time of the collection program. It begins with a previous diagnosis to know the operations of the collection process followed by the investigation of the review of the literature in addressing the problems and possible solutions to select the appropriate modeling according to the characteristics of the company. The problem is modeled as an integer linear programming under the Capacitated Arc Routing Problem CARP in its OCARP extension consisting of a vehicle with the homogeneous ability to visit a set of streets at least once defining the points of entry and exit that best fits the route minimizing the time of collection. For its solution it was used the computational tool Excel and its complement Solver Premium as well its exact Branch and Bound algorithm defining scenarios of input nodes and outputs taking into account parameters of proximity to roads to subsequently undertake the connections to certain surrounding neighborhoods. |
dc.subject.keyword.none.fl_str_mv |
The increase in major industries and the increase in population has meant that the problem of urban waste collection be treated with great importance and complexity in the last years always thinking to mitigate the environmental impact and to preserve the health of the community; which arouses the interest in investigating the world of operations research especially the diversity of techniques applied to optimize transport. The Econatural S.A E.S.P Company provides the service for garbage collection and a route design is constructed using a computational tool to optimize the route time of the collection program. It begins with a previous diagnosis to know the operations of the collection process followed by the investigation of the review of the literature in addressing the problems and possible solutions to select the appropriate modeling according to the characteristics of the company. The problem is modeled as an integer linear programming under the Capacitated Arc Routing Problem CARP in its OCARP extension consisting of a vehicle with the homogeneous ability to visit a set of streets at least once defining the points of entry and exit that best fits the route minimizing the time of collection. For its solution it was used the computational tool Excel and its complement Solver Premium as well its exact Branch and Bound algorithm defining scenarios of input nodes and outputs taking into account parameters of proximity to roads to subsequently undertake the connections to certain surrounding neighborhoods. |
description |
El incremento de las grandes industrias y el aumento en la población, ha generado que el problema de recolección de residuos urbanos sea tratado con mayor importancia y complejidad en los últimos años, pensando siempre en mitigar el impacto ambiental y preservar la salubridad de la comunidad; lo que despierta el interés por indagar el mundo de la investigación de las operaciones, en especial la diversidad de técnicas aplicadas a la optimización de transporte. La empresa Econatural S.A E.S.P presta el servicio de recolección de basuras, se construye un diseño de rutas empleando una herramienta computacional para optimizar el tiempo de ruta del programa de recolección. Se inicia con un previo diagnóstico para conocer las operaciones del proceso de recolección, seguido de la indagación de la revisión de la literatura sobre la problemática abordar y sus posibles soluciones, para seleccionar el modelamiento apropiado según las características de la empresa. El problema se modela como programación lineal entera, bajo la problemática de ruteo de arcos capacitados CARP, en su extensión OCARP, que consiste en un vehículo con capacidad homogénea debe visitar un conjunto de calles al menos una vez, definiendo los puntos de entrada y salida que mejor se ajuste a la ruta minimizando el tiempo de recolección. Para su solución se empleó la herramienta computacional de Excel y su complemento Solver Premium y su algoritmo exacto Branch and Bound, definiendo escenarios de nodos de entrada y salida, teniendo en cuenta parámetros de cercanía a vías para posteriormente realizar las conexiones de ciertos barrios aledaños. |
publishDate |
2016 |
dc.date.available.none.fl_str_mv |
2016 2024-03-03T22:40:50Z |
dc.date.created.none.fl_str_mv |
2016 |
dc.date.issued.none.fl_str_mv |
2016 |
dc.date.accessioned.none.fl_str_mv |
2024-03-03T22:40:50Z |
dc.type.local.none.fl_str_mv |
Tesis/Trabajo de grado - Monografía - Pregrado |
dc.type.hasversion.none.fl_str_mv |
http://purl.org/coar/resource_type/c_7a1f |
dc.type.coar.none.fl_str_mv |
http://purl.org/coar/version/c_b1a7d7d4d402bcce |
format |
http://purl.org/coar/version/c_b1a7d7d4d402bcce |
dc.identifier.uri.none.fl_str_mv |
https://noesis.uis.edu.co/handle/20.500.14071/34782 |
dc.identifier.instname.none.fl_str_mv |
Universidad Industrial de Santander |
dc.identifier.reponame.none.fl_str_mv |
Universidad Industrial de Santander |
dc.identifier.repourl.none.fl_str_mv |
https://noesis.uis.edu.co |
url |
https://noesis.uis.edu.co/handle/20.500.14071/34782 https://noesis.uis.edu.co |
identifier_str_mv |
Universidad Industrial de Santander |
dc.language.iso.none.fl_str_mv |
spa |
language |
spa |
dc.rights.none.fl_str_mv |
http://creativecommons.org/licenses/by/4.0/ |
dc.rights.coar.fl_str_mv |
http://purl.org/coar/access_right/c_abf2 |
dc.rights.license.none.fl_str_mv |
Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) |
dc.rights.uri.none.fl_str_mv |
http://creativecommons.org/licenses/by-nc/4.0 |
dc.rights.creativecommons.none.fl_str_mv |
Atribución-NoComercial-SinDerivadas 4.0 Internacional (CC BY-NC-ND 4.0) |
rights_invalid_str_mv |
Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) http://creativecommons.org/licenses/by/4.0/ http://creativecommons.org/licenses/by-nc/4.0 Atribución-NoComercial-SinDerivadas 4.0 Internacional (CC BY-NC-ND 4.0) http://purl.org/coar/access_right/c_abf2 |
dc.format.mimetype.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Universidad Industrial de Santander |
dc.publisher.faculty.none.fl_str_mv |
Facultad de Ingenierías Fisicomecánicas |
dc.publisher.program.none.fl_str_mv |
Ingeniería Industrial |
dc.publisher.school.none.fl_str_mv |
Escuela de Estudios Industriales y Empresariales |
publisher.none.fl_str_mv |
Universidad Industrial de Santander |
institution |
Universidad Industrial de Santander |
bitstream.url.fl_str_mv |
https://noesis.uis.edu.co/bitstreams/cabc02fe-e69f-4434-aed5-3f8bb49be470/download https://noesis.uis.edu.co/bitstreams/ff630aea-cd90-4062-a8f9-6fc9da298c7e/download https://noesis.uis.edu.co/bitstreams/589c13e1-dae2-488b-97d4-08f5b00686cf/download |
bitstream.checksum.fl_str_mv |
9817e6450d80f2422ab7e2843d03b8a4 49e55b40e5ecfe3328117a555efb7ba6 1abcd36130c70570459b4ff6381aef01 |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 |
repository.name.fl_str_mv |
DSpace at UIS |
repository.mail.fl_str_mv |
noesis@uis.edu.co |
_version_ |
1808402317977845760 |
spelling |
Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)http://creativecommons.org/licenses/by/4.0/http://creativecommons.org/licenses/by-nc/4.0Atribución-NoComercial-SinDerivadas 4.0 Internacional (CC BY-NC-ND 4.0)http://purl.org/coar/access_right/c_abf2Arias Osorio, Javier EduardoAyala Castellanos, Brighith Lisseth2024-03-03T22:40:50Z20162024-03-03T22:40:50Z20162016https://noesis.uis.edu.co/handle/20.500.14071/34782Universidad Industrial de SantanderUniversidad Industrial de Santanderhttps://noesis.uis.edu.coEl incremento de las grandes industrias y el aumento en la población, ha generado que el problema de recolección de residuos urbanos sea tratado con mayor importancia y complejidad en los últimos años, pensando siempre en mitigar el impacto ambiental y preservar la salubridad de la comunidad; lo que despierta el interés por indagar el mundo de la investigación de las operaciones, en especial la diversidad de técnicas aplicadas a la optimización de transporte. La empresa Econatural S.A E.S.P presta el servicio de recolección de basuras, se construye un diseño de rutas empleando una herramienta computacional para optimizar el tiempo de ruta del programa de recolección. Se inicia con un previo diagnóstico para conocer las operaciones del proceso de recolección, seguido de la indagación de la revisión de la literatura sobre la problemática abordar y sus posibles soluciones, para seleccionar el modelamiento apropiado según las características de la empresa. El problema se modela como programación lineal entera, bajo la problemática de ruteo de arcos capacitados CARP, en su extensión OCARP, que consiste en un vehículo con capacidad homogénea debe visitar un conjunto de calles al menos una vez, definiendo los puntos de entrada y salida que mejor se ajuste a la ruta minimizando el tiempo de recolección. Para su solución se empleó la herramienta computacional de Excel y su complemento Solver Premium y su algoritmo exacto Branch and Bound, definiendo escenarios de nodos de entrada y salida, teniendo en cuenta parámetros de cercanía a vías para posteriormente realizar las conexiones de ciertos barrios aledaños.PregradoIngeniero IndustrialDesign and implementation of a model for the allocation of waste collection routes in econatural s.a. e.s.papplication/pdfspaUniversidad Industrial de SantanderFacultad de Ingenierías FisicomecánicasIngeniería IndustrialEscuela de Estudios Industriales y EmpresarialesArpCarpOcarp. Branch And BoundThe increase in major industries and the increase in populationhas meant that the problem of urban waste collection be treated with great importance and complexity in the last yearsalways thinking to mitigate the environmental impact and to preserve the health of the community; which arouses the interest in investigating the world of operations researchespecially the diversity of techniques applied to optimize transport. The Econatural S.A E.S.P Company provides the service for garbage collectionand a route design is constructed using a computational tool to optimize the route time of the collection program. It begins with a previous diagnosis to know the operations of the collection processfollowed by the investigation of the review of the literature in addressing the problems and possible solutionsto select the appropriate modeling according to the characteristics of the company. The problem is modeled as an integer linear programming under the Capacitated Arc Routing Problem CARPin its OCARP extensionconsisting of a vehicle with the homogeneous ability to visit a set of streets at least oncedefining the points of entry and exit that best fits the route minimizing the time of collection. For its solution it was used the computational tool Excel and its complement Solver Premium as well its exact Branch and Bound algorithmdefining scenarios of input nodes and outputstaking into account parameters of proximity to roads to subsequently undertake the connections to certain surrounding neighborhoods.Diseño e implementación de un modelo para la asignación de rutas de recolección de basuras en Econatural S.A E.S.PArp, Carp, Ocarp, Branch And BoundTesis/Trabajo de grado - Monografía - Pregradohttp://purl.org/coar/resource_type/c_7a1fhttp://purl.org/coar/version/c_b1a7d7d4d402bcceORIGINALCarta de autorización.pdfapplication/pdf237772https://noesis.uis.edu.co/bitstreams/cabc02fe-e69f-4434-aed5-3f8bb49be470/download9817e6450d80f2422ab7e2843d03b8a4MD51Documento.pdfapplication/pdf24433027https://noesis.uis.edu.co/bitstreams/ff630aea-cd90-4062-a8f9-6fc9da298c7e/download49e55b40e5ecfe3328117a555efb7ba6MD52Nota de proyecto.pdfapplication/pdf206980https://noesis.uis.edu.co/bitstreams/589c13e1-dae2-488b-97d4-08f5b00686cf/download1abcd36130c70570459b4ff6381aef01MD5320.500.14071/34782oai:noesis.uis.edu.co:20.500.14071/347822024-03-03 17:40:50.409http://creativecommons.org/licenses/by-nc/4.0http://creativecommons.org/licenses/by/4.0/open.accesshttps://noesis.uis.edu.coDSpace at UISnoesis@uis.edu.co |