Pasar al contenido principal

SOLUCIONES INTELIGENTES DE CONDUCCION ECOLOGICA PARA LA MOVILIDAD SOSTENIBLE

PID2022-137858OB-I00

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal para Impulsar la Investigación Científico-Técnica y su Transferencia
Subprograma Subprograma Estatal de Generación de Conocimiento
Convocatoria Proyectos de I+D+i (Generación de Conocimiento y Retos Investigación)
Año convocatoria 2022
Plan Estatal 2021-2023 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSIDAD DE CADIZ

Resultados relacionados

Resultados totales (Incluyendo duplicados): 6
Encontrada(s) 1 página(s)

RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Publicación Artículo científico (JournalArticle)

Sustainable waste collection optimization using electric vehicles

  • Peña Morales, David
  • Dorronsoro Díaz, Bernabé
  • Ruiz Villalobos, Patricia
Solid waste management is a crucial municipal service directly influencing urban livability. Optimizing refuse collection routes enhances service efficiency and reduces costs. The recent introduction of fully electric refuse trucks, boasting features like zero emissions, low noise, and lower operating costs compared to diesel trucks, holds promise. However, their limited autonomy presents challenges that need addressing before widespread deployment. This study proposes a realistic formulation for the refuse collection routing problem with electric trucks, introducing electromobility constraints never considered before in related works. The goal is to find optimal routes covering all collection points while minimizing travel distance within vehicle battery and capacity limits. An accurate energy consumption model is presented, accounting for route elevation, vehicle speed, waste collection operations, and regenerative braking. Genetic algorithms are used to find solutions to the problem, as well as the well-known Clarke and Wright heuristic for comparison purposes. The algorithms are tested on six diverse instances reflecting real-world scenarios in New York City (United States) and Puerto Real (Spain). Results indicate the genetic algorithm’s superiority, yielding solutions with reduced travel distance and consumption while requiring fewer routes compared to the state-of-the-art heuristic.
RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Publicación Artículo científico (JournalArticle)

Quantification and comparison of hierarchy in Public Transport Networks

  • Wang, Ziyulong
  • Huang, Ketong
  • Massobrio Lois, Renzo Martín
  • Bombelli, Alessandro
  • Cats, Oded
Network hierarchy describes the relative arrangement of network elements and reflects its fundamental structure. We propose a multi-dimensional topology-based method for quantifying and comparing the extent to which different Public Transport Networks (PTNs) exhibit a hierarchical structure. The proposed method considers the uneven distribution of node importance with different definitions (e.g., degree centrality and betweenness centrality) in a PTN, the clustering of nodes and the node connection patterns. We apply the developed method on 63 high-capacity PTNs worldwide using General Transit Feed Specification (GTFS) data. In addition to global indicators, we use the goodness-of-fit between the probability density function of local indicators and a skew-normal distribution to quantify the extent of PTN hierarchy. Results show that the scale-free network structure and preferential attachment do not vary much across PTNs. In contrast, stop accessibility and traffic intermediacy vary considerably across PTNs as reflected by the closeness centrality and betweenness centrality distributions. Lastly, metro systems exhibit a more hierarchical structure than their tram and Bus Rapid Transit (BRT) counterparts. This work makes a first step towards a better mapping and comparison of different PTNs, which can assist academics and practitioners in better (re)designing and planning the PTNs of the future.
RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Publicación Artículo científico (JournalArticle)

Multi-Signal Multifractal Detrended Fluctuation Analysis for Uncertain Systems —Application to the Energy Consumption of Software Programs in Microcontrollers

  • Torre Macías, Juan Carlos de la
  • Pavón Domínguez, Pablo
  • Dorronsoro Díaz, Bernabé
  • Galindo Riaño, Pedro Luis
  • Ruiz Villalobos, Patricia
Uncertain systems are those wherein some variability is observed, meaning that different observations of the system will produce different measurements. Studying such systems demands the use of statistical methods over multiple measurements, which allows overcoming the uncertainty, based on the premise that a single measurement is not representative of the system’s behavior. In such cases, the current multifractal detrended fluctuation analysis (MFDFA) method cannot offer confident conclusions. This work presents multi-signal MFDFA (MS-MFDFA), a novel methodology for accurately characterizing uncertain systems using the MFDFA algorithm, which enables overcoming the uncertainty of the system by simultaneously considering a large set of signals. As a case study, we consider the problem of characterizing software (Sw) consumption. The difficulty of the problem mainly comes from the complexity of the interactions between Sw and hardware (Hw), as well as from the high uncertainty level of the consumption measurements, which are affected by concurrent Sw services, the Hw, and external factors such as ambient temperature. We apply MS-MFDFA to generate a signature of the Sw consumption profile, regardless of the execution time, the consumption levels, and uncertainty. Multiple consumption signals (or time series) are built from different Sw runs, obtaining a high frequency sampling of the instant input current for each of them while running the Sw. A benchmark of eight Sw programs for analysis is also proposed. Moreover, a fully functional application to automatically perform MS-MFDFA analysis has been made freely available. The results showed that the proposed methodology is a suitable approximation for the multifractal analysis of a large number of time series obtained from uncertain systems. Moreover, analysis of the multifractal properties showed that this approach was able to differentiate between the eight Sw programs studied, showing differences in the temporal scaling range where multifractal behavior is found., This publication was supported by the projects eFracWare [TED2021-131880B-I00] funded by the Spanish MCIN and the European Union “NextGenerationEU”/PRTR on MCIN/AEI/10.13039/501100011033, and the project eMob [PID2022-137858OB-I00] funded by the Spanish MCIN, and the Agency and the European Regional Development on MCIN/AEI/10.13039/501100011033/FEDER, UE. This work was also supported by Junta de Andalucía and ERDF under contract P18-2399 (GENIUS), ERDF [OPTIMALE – FEDER-UCA18-108393], and the Spanish Ministerio de Ciencia, Innovación y Universidades and the ERDF [NEMOVISION PID2019-109465RB-I00]. J.C. de la Torre would like to acknowledge the Spanish Ministerio de Ciencia, Innovación y Universidades for the support through FPU grant [FPU17/00563]. B. Dorronsoro and P. Ruiz acknowledge “ayuda de recualificación” funding by Ministerio de Universidades and the European Union-NextGenerationEU.
RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Publicación Artículo científico (JournalArticle)

