Search

Planning a bus service requires to explore several feasible solutions attempting to optimize travel time, costs or both. The line planning problem (lpp) solves the combinatorial problem to define the routes for bus lines in a bus service under a set of constraints, input parameters and an objective function. The input parameters such as the demand, infrastructure, travel times, etc., describe the current situation, and provide both input data and the constraints that should be considered during the design. An algorithm that obtains feasible and high-quality solutions for lpp is essential in search of better urban services. In this study, a genetic algorithm is designed and coded to solve the lpp. Finally, an evaluation of the results is carried out from different perspectives, attempting to ensure the solutions obtained by the algorithm are consistent and therefore useful in practice. Keywords: Genetic algorithm, line planning problem, bus services ispartof: Maskana vol:8 issue:No. 2477-8893 pages:159-170 status: Published online

La propuesta consiste en el proceso de recibo y transformación de escombros viales asfalticos mediante la implementación de una planta de reciclaje, diseñada y destinada a la trituración, producción y certificación de agregados que deben ser usados en nuevas vías dando cumplimiento a normas legales vigentes que obligan a la reutilización de residuos de demolición.

Este artículo describe la validación n de un algoritmo de flujo óptico basado en esparcidad. Para ello se utilizan dos secuencias de imágenes extraídas de la base de datos Sintel y también imágenes extraídas de una secuencia de imágenes de resonancia magnética etiquetada, las cuales representan una capa el ventrículo izquierdo ubicadas en la zona media y de acuerdo a la orientación de eje corto. Los resultados son prometedores debido a que el error de magnitud promedio para las secuencias de la base de datos Sintel es menor a 3 pixels y menor de 1 mm para las imágenes de resonancia magnética etiquetada. This paper describes the validation of a sparse based optical flow algorithm using two sequences extracted from the Sintel database and also images extracted from a tagged magnetic resonance image sequence representing a short–axis slice located at the mid-wall of the left ventricle. Results are promising as the average magnitude error for the Sintel sequences is lower than 3 pixels and lower than 1 mm for the tagged MRI. Cuenca

The Cellular Automata based method for Minimizing Flow (CAMF) aims at selecting, from a rasterized database representing a river catchment, a predefined number of cells that should be afforested in order to minimize the sediment yield of the catchment. To this end, CAMF iteratively ranks cells according to sediment yield reduction, taking into account spatial interaction among cells. It was found during tests that the execution time of CAMF is directly proportional to the database size and the number of cells to be selected. This behavior can become a limiting factor for the applicability of CAMF to high resolution databases that cover large geographical areas. This issue motivated the necessity of exploring simplified CAMF variants that reduce its execution time and preserve the accuracy of its results. For this purpose, a simplified variant called on-site CAMF was devised, implemented and tested. On-site CAMF ranks cells based only on local cell information, i.e., the local sediment reduction that afforestation would produce in a cell, and the cell slope. During tests, on-site CAMF produced virtually the same results as the original version of CAMF in only a small fraction of the execution time. This means that, for these particular tests, spatial interaction did not influence CAMF output, possibly due to the number of cells that were selected, which was small with respect to the full geodatabase size. It is expected that spatial interaction becomes a relevant factor when larger sets of cells are selected. ispartof: pages:94-100 ispartof: Proceedings of GEOProcessing 2014: The Sixth International Conference on Advanced Geographic Information Systems, Applications, and Services pages:94-100 ispartof: GEOProcessing 2014: The Sixth International Conference on Advanced Geographic Information Systems, Applications, and Services location:Barcelona, Spain date:23 Mar - 27 Mar 2014 status: published

Se propone capaz de localizar cerca de sitios óptimos compuestas por un número determinado de células (estructura de trama) Un método heurístico solución de alto rendimiento. Estos sitios deben ser compactos y maximizar los niveles de la intrínseca sitios múltiples criterios de idoneidad. Para validar el enfoque heurístico, una comparación con una formulación matemática se realiza con los datos de forestación de las regiones dentro de los Bajos-lands, Dinamarca y Flandes. Esto revela que la heurística es considerablemente más rápido que el método matemático y los valores objetivos obtenidos con los dos ap-enfoques son sustancialmente similares. Un análisis de sensibilidad muestra que la homogeneidad de la región juega un papel importante en el rendimiento del proceso de identificación de los sitios más favorables. Por otra parte, el tiempo de cálculo sigue un modelo de alimentación en el número de células que forman el sitio. A high performance heuristic solution method is proposed able to locate near to optimal sites composed by a given number of cells (raster structure). These sites must be compact and maximize levels of the sites intrinsic multiple criteria suitability. To validate the heuristic approach, a comparison with a mathematical formulation is performed with afforestation data of regions within the Netherlands, Denmark, and Flanders. This reveals that the heuristic is considerably faster than the mathematical method and the objective values obtained with the two approaches are substantially similar. A sensitivity analysis shows that the region's homogeneity plays an important role in the performance of the process identifying most favourable sites. Moreover, computation time follows a power model in the number of cells forming the site.