Surveillance Camera Location Models on a Public Transportation Network
This article studies the problem of locating surveillance cameras in the context of a public transportation system. A network of stops or stations is considered which is interconnected by a set of predetermined bus routes. The studied problem is to choose the set of stations to be monitored by camer...
- Autores:
-
Solano-Pinzón, Nathaly
Pinzón-Marroquín, David
Guerrero, William Javier
- Tipo de recurso:
- Fecha de publicación:
- 2017
- Institución:
- Universidad EAFIT
- Repositorio:
- Repositorio EAFIT
- Idioma:
- spa
- OAI Identifier:
- oai:repository.eafit.edu.co:10784/13171
- Acceso en línea:
- http://publicaciones.eafit.edu.co/index.php/ingciencia/article/view/3842
http://hdl.handle.net/10784/13171
- Palabra clave:
- Location
Combinatorial optimization
Security
Graph theory
Networks
Vertex covering problem
Ingeniería
Localización
Optimización combinatoria
Seguridad
Teoría de grafos
Redes
Problema de cubrimiento de vértices
- Rights
- License
- Copyright (c) 2017 Nathaly Solano-Pinzón, David Pinzón-Marroquín, William Javier Guerrero
id |
REPOEAFIT2_1ab9195e5913455beb5639f4d644adff |
---|---|
oai_identifier_str |
oai:repository.eafit.edu.co:10784/13171 |
network_acronym_str |
REPOEAFIT2 |
network_name_str |
Repositorio EAFIT |
repository_id_str |
|
dc.title.eng.fl_str_mv |
Surveillance Camera Location Models on a Public Transportation Network |
dc.title.spa.fl_str_mv |
Modelos de localización de cámaras de vigilancia en una red de transporte público masivo |
title |
Surveillance Camera Location Models on a Public Transportation Network |
spellingShingle |
Surveillance Camera Location Models on a Public Transportation Network Location Combinatorial optimization Security Graph theory Networks Vertex covering problem Ingeniería Localización Optimización combinatoria Seguridad Teoría de grafos Redes Problema de cubrimiento de vértices |
title_short |
Surveillance Camera Location Models on a Public Transportation Network |
title_full |
Surveillance Camera Location Models on a Public Transportation Network |
title_fullStr |
Surveillance Camera Location Models on a Public Transportation Network |
title_full_unstemmed |
Surveillance Camera Location Models on a Public Transportation Network |
title_sort |
Surveillance Camera Location Models on a Public Transportation Network |
dc.creator.fl_str_mv |
Solano-Pinzón, Nathaly Pinzón-Marroquín, David Guerrero, William Javier |
dc.contributor.author.none.fl_str_mv |
Solano-Pinzón, Nathaly Pinzón-Marroquín, David Guerrero, William Javier |
dc.contributor.affiliation.spa.fl_str_mv |
Escuela Colombiana de Ingeniería Julio Garavito |
dc.subject.keyword.eng.fl_str_mv |
Location Combinatorial optimization Security Graph theory Networks Vertex covering problem |
topic |
Location Combinatorial optimization Security Graph theory Networks Vertex covering problem Ingeniería Localización Optimización combinatoria Seguridad Teoría de grafos Redes Problema de cubrimiento de vértices |
dc.subject.keyword.spa.fl_str_mv |
Ingeniería Localización Optimización combinatoria Seguridad Teoría de grafos Redes Problema de cubrimiento de vértices |
description |
This article studies the problem of locating surveillance cameras in the context of a public transportation system. A network of stops or stations is considered which is interconnected by a set of predetermined bus routes. The studied problem is to choose the set of stations to be monitored by cameras in order to simultaneously optimize two objectives: the expected number of crimes detected by the cameras, and the image quality of the entire surveillance system. Two mathematical models based on integer programming are proposed for this problem, considering multiple periods, budget constraints, and connectivity constraints which ensure that at least a surveillance camera is assigned to one station for each pair of directly connected stations. A comparison of the performance of the proposed mathematical models using a commercial optimizer is performed using a set of randomly generated instances with 20-200 stations. The computational results show the capability of the proposed mathematical models to find optimal solutions and the required computational resources. |
publishDate |
2017 |
dc.date.issued.none.fl_str_mv |
2017-04-24 |
dc.date.available.none.fl_str_mv |
2018-11-16T16:28:57Z |
dc.date.accessioned.none.fl_str_mv |
2018-11-16T16:28:57Z |
dc.date.none.fl_str_mv |
2017-04-24 |
dc.type.eng.fl_str_mv |
info:eu-repo/semantics/article info:eu-repo/semantics/publishedVersion article publishedVersion |
dc.type.coarversion.fl_str_mv |
http://purl.org/coar/version/c_970fb48d4fbd8a85 |
dc.type.coar.fl_str_mv |
http://purl.org/coar/resource_type/c_6501 http://purl.org/coar/resource_type/c_2df8fbb1 |
dc.type.local.spa.fl_str_mv |
Artículo |
status_str |
publishedVersion |
dc.identifier.issn.none.fl_str_mv |
2256-4314 1794-9165 |
dc.identifier.uri.none.fl_str_mv |
http://publicaciones.eafit.edu.co/index.php/ingciencia/article/view/3842 http://hdl.handle.net/10784/13171 |
dc.identifier.doi.none.fl_str_mv |
10.17230/ingciencia.13.25.3 |
identifier_str_mv |
2256-4314 1794-9165 10.17230/ingciencia.13.25.3 |
url |
http://publicaciones.eafit.edu.co/index.php/ingciencia/article/view/3842 http://hdl.handle.net/10784/13171 |
dc.language.iso.none.fl_str_mv |
spa |
language |
spa |
dc.relation.isversionof.none.fl_str_mv |
http://publicaciones.eafit.edu.co/index.php/ingciencia/article/view/3842 |
dc.rights.eng.fl_str_mv |
Copyright (c) 2017 Nathaly Solano-Pinzón, David Pinzón-Marroquín, William Javier Guerrero Attribution 4.0 International (CC BY 4.0) |
dc.rights.coar.fl_str_mv |
http://purl.org/coar/access_right/c_abf2 |
dc.rights.uri.none.fl_str_mv |
http://creativecommons.org/licenses/by/4.0 |
dc.rights.local.spa.fl_str_mv |
Acceso abierto |
rights_invalid_str_mv |
Copyright (c) 2017 Nathaly Solano-Pinzón, David Pinzón-Marroquín, William Javier Guerrero Attribution 4.0 International (CC BY 4.0) http://creativecommons.org/licenses/by/4.0 Acceso abierto http://purl.org/coar/access_right/c_abf2 |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.spa.fl_str_mv |
Universidad EAFIT |
dc.source.none.fl_str_mv |
instname:Universidad EAFIT reponame:Repositorio Institucional Universidad EAFIT |
dc.source.eng.fl_str_mv |
Ingeniería y Ciencia; Vol 13 No 25 (2017); 71-93 |
dc.source.spa.fl_str_mv |
Ingeniería y Ciencia; Vol 13 No 25 (2017); 71-93 |
instname_str |
Universidad EAFIT |
institution |
Universidad EAFIT |
reponame_str |
Repositorio Institucional Universidad EAFIT |
collection |
Repositorio Institucional Universidad EAFIT |
bitstream.url.fl_str_mv |
https://repository.eafit.edu.co/bitstreams/eba7e2a3-de0d-400f-b73d-b5bba367d120/download https://repository.eafit.edu.co/bitstreams/31df8274-f863-47c8-a01d-d1119ce90b92/download https://repository.eafit.edu.co/bitstreams/8bf85b06-9f19-46b8-8e21-94a964210036/download |
bitstream.checksum.fl_str_mv |
3a8a93eb785767888c1ae52ba9c8124a 50e2c7d28100c933964efd71488c0e0a da9b21a5c7e00c7f1127cef8e97035e0 |
bitstream.checksumAlgorithm.fl_str_mv |
MD5 MD5 MD5 |
repository.name.fl_str_mv |
Repositorio Institucional Universidad EAFIT |
repository.mail.fl_str_mv |
repositorio@eafit.edu.co |
_version_ |
1814110320882352128 |
spelling |
2017-04-242018-11-16T16:28:57Z2017-04-242018-11-16T16:28:57Z2256-43141794-9165http://publicaciones.eafit.edu.co/index.php/ingciencia/article/view/3842http://hdl.handle.net/10784/1317110.17230/ingciencia.13.25.3This article studies the problem of locating surveillance cameras in the context of a public transportation system. A network of stops or stations is considered which is interconnected by a set of predetermined bus routes. The studied problem is to choose the set of stations to be monitored by cameras in order to simultaneously optimize two objectives: the expected number of crimes detected by the cameras, and the image quality of the entire surveillance system. Two mathematical models based on integer programming are proposed for this problem, considering multiple periods, budget constraints, and connectivity constraints which ensure that at least a surveillance camera is assigned to one station for each pair of directly connected stations. A comparison of the performance of the proposed mathematical models using a commercial optimizer is performed using a set of randomly generated instances with 20-200 stations. The computational results show the capability of the proposed mathematical models to find optimal solutions and the required computational resources. Este artículo estudia el problema de localización de cámaras de vigilancia aplicado a una red de transporte público masivo. Se considera una red de estaciones conectadas entre sí, mediante rutas predeterminadas de buses. El problema estudiado consiste en escoger las estaciones que deben ser vigiladas mediante cámaras con el fin de optimizar simultáneamente dos objetivos: El valor esperado del número de crímenes detectados por las cámaras, y la calidad de las imágenes captadas por el sistema de vigilancia completo. Se formulan dos modelos de optimización basados en programación entera para este problema considerando múltiples períodos, restricciones de presupuesto y restricciones de conectividad donde se busca garantizar que al menos se cuente con una cámara de vigilancia por cada pareja de estaciones conectadas directamente. Se realiza una comparación del desempeño de los modelos matemáticos propuestos usando un optimizador comercial en un conjunto de instancias aleatorio con 20 hasta 200 estaciones. Los resultados computacionales permiten concluir sobre la capacidad de los modelos matemáticos para encontrar soluciones óptimas y los recursos computacionales requeridos. application/pdfspaUniversidad EAFIThttp://publicaciones.eafit.edu.co/index.php/ingciencia/article/view/3842Copyright (c) 2017 Nathaly Solano-Pinzón, David Pinzón-Marroquín, William Javier GuerreroAttribution 4.0 International (CC BY 4.0)http://creativecommons.org/licenses/by/4.0Acceso abiertohttp://purl.org/coar/access_right/c_abf2instname:Universidad EAFITreponame:Repositorio Institucional Universidad EAFITIngeniería y Ciencia; Vol 13 No 25 (2017); 71-93Ingeniería y Ciencia; Vol 13 No 25 (2017); 71-93Surveillance Camera Location Models on a Public Transportation NetworkModelos de localización de cámaras de vigilancia en una red de transporte público masivoinfo:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionarticlepublishedVersionArtículohttp://purl.org/coar/version/c_970fb48d4fbd8a85http://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1LocationCombinatorial optimizationSecurityGraph theoryNetworksVertex covering problemIngenieríaLocalizaciónOptimización combinatoriaSeguridadTeoría de grafosRedesProblema de cubrimiento de vérticesSolano-Pinzón, NathalyPinzón-Marroquín, DavidGuerrero, William JavierEscuela Colombiana de Ingeniería Julio GaravitoIngeniería y Ciencia13257193ing.ciencORIGINAL3.pdf3.pdfTexto completo PDFapplication/pdf560785https://repository.eafit.edu.co/bitstreams/eba7e2a3-de0d-400f-b73d-b5bba367d120/download3a8a93eb785767888c1ae52ba9c8124aMD52articulo.htmlarticulo.htmlTexto completo HTMLtext/html374https://repository.eafit.edu.co/bitstreams/31df8274-f863-47c8-a01d-d1119ce90b92/download50e2c7d28100c933964efd71488c0e0aMD53THUMBNAILminaitura-ig_Mesa de trabajo 1.jpgminaitura-ig_Mesa de trabajo 1.jpgimage/jpeg265796https://repository.eafit.edu.co/bitstreams/8bf85b06-9f19-46b8-8e21-94a964210036/downloadda9b21a5c7e00c7f1127cef8e97035e0MD5110784/13171oai:repository.eafit.edu.co:10784/131712020-03-01 17:41:03.674http://creativecommons.org/licenses/by/4.0Copyright (c) 2017 Nathaly Solano-Pinzón, David Pinzón-Marroquín, William Javier Guerreroopen.accesshttps://repository.eafit.edu.coRepositorio Institucional Universidad EAFITrepositorio@eafit.edu.co |