GAGI: Game engine for Artificial General Intelligence experimentation

  • Torre Macías, Juan Carlos de la
  • Aragón Jurado, José Miguel
  • Crespo Álvarez, Abdón
  • Barcena González, Guillermo
Video games have been in the focus of the research and academic community for the last few years, with the study and experimentation of Artificial General Intelligence (AGI) standing out. AGI experimentation platforms allow to analyze and study, in a visual way, the behavior of different AI agents previously defined. In this work a novel game engine, called GAGI, capable of serving as an AGI experimentation platform is presented. As a game engine, GAGI is able to design and create novel 2D and 3D video games using C++ programming language. Moreover, GAGI provides the user with a unique environment for simulating and studying AI agents inside the created game. Users can deploy multiple AI agents while interacting with them in real time, improving the understanding of their interactions and behaviors. The features of the proposed software is compared against others widely-used game engines in the video games industry as well as in the research community, highlighting the advantages in terms of design capability and AI support. GAGI also offers the possibility to reproduce the experiments, opening up multiple possibilities for the research community.
RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Publicación Artículo científico (JournalArticle)

Big Data Analysis for Travel Time Characterization in Public Transportation Systems †

  • Nesmachnow, Sergio
  • Massobrio Lois, Renzo Martín
  • Guridi, Santiago
  • Olmedo, Santiago
  • Tchernykh, Andrei
In this article, we introduces a model based on big data analysis to characterize the travel times of buses in public transportation systems. Travel time is a critical factor in evaluating the accessibility of opportunities and the overall quality of service of public transportation systems. The methodology applies data analysis to compute estimations of the travel time of public transportation buses by leveraging both open-source and private information sources. The approach is evaluated for the public transportation system in Montevideo, Uruguay using information about bus stop locations, bus routes, vehicle locations, ticket sales, and timetables. The estimated travel times from the proposed methodology are compared with the scheduled timetables, and relevant indicators are computed based on the findings. The most relevant quantitative results indicate a reasonably good level of punctuality in the public transportation system. Delays were between 10.5% and 13.9% during rush hours and between 8.5% and 13.7% during non-peak hours. Delays were similarly distributed for working days and weekends. In terms of speed, the results show that the average operational speed is close to 18 km/h, with short local lines exhibiting greater variability in their speed.
RODIN. Repositorio de Objetos de Docencia e Investigación de la Universidad de Cádiz
Publicación Artículo científico (JournalArticle)

Source code obfuscation with genetic algorithms using LLVM code optimizations

  • Torre Macías, Juan Carlos de la
  • Jareño Dorado, Javier
  • Aragón Jurado, José Miguel
  • Varrette, Sébastien
  • Dorronsoro Díaz, Bernabé
With the advent of the cloud computing model allowing a shared access to massive computing facilities, a surging demand emerges for the protection of the intellectual property tied to the programs executed on these uncontrolled systems. If novel paradigm as confidential computing aims at protecting the data manipulated during the execution, obfuscating techniques (in particular at the source code level) remain a popular solution to conceal the purpose of a program or its logic without altering its functionality, thus preventing reverse-engineering on the program even with the help of computing resources. The many advantages of code obfuscation, together with its low cost, makes it a popular technique. This paper proposes a novel methodology for source code obfuscation that can be used together with other traditional obfuscation techniques, making the code more robust against reverse engineering attacks. Three program complexity metrics are used to define three different single-objective combinatorial optimization versions of the problem, which are solved and analysed. Additionally, three multi-objective problems are defined, those considering each of the selected metrics together with the program execution time, in order to avoid strong obfuscations penalizing the performance. The goal of the defined problems is to find sequences of LLVM optimizations that lead to highly obfuscated versions of the original code. These transformations are applied to the back-end pseudo-assembly code (i.e., LLVM Intermediate Representation), thus avoiding any further optimizations by the compiler. Classical genetic algorithms (GAs) are used to solve the studied problems, namely a basic cellular GA for the single-objective problems and the popular NSGA-II for the multi-objective ones. The promising results show the potential of the proposed technique.