Hyperheuristics for public transport planning
This article presents an algorithm that establishes stops and routes for buses to extend the existing transport lines. The newly developed algorithm is based on a hyperheuristic approach, whose main feature is its ability to choose and apply the most convenient metaheuristics at the diff er...
- Autores:
- Tipo de recurso:
- Article of journal
- Fecha de publicación:
- 2018
- Institución:
- Universidad Católica de Pereira
- Repositorio:
- Repositorio Institucional - RIBUC
- Idioma:
- spa
- OAI Identifier:
- oai:repositorio.ucp.edu.co:10785/9696
- Acceso en línea:
- https://revistas.ucp.edu.co/index.php/entrecienciaeingenieria/article/view/21
http://hdl.handle.net/10785/9696
- Palabra clave:
- Rights
- openAccess
- License
- https://creativecommons.org/licenses/by-nc/4.0/deed.es_ES
| id |
RepoRIBUC2_db5eec71985356799dbd388b079cfe4b |
|---|---|
| oai_identifier_str |
oai:repositorio.ucp.edu.co:10785/9696 |
| network_acronym_str |
RepoRIBUC2 |
| network_name_str |
Repositorio Institucional - RIBUC |
| repository_id_str |
|
| spelling |
2022-06-01T19:08:15Z2022-06-01T19:08:15Z2018-10-05https://revistas.ucp.edu.co/index.php/entrecienciaeingenieria/article/view/2110.31908/19098367.3709http://hdl.handle.net/10785/9696This article presents an algorithm that establishes stops and routes for buses to extend the existing transport lines. The newly developed algorithm is based on a hyperheuristic approach, whose main feature is its ability to choose and apply the most convenient metaheuristics at the diff erent stages of the search process. Besides, it is shown how computing times are reduced using parallel programming and through a strategy that minimizes the number of evaluations. The case under study arises from an existing need in Bahia Blanca city (Argentina), where the neighbors have asked for more accessibility in the public transport service.Este artículo presenta un algoritmo que establece paradas y rutas de autobuses para extender líneas de transporte existentes. El algoritmo desarrollado se basa en una híperheurística, cuya característica principal es su capacidad para seleccionar y aplicar las metaheurísticas más convenientes en las diferentes etapas del proceso de búsqueda. Además, se muestra cómo se reducen los tiempos computacionales mediante programación paralela y una estrategia para minimizar el número de evaluaciones. El caso de estudio analizado surge de una necesidad existente en la ciudad de Bahía Blanca (Argentina), donde los vecinos han solicitado que el servicio de transporte público sea más accesible.Este artigo apresenta um algoritmo que estabelecem paradas e rotas de ônibus para ampliar as linhas de transporte existentes. O algoritmo desenvolvido baseia-se em uma hiperheurística, cuja principal característica é a sua capacidade de selecionar e aplicar as metaheurísticas mais convenientes nos diferentes estágios do processo de busca. Além disso, mostra como os tempos computacionais são reduzidos pela programação paralela e uma estratégia para minimizar o número de avaliações. O estudo de caso analisado decorre de uma necessidade existente na cidade de Bahía Blanca (Argentina), onde os residentes solicitaram que o serviço de transporte público seja mais acessível.application/pdfapplication/xmlspaUniversidad Católica de Pereirahttps://revistas.ucp.edu.co/index.php/entrecienciaeingenieria/article/view/21/18https://revistas.ucp.edu.co/index.php/entrecienciaeingenieria/article/view/21/1156https://creativecommons.org/licenses/by-nc/4.0/deed.es_ESinfo:eu-repo/semantics/openAccesshttp://purl.org/coar/access_right/c_abf2Entre ciencia e ingeniería; Vol 12 No 23 (2018); 103-108Entre Ciencia e Ingeniería; Vol. 12 Núm. 23 (2018); 103-108Entre ciencia e ingeniería; v. 12 n. 23 (2018); 103-1082539-41691909-8367Hyperheuristics for public transport planningHiperheurística para el planeamiento del transporte públicoHiperheurística para o planejamento do transporte públicoArtículo de revistahttp://purl.org/coar/resource_type/c_6501http://purl.org/coar/resource_type/c_2df8fbb1http://purl.org/coar/version/c_970fb48d4fbd8a85info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionRodríguez, Diego AlejandroOteiza, Paola PatriciaBrignole, Nelida BeatrizPublication10785/9696oai:repositorio.ucp.edu.co:10785/96962025-01-27 18:59:32.056https://creativecommons.org/licenses/by-nc/4.0/deed.es_ESmetadata.onlyhttps://repositorio.ucp.edu.coRepositorio Institucional de la Universidad Católica de Pereira - RIBUCbdigital@metabiblioteca.com |
| dc.title.eng.fl_str_mv |
Hyperheuristics for public transport planning |
| dc.title.spa.fl_str_mv |
Hiperheurística para el planeamiento del transporte público |
| dc.title.por.fl_str_mv |
Hiperheurística para o planejamento do transporte público |
| title |
Hyperheuristics for public transport planning |
| spellingShingle |
Hyperheuristics for public transport planning |
| title_short |
Hyperheuristics for public transport planning |
| title_full |
Hyperheuristics for public transport planning |
| title_fullStr |
Hyperheuristics for public transport planning |
| title_full_unstemmed |
Hyperheuristics for public transport planning |
| title_sort |
Hyperheuristics for public transport planning |
| description |
This article presents an algorithm that establishes stops and routes for buses to extend the existing transport lines. The newly developed algorithm is based on a hyperheuristic approach, whose main feature is its ability to choose and apply the most convenient metaheuristics at the diff erent stages of the search process. Besides, it is shown how computing times are reduced using parallel programming and through a strategy that minimizes the number of evaluations. The case under study arises from an existing need in Bahia Blanca city (Argentina), where the neighbors have asked for more accessibility in the public transport service. |
| publishDate |
2018 |
| dc.date.issued.none.fl_str_mv |
2018-10-05 |
| dc.date.accessioned.none.fl_str_mv |
2022-06-01T19:08:15Z |
| dc.date.available.none.fl_str_mv |
2022-06-01T19:08:15Z |
| dc.type.spa.fl_str_mv |
Artículo de revista |
| dc.type.coar.fl_str_mv |
http://purl.org/coar/resource_type/c_2df8fbb1 |
| dc.type.coar.none.fl_str_mv |
http://purl.org/coar/resource_type/c_6501 |
| dc.type.coarversion.none.fl_str_mv |
http://purl.org/coar/version/c_970fb48d4fbd8a85 |
| dc.type.driver.none.fl_str_mv |
info:eu-repo/semantics/article |
| dc.type.version.none.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
| format |
http://purl.org/coar/resource_type/c_6501 |
| status_str |
publishedVersion |
| dc.identifier.none.fl_str_mv |
https://revistas.ucp.edu.co/index.php/entrecienciaeingenieria/article/view/21 10.31908/19098367.3709 |
| dc.identifier.uri.none.fl_str_mv |
http://hdl.handle.net/10785/9696 |
| url |
https://revistas.ucp.edu.co/index.php/entrecienciaeingenieria/article/view/21 http://hdl.handle.net/10785/9696 |
| identifier_str_mv |
10.31908/19098367.3709 |
| dc.language.none.fl_str_mv |
spa |
| language |
spa |
| dc.relation.none.fl_str_mv |
https://revistas.ucp.edu.co/index.php/entrecienciaeingenieria/article/view/21/18 https://revistas.ucp.edu.co/index.php/entrecienciaeingenieria/article/view/21/1156 |
| dc.rights.uri.spa.fl_str_mv |
https://creativecommons.org/licenses/by-nc/4.0/deed.es_ES |
| dc.rights.accessrights.spa.fl_str_mv |
info:eu-repo/semantics/openAccess |
| dc.rights.coar.spa.fl_str_mv |
http://purl.org/coar/access_right/c_abf2 |
| rights_invalid_str_mv |
https://creativecommons.org/licenses/by-nc/4.0/deed.es_ES http://purl.org/coar/access_right/c_abf2 |
| eu_rights_str_mv |
openAccess |
| dc.format.none.fl_str_mv |
application/pdf application/xml |
| dc.publisher.spa.fl_str_mv |
Universidad Católica de Pereira |
| dc.source.eng.fl_str_mv |
Entre ciencia e ingeniería; Vol 12 No 23 (2018); 103-108 |
| dc.source.spa.fl_str_mv |
Entre Ciencia e Ingeniería; Vol. 12 Núm. 23 (2018); 103-108 |
| dc.source.por.fl_str_mv |
Entre ciencia e ingeniería; v. 12 n. 23 (2018); 103-108 |
| dc.source.none.fl_str_mv |
2539-4169 1909-8367 |
| institution |
Universidad Católica de Pereira |
| repository.name.fl_str_mv |
Repositorio Institucional de la Universidad Católica de Pereira - RIBUC |
| repository.mail.fl_str_mv |
bdigital@metabiblioteca.com |
| _version_ |
1831929513539272704 |