Pasar al contenido principal

INTELIGENCIA ARTIFICIAL E INTERNET DE LAS COSAS PARA OPTIMIZAR EL CONSUMO ENERGETICO EN EL TRANSPORTE CON VEHICULOS ELECTRICOS

PID2022-138860NB-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 UNIVERSITAT POLITÈCNICA DE VALÈNCIA

Resultados relacionados

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

Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A Sim-Learnheuristic for the Team Orienteering Problem, Applications to Unmanned Aerial Vehicles

  • Peyman, Mohammad|||0000-0003-4734-2414
  • Martin, Xabier A.|||0000-0003-4182-0120
  • Panadero, Javier|||0000-0002-3793-3328
  • Juan, Ángel A.|||0000-0003-1392-1776
In this paper, we introduce a novel sim-learnheuristic method designed to address the team orienteering problem (TOP) with a particular focus on its application in the context of unmanned aerial vehicles (UAVs). Unlike most prior research, which primarily focuses on the deterministic and stochastic versions of the TOP, our approach considers a hybrid scenario, which combines deterministic, stochastic, and dynamic characteristics. The TOP involves visiting a set of customers using a team of vehicles to maximize the total collected reward. However, this hybrid version becomes notably complex due to the presence of uncertain travel times with dynamically changing factors. Some travel times are stochastic, while others are subject to dynamic factors such as weather conditions and traffic congestion. Our novel approach combines a savings-based heuristic algorithm, Monte Carlo simulations, and a multiple regression model. This integration incorporates the stochastic and dynamic nature of travel times, considering various dynamic conditions, and generates high-quality solutions in short computational times for the presented problem.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A Forward-Backward Simheuristic for the Stochastic Capacitated Dispersion Problem

  • Gómez González, Juan Francisco|||0000-0001-7692-9922
  • Martínez-Gavara, Anna|||0000-0001-9995-010X
  • Panadero, Javier|||0000-0002-3793-3328
  • Juan, Ángel A|||0000-0003-1392-1776
  • Martí, Rafael|||0000-0001-7265-823X
In an effort to balance the distribution of services across a given territory, dispersion and diversity models typically aim to maximize the minimum distance between any pair of facilities. Specifically, in the capacitated dispersion problem (CDP), each facility has an associated capacity or level of service, and the objective is to select a set of facilities so that the minimum distance between any pair of them (dispersion) is maximized, while ensuring a user-defined level of service. This problem can be formulated as a linear integer model, where the sum of the capacities of the selected facilities must match or exceed the total demand in the network. Real-life applications often necessitate considering the levels of uncertainty affecting the capacity of the nodes. Failure to account for this uncertainty could lead to low-quality or infeasible solutions in practical scenarios. However, research addressing the stochastic version of the CDP is scarce. This paper introduces two models for the CDP with stochastic capacities, incorporating soft constraints and penalty costs for violating the total capacity constraint. The first model includes a probabilistic constraint to ensure the required level of service with a certain probability, while the second model introduces a soft constraint with penalty costs for violations. To solve both variants of the model, a forward-backward simheuristic algorithm is proposed. Our approach combines a metaheuristic algorithm with Monte Carlo simulation, enabling the efficient handling of the random behavior of node capacities and obtaining reliable solutions regardless of their probability distribution.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A Learnheuristic Algorithm Based on Thompson Sampling for the Heterogeneous and Dynamic Team Orienteering Problem

  • Rodríguez Uguina, Antonio|||0009-0001-5506-1674
  • Gómez González, Juan Francisco|||0000-0001-7692-9922
  • Panadero, Javier|||0000-0002-3793-3328
  • Martínez-Gavara, Anna|||0000-0001-9995-010X
  • Juan, Ángel A|||0000-0003-1392-1776
The team orienteering problem (TOP) is a well-studied optimization challenge in the field of Operations Research, where multiple vehicles aim to maximize the total collected rewards within a given time limit by visiting a subset of nodes in a network. With the goal of including dynamic and uncertain conditions inherent in real-world transportation scenarios, we introduce a novel dynamic variant of the TOP that considers real-time changes in environmental conditions affecting reward acquisition at each node. Specifically, we model the dynamic nature of environmental factors-such as traffic congestion, weather conditions, and battery level of each vehicle-to reflect their impact on the probability of obtaining the reward when visiting each type of node in a heterogeneous network. To address this problem, a learnheuristic optimization framework is proposed. It combines a metaheuristic algorithm with Thompson sampling to make informed decisions in dynamic environments. Furthermore, we conduct empirical experiments to assess the impact of varying reward probabilities on resource allocation and route planning within the context of this dynamic TOP, where nodes might offer a different reward behavior depending upon the environmental conditions. Our numerical results indicate that the proposed learnheuristic algorithm outperforms static approaches, achieving up to 25% better performance in highly dynamic scenarios. Our findings highlight the effectiveness of our approach in adapting to dynamic conditions and optimizing decision-making processes in transportation systems.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

An Agile Adaptive Biased-Randomized Discrete-Event Heuristic for the Resource-Constrained Project Scheduling Problem

  • Martin, Xabier A.|||0000-0003-4182-0120
  • Herrero, Rosa|||0000-0003-3575-0963
  • Juan, Ángel A|||0000-0003-1392-1776
  • Panadero, Javier|||0000-0002-3793-3328
In industries such as aircraft or train manufacturing, large-scale manufacturing companies often manage several complex projects. Each of these projects includes multiple tasks that share a set of limited resources. Typically, these tasks are also subject to time dependencies among them. One frequent goal in these scenarios is to minimize the makespan, or total time required to complete all the tasks within the entire project. Decisions revolve around scheduling these tasks, determining the sequence in which they are processed, and allocating shared resources to optimize efficiency while respecting the time dependencies among tasks. This problem is known in the scientific literature as the Resource-Constrained Project Scheduling Problem (RCPSP). Being an NP-hard problem with time dependencies and resource constraints, several optimization algorithms have already been proposed to tackle the RCPSP. In this paper, a novel discrete-event heuristic is introduced and later extended into an agile biased-randomized algorithm complemented with an adaptive capability to tune the parameters of the algorithm. The results underscore the effectiveness of the algorithm in finding competitive solutions for this problem within short computing times.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A discrete-event simheuristic for enhancing urban mobility

  • Peyman, Mohammad|||0000-0003-4734-2414
  • Martin, Xabier A.|||0000-0003-4182-0120
  • Panadero, Javier|||0000-0002-3793-3328
  • Juan, Ángel A|||0000-0003-1392-1776
This paper addresses a rich variant of the team orienteering problem under uncertainty to improve urban mobility. Specifically, we conduct a case study using real-world data from urban transportation hubs in Barcelona, gathered from Open Data Barcelona. The study involves routing autonomous delivery drones operating within a university campus to deliver items to designated drop-off points. Traditional optimization techniques often fail to account for the stochastic fluctuations inherent in urban traffic and the complex interactions between various transportation activities. To address these challenges, this research employs a simheuristic framework that combines heuristic optimization with commercial simulation software to replicate the dynamic and uncertain nature of urban environments accurately. The efficiency and practical applicability of our simheuristic framework are demonstrated through comprehensive computational experiments in a real-world context.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A Biased-Randomized Iterated Local Search with Round-Robin for the Periodic Vehicle Routing Problem

  • Gómez González, Juan Francisco|||0000-0001-7692-9922
  • Rodríguez Uguina, Antonio
  • Panadero, Javier|||0000-0002-3793-3328
  • Juan, Ángel A.|||0000-0003-1392-1776
The periodic vehicle routing problem (PVRP) is a well-known challenge in real-life logistics, requiring the planning of vehicle routes over multiple days while enforcing visitation frequency constraints. Although numerous metaheuristic and exact methods have tackled various PVRP extensions, real-world settings call for additional features such as depot configurations, tight visitation frequency constraints, and heterogeneous fleets. In this paper, we present a two-phase biased-randomized algorithm that addresses these complexities. In the first phase, a round-robin assignment quickly generates feasible and promising solutions, ensuring each customer's frequency requirement is met across the multi-day horizon. The second phase refines these assignments via an iterative search procedure, improving route efficiency and reducing total operational costs. Extensive experimentation on standard PVRP benchmarks shows that our approach is able to generate solutions of comparable quality to established state-of-the-art algorithms in relatively low computational times and stands out in many instances, making it a practical choice for real life multi-day vehicle routing applications.
Dipòsit Digital de Documents de la UAB
Publicación Artículo de revisión (ReviewArticle)

Strategic Decision-Making in SMEs, A Review of Heuristics and Machine Learning for Multi-Objective Optimization

  • Molina-Abril, Gines|||0000-0001-7877-0812
  • Calvet, Laura|||0000-0001-8425-1381
  • Juan, Ángel A.|||0000-0003-1392-1776
  • Riera Terrén, Daniel|||0000-0002-4718-7234
Small- and medium-sized enterprises (SMEs) face dynamic and competitive environments where resilience and data-driven decision-making are critical. Despite the potential benefits of artificial intelligence (AI), machine learning (ML), and optimization techniques, SMEs often struggle to adopt these tools due to high costs, limited training, and restricted hardware access. This study reviews how SMEs can employ heuristics, metaheuristics, ML, and hybrid approaches to support strategic decisions under uncertainty and resource constraints. Using bibliometric mapping with UMAP and BERTopic, 82 key works are identified and clustered into 11 thematic areas. From this, the study develops a practical framework for implementing and evaluating optimization strategies tailored to SMEs' limitations. The results highlight critical application areas, adoption barriers, and success factors, showing that heuristics and hybrid methods are especially effective for multi-objective optimization with lower computational demands. The study also outlines research gaps and proposes future directions to foster digital transformation in SMEs. Unlike prior reviews focused on specific industries or methods, this work offers a cross-sectoral perspective, emphasizing how these technologies can strengthen SME resilience and strategic planning.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Combining the A* Algorithm with Neural Networks to Solve the Team Orienteering Problem with Obstacles and Environmental Factors

  • Freixes, Alfons|||0000-0002-1675-358X
  • Panadero, Javier|||0000-0002-3793-3328
  • Juan, Ángel A.|||0000-0003-1392-1776
  • Serrat, Carles|||0000-0002-1504-5354
This paper addresses the team orienteering problem applied to unmanned aerial vehicles (UAVs), considering obstacle avoidance and environmental factors such as wind conditions and payload weight. The objective is to optimize UAV routes to maximize collected rewards while adhering to operational constraints. To achieve this, we employ a simheuristic algorithm for the overall route optimization, while integrating the A* algorithm to determine feasible paths between nodes that avoid obstacles in a 2D grid-based environment. Then, a feedforward neural network estimates travel time based on UAV speed, wind conditions, trajectory distance, and payload weight. This estimation is incorporated into the optimization process to improve route planning accuracy. Numerical experiments evaluate the impact of various parameters, including obstacle placement, UAV speed, wind conditions, and payload weight. These experiments include maps with 30 to 100 points of interest and varying obstacle densities and show that our hybrid method improves solution quality by up to (Formula presented.) in total profit compared to a baseline approach. Furthermore, computation times remain within 5-10% of the baseline, showing that the added predictive layer maintains computational efficiency.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A Biased-Randomized Algorithm for the Bi-Objective Capacitated Dispersion Problem with Symmetries

  • Gómez, Juan F.
  • Calvet, Laura
  • Ammouriova, Majsa
  • Wenwen, Chen
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] Given a network of nodes and a certain demand that needs to be satisfied, the capacitated dispersion problem (CDP) involves selecting a subset of nodes to maximize dispersion between them. In many practical instances, symmetry in the structure of the selected nodes (e.g., using nodes of the same type) can lead to synergies. Hence, this paper studies a bi-objective variant of the CDP to account for these symmetries. The first goal seeks to maximize the minimum distance between opened nodes, while the second goal accounts for symmetry by penalizing the use of nodes of different types (in our case, represented by different colors). We formalize the problem as a bi-objective mathematical program and address it through a classical multiobjective strategy, the & varepsilon;-constraint method. Exact methods are used when the problem size allows, even though the problem is NP-hard. To tackle larger instances, we design a biased-randomized algorithm based on a constructive heuristic. Computational experiments show that our biased-randomized algorithm provides high-quality approximations of the Pareto frontier., This work has been partially supported by the Spanish Ministry of Science, Innovation and Universities/AEI (PID2022-138860NB-I00, AIA2025-163553-C44) and the Generalitat Valenciana (2024 CIAICO 117).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A biased-randomised iterated local search for the team orienteering arc routing problem allowing different origin and destination

  • Martín, Xabier A.
  • Keenan, Peter
  • Panadero, Javier
  • McGarraghy, Sean
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] In this paper, we consider the hybridisation of the team orienteering problem and the arc routing problem, the so-called team orienteering arc routing problem (TOARP). This problem has recently raised interest among researchers and practitioners as it can model new routing problems involving unmanned aerial vehicles or other types of electric vehicles. In the TOARP, a fixed fleet of vehicles, initially located at a depot, has to collect as much reward as possible from visiting a set of arcs, while they must visit a set of required arcs. At the same time, they must return to the depot on or before a given deadline (which can be time-based or distance-based). In this paper, we explore an extension of the TOARP in which the origin depot and the destination depot may be different nodes in a network. To solve this version of the problem, we propose a novel biased-randomised iterated local search algorithm. Computational results show the capability, efficiency and robustness of our approach, which provides competitive solutions to the TOARP in short computing times and outperforms some of the best-known solution approaches in the literature., This work has been partially supported by the Spanish Ministry of Science (PID2022-138860NB-I00, RED2022-134703-T) and the Horizon Europe program (SUN HORIZON-CL4-2022-HUMAN-01-14-101092612). In addition, we would like to acknowledge the support provided by the Michael Smurfit Graduate Business School at University College Dublin.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Battery Management in Electric Vehicle Routing Problems: A Review

  • Martín, Xabier A.
  • Guerrero, Antoni
  • Escoto-Gomar, Marc
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] The adoption of electric vehicles (EVs) has gained significant momentum in recent years as a sustainable alternative to traditional internal combustion engine vehicles. However, the efficient utilization of batteries in EVs, coupled with the growing demand for sustainable transportation, has posed complex challenges for battery management in the context of electric vehicle routing problems in a broad sense, which includes vehicle routing problems, team orienteering problems, and arc routing problems, all of them using EVs. This paper presents a comprehensive review of the state-of-the-art approaches, methodologies, and strategies for battery management in each of the aforementioned optimization problems. We explore the relevant factors influencing battery performance and the interplay between routing, charging, and energy management in the context of EVs. The paper also discusses the advances in optimization algorithms, vehicle-to-grid integration, and intelligent decision-making techniques aimed at enhancing the range, reliability, and sustainability of EV operations. Key findings indicate a paradigm shift towards addressing uncertainties, dynamic conditions, and synchronization challenges inherent in large-scale and dynamic routing problems within the context of EVs that require efficient battery management., This work has been partially funded by the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00, RED2022-134703-T) as well as by the Generalitat Valenciana (PROMETEO/2021/065).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Enhancing Accessibility to Analytics Courses in Higher Education through AI, Simulation, and e-Collaborative Tools

  • Osorio-Muñoz, Celia|||0009-0000-5357-7063
  • Fuster-Coma, Noelia|||0009-0008-7856-3985
  • Wenwen, Chen
  • Yangchongyi, Men
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] This paper explores how the combination of artificial intelligence, simulation, and e-collaborative (AISEC) tools can support accessibility in analytics courses within higher education. In the era of online and blended learning, addressing the diverse needs of students with varying linguistic backgrounds and analytical proficiencies poses a significant challenge. This paper discusses how the combination of AISEC tools can contribute to mitigating barriers to accessibility for students undertaking analytics courses. Through a comprehensive review of existing literature and empirical insights from practical implementations, this paper shows the synergistic benefits of using AISEC tools for facilitating interactive engagement in analytics courses. Furthermore, the manuscript outlines practical strategies and best practices derived from real-world experiences carried out in different universities in Spain, Ireland, and Portugal., This work was founded by the Investigo Program of the Generalitat Valenciana (INVEST/2023/304), Coca-Cola Europacific Partners, and the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00 and RED2022-134703-T).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

An Agile Adaptive Biased-Randomized Discrete-Event Heuristic for the Resource-Constrained Project Scheduling Problem

  • Martín, Xabier A.
  • Herrero, Rosa
  • Panadero, Javier
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] In industries such as aircraft or train manufacturing, large-scale manufacturing companies often manage several complex projects. Each of these projects includes multiple tasks that share a set of limited resources. Typically, these tasks are also subject to time dependencies among them. One frequent goal in these scenarios is to minimize the makespan, or total time required to complete all the tasks within the entire project. Decisions revolve around scheduling these tasks, determining the sequence in which they are processed, and allocating shared resources to optimize efficiency while respecting the time dependencies among tasks. This problem is known in the scientific literature as the Resource-Constrained Project Scheduling Problem (RCPSP). Being an NP-hard problem with time dependencies and resource constraints, several optimization algorithms have already been proposed to tackle the RCPSP. In this paper, a novel discrete-event heuristic is introduced and later extended into an agile biased-randomized algorithm complemented with an adaptive capability to tune the parameters of the algorithm. The results underscore the effectiveness of the algorithm in finding competitive solutions for this problem within short computing times., This work has been partially funded by the Horizon Europe program (HORIZON-CL4-2022-HUMAN-01-14-101092612 SUN and HORIZON-CL4-2021-TWIN-TRANSITION-01-07-101057294 AIDEAS), as well as by the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00, RED2022-134703-T).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Combining Heuristics, Simulation, and Machine Learning for Solving Routing Problems

  • Peyman, Mohammad
  • Martín, Xabier A.
  • Panadero, Javier
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] In this work, we present a sim-learnheuristic approach to solving the Multi-Source Team Orienteering Problem (MS-TOP) under stochastic and dynamic conditions. By combining deterministic, stochastic, and dynamic components, our methodology is able to efficiently address this complex variant of the MS-TOP. Specifically, we conduct a case study using real-world data from electric bicycle stations in Barcelona, gathered from Open Data Barcelona. The study involves efficiently distributing bicycles to various stations starting from different hubs, and finishing at a central depot. This task becomes significantly more complex with the inclusion of stochastic travel times and dynamically changing factors such as weather or traffic congestion. Our approach is able to find high-quality solutions in short computational times by combining heuristic algorithms, simulation, and machine learning components. The case study demonstrates the practical applicability and effectiveness of our method in a real-world context., This work was partially funded by the Spanish Ministry of Science and Innovation (PRE2020-091842, PID2022-138860NB-I00, RED2022-134703-T).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A Matheuristic Approach for the Bi-Objective and Multi-Source Team Orienteering Problem with Prioritized Nodes

  • Oltra Crespo, Sandra|||0000-0003-1995-2557
  • Agud Albesa, Lucia|||0000-0002-1222-7988
  • Garrido-Saez, Neus|||0000-0002-7903-8591
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] This work proposes a matheuristic approach that combines heuristic techniques with mathematical optimization to address a bi-objective, multi-source team orienteering problem. During the exploration phase, nodes are assigned to depots using a biased-randomized round-robin heuristic, guided by a ranking criterion based on marginal distances. This step aims to generate diverse mappings and identify those that lead to promising solutions under a convex combination of the two objectives: total reward and number of priority nodes visited. In the exploitation phase, an intensive search is applied to a subset of elite mappings, further improving the quality of the solutions. The method produces a Pareto frontier, offering a range of trade-offs between the two objectives. Computational experiments on adapted benchmark instances confirm the method¿s ability to generate high-quality or near-optimal solutions, often outperforming exact methods under realistic time constraints., This work has been partially supported by the Spanish Ministry of Science, Innovation and Universities MICIU/AEI/10.13039/501100011033 (PID2025-169830NB-I00, AIA2025-163553-C44, PID2022-138860NB-I00), the Generalitat Valenciana (2024 CIAICO 117) and the Universitat Politècnica de València (PAID-06-25).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Strategic Route Planning: An Adaptive BR-Heuristic for Multi-depot Logistics

  • Escoto-Gomar, Marc
  • Medina-Rodriguez, Veronica
  • Guerrero, Antoni
[EN] The multiple traveling salesman problem (mTSP) is an extension of the well-known traveling salesman problem (TSP), requiring multiple agents to visit a set of nodes and return to their respective depot. This problem finds wide-ranging applications in robotics, transportation and networking, among other domains. Moreover, it can be readily extended to a vehicle routing problem (VRP) by introducing extra constraints. This article presents a hybrid method for addressing the multi-depot closed path mTSP by integrating a bias-randomized heuristic with iterative local search (ILS). Furthermore, this algorithm is enhanced with a self-tuning mechanism, eliminating the need for timeconsuming fine-tuning processes. The results provided by this algorithm with a different number of depots are analyzed., This work has been partially supported by the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00 and RED2022-134703-T).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Towards greener city logistics: an application of agile routing algorithms to optimize the distribution of micro-hubs in Barcelona

  • C. Castillo
  • Alvarez-Palau, E.J.
  • Panadero, J.
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] The COVID-19 pandemic accelerated the shift towards online shopping, reshaping consumer habits and intensifying the impact on urban freight distribution. This disruption exacerbated traffic congestion and parking shortages in cities, underscoring the need for sustainable distribution models. The European Union's common transport policy advocates for innovative UFD approaches that promote intermodal transportation, reduce traffic, and optimize cargo loads. Our study addresses these challenges by proposing an agile routing algorithm for an alternative UFD model in Barcelona. This model suggests strategically located micro-hubs selected from a set of railway facilities, markets, shopping centers, district buildings, pickup points, post offices, and parking lots (1057 points in total). It also promotes intermodality through cargo bikes and electric vans. The study has two main objectives: (i) to identify a network of intermodal micro-hubs for the efficient delivery of parcels in Barcelona and (ii) to develop an agile routing algorithm to optimize their location. The algorithm generates adaptive distribution plans considering micro-hub operating costs and vehicle routing costs, and using heuristic and machine learning methods enhanced by parallelization techniques. It swiftly produces high-quality routing plans based on transportation infrastructure, transportation modes, and delivery locations. The algorithm adapts dynamically and employs multi-objective techniques to establish the Pareto frontier for each plan. Real-world testing in Barcelona, using actual data has shown promising results, providing potential scenarios to reduce CO2 emissions and improve delivery times. As such, this research offers an innovative and sustainable approach to UFD, that will contribute significantly to a greener future for cities., This research was supported by the European Commission (No. 101069782), the Spanish Ministry of Science and Innovation (PID2019-111100RB-C21/ AEI/10.13039/501100011033) and (PID2022-138860NB-I00 and RED2022134703-T), and the Barcelona City Council (22S02264-001).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Promoting Energy Efficiency and Emissions Reduction in Urban Areas with Key Performance Indicators and Data Analytics

  • Juan, Angel A.|||0000-0003-1392-1776
  • Osorio-Muñoz, Celia|||0009-0000-5357-7063
  • Fuster-Coma, Noelia|||0009-0008-7856-3985
  • Ammouriova, Majsa
  • Tsertsvadze, Verónika
  • Ahsini, Yusef
[EN] With the increasing demand for sustainable urban development, smart cities have emerged as a promising solution for optimizing energy usage, reducing emissions, and enhancing the quality of life for citizens. In this context, the combined use of key performance indicators (KPIs) and data analytics has gained significant attention as a powerful tool for promoting energy efficiency and emissions reduction in urban areas. This paper presents a comprehensive conceptual framework in which a series of KPIs are proposed to serve as essential metrics for guiding, monitoring, and assessing energy efficiency and emissions reduction levels in smart cities. Some of the included KPIs in the analysis are 'annual energy consumption per person', 'reduction in greenhouse gas emissions', 'public transport use', and 'adoption of renewable energy'. By incorporating these KPIs, city planners and policymakers can gain valuable insights into the effectiveness of sustainability initiatives. Furthermore, the paper explores how the integration of KPIs with data analytics can be used for monitoring and assessing the overall performance of the city in terms of energy efficiency, emissions reduction, and the enhancement of urban living conditions. Visualization tools, such as radar plots, and time series analysis forecasting methods allow data to be processed and patterns to be identified, enabling informed decision-making and efficient resource allocation. Real-life case studies of ongoing smart city projects are presented in the paper, which also provides a KPI comparison among different European cities, as well as models to forecast the evolution of KPIs related to energy usage and emissions reduction in different European cities., This work has been partially funded by the European Commission (UP2030, HORIZONMISS-2021-CIT-02-01-101096405), and the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00 and RED2022-134703-T).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Stochastic capacitated dispersion problems in disaster preparedness for mass casualty incident

  • Onggo, B. Stephan
  • Martín-Solano, Xabier Andoni
  • Corlu, Canan G.
  • Panadero, Javier
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] Recent disasters that cause mass casualty incidents -such as the 2020 Beirut explosion or the 2023 Turkey-Syria earthquake- have shown that critical facilities, which are meant to help the casualties, could be damaged by them. Therefore, it is critical to increase the resiliency of critical facilities by dispersing their locations. This paper proposes a stochastic capacitated dispersion model that considers a scenario in which a disaster can cause mass casualty incidents and damage critical facilities. The extent of damage is modeled as a function of the distance between the site locations of the facility and the epicenter of the disaster, as well as the level of severity of the disaster. The model incorporates a chance constraint to account for supply uncertainty. To solve this stochastic optimisation problem, we propose a new simheuristic algorithm that combines simulation and heuristic optimisation. Experiments show that our algorithm produces solutions that match the quality of the best deterministic solutions reported in the literature. In the stochastic disaster scenario, our algorithm produces solutions that can meet demand 90% of the time, while deterministic solutions fail to meet this demand., This work has been partially funded by the Spanish Ministry of Science (RED2022-134703-T, PID2022-138860NB-I00), Guy Carpenter & Company LLC., and the University of Southampton's Interdisciplinary Pump Priming Grant 2022.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

AnomalousNet: a hybrid approach with attention U-Nets and change point detection for accurate characterization of anomalous diffusion in video data

  • Ahsini, Yusef
  • Escoto-Gomar, Marc
  • Conejero, J. Alberto|||0000-0003-3681-7533
[EN] Anomalous diffusion is ubiquitous in systems ranging from intracellular transport and porous-medium flow to animal foraging, and its quantification requires robust methods that cope with short and noisy trajectories. We present AnomalousNet, a unified three-stage pipeline for analyzing anomalous particle dynamics. First, up to 64 particles per 128x128 field of view are tracked using the Crocker-Grier algorithm via Trackpy. Next, an Attention U-Net trained on over 8.6 x 104 simulated experiments infers frame-wise anomalous exponents alpha, generalized diffusion coefficients K, and discrete motion states. Finally, regime changes are identified using an L2-regularized, windowed pruned exact linear time change-point detection algorithm. On the 2nd Anomalous Diffusion Challenge benchmark the method achieved MAE(alpha)=0.32, MSLE(K)=0.10, state-classification F1=0.93, and change-point RMSE = 0.09, ranking second in the video single-trajectory task and ensemble task. These results demonstrate precise discrimination of subdiffusive, normal, and superdiffusive regimes, and frame-level identification of state transitions establishing AnomalousNet as a powerful tool for quantitative analysis of heterogeneous diffusion in video data., J.A.C. is supported by the European Union-NextGenerationEU, ANDHI Project CPP2021-008994 and PID2021-124618NB-C21, by MCIN/AEI/10.13039/501100011033 and by 'ERDF Away of making Europe', from the European Union. M.E. is supported by the Spanish Ministry of Science-AEI (PID2022-138860NB-I00). We also thank Funding for open access charge: CRUE-Universitat Politecnica de Valencia.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

An agile optimisation algorithm for the multi-source team orienteering problem

  • Neroni, M.
  • Panadero, J.
  • Ghorbani, E.
  • Ammouriova, M.
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] In the team orienteering problem (TOP), a fixed fleet of vehicles have to collect rewards by visiting customers. Typically, all vehicles depart from a source depot and end in a sink depot. Also, each vehicle has a limited driving range, so not all customers can be visited. The goal is then to select the set of customers to be visited, and the corresponding routes to do it, such in a way that the total reward collected is maximised while respecting the aforementioned constraints. This paper explores a TOP variant with multiple source depots and where real-time solutions need to be provided, i.e., computation times need to be in the order of milliseconds even for mid-sized instances with hundreds of customers. To deal with this challenge, and taking into account that the problem is NP-hard, we propose an 'agile' optimisation algorithm that is based on a biased-randomised heuristic. Our approach can be applied in realistic and dynamic scenarios where vehicles need to recompute their routes in real-time, as vehicles are in-route, new customers appear, and some existing customers are not available anymore., This work has been funded by PID2022-138860NB-I00, RED2022-134703-T, 2019-1-ES01-KA103-062602 and PROMETEO/2021/065.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Optimizing Maintenance of Energy Supply Systems in City Logistics with Heuristics and Reinforcement Learning

  • Guerrero, Antoni
  • Garcia-Sanchez, Alvaro
  • Pita-Romero, Luis
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] In urban logistics, effective maintenance is crucial for maintaining the reliability and efficiency of energy supply systems, impacting both asset performance and operational stability. This paper addresses the scheduling and routing plans for maintenance of power generation assets over a multi-period horizon. We model this problem as a multi-period team orienteering problem. To address this multi-period challenge, we propose a dual approach: a novel reinforcement learning (RL) framework and a biased-randomized heuristic algorithm. The RL-based method dynamically learns from real-time operational data and evolving asset conditions, adapting to changes in asset health and failure probabilities to optimize decision making. In addition, we develop and apply a biased-randomized heuristic algorithm designed to provide effective solutions within practical computational limits. Our approach is validated through a series of computational experiments comparing the RL model and the heuristic algorithm. The results demonstrate that, when properly trained, the RL-based model is able to offer equivalent or even superior performance compared to the heuristic algorithm., The present work was carried out as part of the IA4TES project "Artificial Intelligence for Sustainable Energy Transition". The project belongs to the "Misiones de I+D en Inteligencia Artificial 2021" program funded by the Spanish Government through the "Plan de Recuperacion". This research has also been partially funded by the Spanish Ministry of Science (PID2022-138860NB-I00 and RED2022-134703-T).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A sim-learnheuristic algorithm for the stochastic and context-aware team orienteering problem

  • Tobar-Fernandez, C.
  • Perez-Pelo, S.
  • Lopez-Sanchez, A. d.
  • Sanchez-Oro, J.
  • Juan, A. A.
[EN] This paper addresses the Team Orienteering Problem (TOP) with stochastic, context-aware travel times. Traditionally, simheuristics have been used to address stochastic variants of TOP and related routing problems. Simheuristics combine metaheuristics and simulation to deal with stochastic inputs, but they often rely on generic, independent random sampling which ignores that travel times in real traffic networks are dynamic and depend on contextual factors, such as congestion or weather conditions. We propose to extend the traditional simheuristic concept by integrating a machine learning component to overcome this limitation. To apply this novel methodology, models are trained on historical data to predict context-aware travel times. In addition, this historical data and clustering models are used to generate context-aware probability distributions. These customized distributions provide the simulation step with more realistic inputs, ensuring that the evaluation of candidate solutions reflects actual dynamic conditions. We compare a deterministic metaheuristic, a standard simheuristic approach, and the proposed sim-learnheuristic approach on extended benchmark instances. Computational experiments show that the sim-learnheuristic consistently outperforms both the traditional simheuristic and the deterministic metaheuristic, achieving average improvements of approximately 18% and 30%, respectively, under stochastic-dynamic evaluation., This work has been partially supported by the Spanish Ministry of Science, Innovation and Universities/AEI (PID2025-169830NB-I00, PID2022-138860NB-I00, AIA2025-163553-C44) and the Generalitat Valenciana (2024 CIAICO 117), by Comunidad Autonoma de Madrid (grant ref. TEC-2024/COM-404), Ministerio de Economia y Competitividad (grant ref. PID2024-160226OB-C22), and Ministerio para la Transformacion Digital y de la Funcion Publica (Catedra ENIA AI4DDS, grant ref. TSI-100930-2023-3). Funding was also received from the "Agencia Estatal de Investigacion" through the "Ayudas para contratos para la formacion de doctores y doctoras en empresas y otras entidades (Doctorados Industriales) 2024" (grant ref. DIN2024-013339), through the company OGA (qosITconsulting, S.L).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Applying Machine Learning in Marketing: An Analysis Using the NMF and k-Means Algorithms

  • Gallego Hidalgo, Víctor
  • Lingan, Jessica
  • Freixes, Alfons
  • Juan, Angel A.|||0000-0003-1392-1776
  • Osorio-Muñoz, Celia|||0009-0000-5357-7063
[EN] The integration of machine learning (ML) techniques into marketing strategies has become increasingly relevant in modern business. Utilizing scientific manuscripts indexed in the Scopus database, this article explores how this integration is being carried out. Initially, a focused search is undertaken for academic articles containing both the terms "machine learning" and "marketing" in their titles, which yields a pool of papers. These papers have been processed using the Supabase platform. The process has included steps like text refinement and feature extraction. In addition, our study uses two key ML methodologies: topic modeling through NMF and a comparative analysis utilizing the k-means clustering algorithm. Through this analysis, three distinct clusters emerged, thus clarifying how ML techniques are influencing marketing strategies, from enhancing customer segmentation practices to optimizing the effectiveness of advertising campaigns., This work was founded by the Investigo Program of the Generalitat Valenciana (INVEST/2023/304), Coca-Cola Europacific Partners, and the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00 and RED2022-134703-T).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

The Electric Vehicle Traveling Salesman Problem on Digital Elevation Models for Traffic-Aware Urban Logistics

  • Ahsini, Yusef
  • Díaz-Masa, Pablo
  • Inglés, Belén
  • Rubio, Ana
  • Martínez, Alba
  • Magraner, Aina
  • Conejero, J. Alberto|||0000-0003-3681-7533
[EN] With the increasing demand for online shopping and home delivery services, optimizing the routing of electric delivery vehicles in urban areas is crucial to reduce environmental pollution and improve operational efficiency. To address this opportunity, we optimize the Steiner Traveling Salesman Problem (STSP) for electric vehicles (EVs) in urban areas by combining city graphs with topographic and traffic information. The STSP is a variant of the traditional Traveling Salesman Problem (TSP) where it is not mandatory to visit all the nodes present in the graph. We train an artificial neural network (ANN) model to estimate electric consumption between nodes in the route using synthetic data generated with historical traffic simulation and topographical data. This allows us to generate smaller-weighted graphs that transform the problem from an STSP to a normal TSP where the 2-opt optimization algorithm is used to solve it with a Nearest Neighbor (NN) initialization. Compared to the approach of optimizing routes based on distance, our proposed algorithm offers a fast solution to the STSP for EVs (EV-STSP) with routes that consume 17.34% less energy for the test instances generated., J.A.C is supported by grant PID2022-138860NB-I00 funded by MCIN/AEI/10.13039/501100011033 and, as appropriate, by "ERDF A way of making Europe", by the "European Union" or by the "European Union NextGenerationEU/PRTR"
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Using Transformers and Reinforcement Learning for the Team Orienteering Problem Under Dynamic Conditions

  • Guerrero, Antoni
  • Ammouriova, Majsa
  • Escoto-Gomar, Marc
  • Yangchongyi, Men
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] This paper presents a reinforcement learning (RL) approach for solving the team orienteering problem under both deterministic and dynamic travel time conditions. The proposed method builds on the transformer architecture and is trained to construct routes that adapt to real-time variations, such as traffic and environmental changes. A key contribution of this work is the model's ability to generalize across problem instances with varying numbers of nodes and vehicles, eliminating the need for retraining when problem size changes. To assess performance, a comprehensive set of experiments involving 27,000 synthetic instances is conducted, comparing the RL model with a variable neighborhood search metaheuristic. The results indicate that the RL model achieves competitive solution quality while requiring significantly less computational time. Moreover, the RL approach consistently produces feasible solutions across all dynamic instances, demonstrating strong robustness in meeting time constraints. These findings suggest that learning-based methods can offer efficient, scalable, and adaptable solutions for routing problems in dynamic and uncertain environments., The present work has been partially supported by the Spanish Government (IA4TES project 'Artificial Intelligence for Sustainable Energy Transition'), the Spanish Ministry of Science-AEI (PID2022- 138860NB-I00 and RED2022-134703-T), the European Commission (AIDEAS HORIZON-CL4- 2021-TWIN-TRANSITION-01-07-101057294). This publication is also part of the DIN2024-013395 grant, funded by MICIU/AEI/ 10.13039/501100011033.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A Simheuristic for the Stochastic Multi-Depot Traveling Facility Location Problem with Electric Vehicles

  • Escoto-Gomar, Marc
  • Juan, Angel A.|||0000-0003-1392-1776
  • Medina-Rodriguez, Veronica
  • Guerrero, Antoni
[EN] This paper addresses the traveling salesman problem with multiple depots, facility location and stochastic travel times, considering electric vehicles with limited battery capacity. Due to stochastic variations in travel times, vehicles may risk running out of battery during their routes, leading to penalty costs for route failures. Given the NP-hard nature of this problem, we propose a simheuristic approach that integrates Monte Carlo simulation with a metaheuristic algorithm. This approach handles both the stochastic aspects and the optimization requirements. Results show that our simheuristic outperforms the optimal or near-optimal solutions designed for traditional deterministic scenarios when applied in stochastic settings., The present work has been partially funded by the IA4TES project, funded by the Spanish Government, as well as by the Spanish Ministry of Science - AEI (PID2022- 138860NB-I00 and RED2022-134703-T).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A Learnheuristic Algorithm for the Capacitated Dispersion Problem with Dynamic Conditions

  • Gómez, Juan F.
  • Uguina, Antonio R.
  • Panadero, Javier
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] The capacitated dispersion problem, which is a variant of the maximum diversity problem, aims to determine a set of elements within a network. These elements could symbolize, for instance, facilities in a supply chain or transmission nodes in a telecommunication network. While each element typically has a bounded service capacity, in this research, we introduce a twist. The capacity of each node might be influenced by a random Bernoulli component, thereby rendering the possibility of a node having zero capacity, which is contingent upon a black box mechanism that accounts for environmental variables. Recognizing the inherent complexity and the NP-hard nature of the capacitated dispersion problem, heuristic algorithms have become indispensable for handling larger instances. In this paper, we introduce a novel approach by hybridizing a heuristic algorithm with reinforcement learning to address this intricate problem variant., This work has been partially funded by the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00, RED2022-134703-T), by the SUN project of the Horizon Europe program (HORIZON-CL4-2022-HUMAN-01-14-101092612), and by the i4OPT project of the Generalitat Valenciana (PROMETEO/2021/065).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A Learnheuristic Algorithm Based on Thompson Sampling for the Heterogeneous and Dynamic Team Orienteering Problem

  • Uguina, Antonio R.
  • Gomez, Juan F
  • Panadero, Javier
  • Martínez-Gavara, Anna
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] The team orienteering problem (TOP) is a well-studied optimization challenge in the field of Operations Research, where multiple vehicles aim to maximize the total collected rewards within a given time limit by visiting a subset of nodes in a network. With the goal of including dynamic and uncertain conditions inherent in real-world transportation scenarios, we introduce a novel dynamic variant of the TOP that considers real-time changes in environmental conditions affecting reward acquisition at each node. Specifically, we model the dynamic nature of environmental factors-such as traffic congestion, weather conditions, and battery level of each vehicle-to reflect their impact on the probability of obtaining the reward when visiting each type of node in a heterogeneous network. To address this problem, a learnheuristic optimization framework is proposed. It combines a metaheuristic algorithm with Thompson sampling to make informed decisions in dynamic environments. Furthermore, we conduct empirical experiments to assess the impact of varying reward probabilities on resource allocation and route planning within the context of this dynamic TOP, where nodes might offer a different reward behavior depending upon the environmental conditions. Our numerical results indicate that the proposed learnheuristic algorithm outperforms static approaches, achieving up to 25% better performance in highly dynamic scenarios. Our findings highlight the effectiveness of our approach in adapting to dynamic conditions and optimizing decision-making processes in transportation systems., This work has been partially funded by the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00, RED2022-134703-T) as well as by the SUN (HORIZON-CL4-2022-HUMAN01-14-101092612) and AIDEAS (HORIZON-CL4-2021-TWIN-TRANSITION-01-07-101057294) projects of the Horizon Europe program.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Optimization Challenges in Vehicle-to-Grid (V2G) Systems and Artificial Intelligence Solving Methods

  • Escoto-Gomar, Marc
  • Juan, Angel A.|||0000-0003-1392-1776
  • Guerrero, Antoni
  • Ghorbani, E.
[EN] Vehicle-to-grid (V2G) systems play a key role in the integration of electric vehicles (EVs) into smart grids by enabling bidirectional energy flows between EVs and the grid. Optimizing V2G operations poses significant challenges due to the dynamic nature of energy demand, grid constraints, and user preferences. This paper addresses the optimization challenges in V2G systems and explores the use of artificial intelligence (AI) methods to tackle these challenges. The paper provides a comprehensive analysis of existing work on optimization in V2G systems and identifies gaps where AI-driven algorithms, machine learning, metaheuristic extensions, and agile optimization concepts can be applied. Case studies and examples demonstrate the efficacy of AI-driven algorithms in optimizing V2G operations, leading to improved grid stability, cost optimization, and user satisfaction. Furthermore, agile optimization concepts are introduced to enhance flexibility and responsiveness in V2G optimization. The paper concludes with a discussion on the challenges and future directions for integrating AI-driven methods into V2G systems, highlighting the potential for these intelligent algorithms and methods., This work has been partially funded by the Spanish Government with the European Union Next Generation funds (TSI-100408-2021-0), the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00, RED2022-134703-T), and the Horizon Europe program (HORIZON-CL4-2021-TWIN-TRANSITION-01-07 101057294 AIDEAS).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

On the Use of Biased-Randomized Transformers as Data-Driven Heuristics for Agile Optimization

  • Juan, Angel A.|||0000-0003-1392-1776
  • Escoto-Gomar, Marc
  • Guerrero, Antoni
  • Panadero, J.
  • Garcia-Sanchez, Alvaro
  • Resende, Mauricio G. C.
[EN] This paper proposes the concept of biased-randomized transformers, a novel methodology that combines biased-randomized techniques and transformer-based deep learning for 'agile' optimization (i.e., real-time optimization that is carried out iteratively in dynamic systems). On the one hand, biased-randomization techniques have been used in the past to inject controlled randomness into greedy heuristics, thus converting them into probabilistic algorithms capable of generating thousands of good-quality solutions while preserving heuristic logic. On the other hand, transformer models can capture complex patterns across thousands of variables. Once trained, these models can be seen as data-driven heuristics able to provide fast solutions to new instances and adapt to changing inputs. The combination of biased-randomization techniques with trained transformers allows for a fast exploration and selection of the high-quality solutions to NP-hard combinatorial optimization problems. The paper includes two case studies that illustrate the potential of these biased-randomized transformers., This research was funded by the Spanish Ministry of Science, Innovation and Universities/AEI (PID2022-138860NB-I00, AIA2025-163553-C44, DIN2024-013395) and the Generalitat Valenciana (2024 CIAICO 117).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

An agile optimization algorithm for the tourist trip design problem with type-covering constraints

  • Martín-Solano, Xabier Andoni
  • Panadero, J.
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] The tourist trip design problem with type-covering constraints (TTDP-TC) is a novel variant of the well-established orienteering problem (OP) designed to address the complex preferences of tourists planning multi-day trips. Unlike classical routing problems, which require visiting all points of interest (POIs), the TTDP-TC allows selective visitation based on perceived value, subject to a maximum travel time constraint. This variant introduces a type-covering requirement, ensuring that each trip includes at least one POI of every specified type, adding a layer of complexity to the optimization process. In this paper, an agile optimization algorithm to solve the TTDP-TC efficiently is proposed, which aims to maximize the total profit collected from visited POIs while ensuring compliance with type-covering requirements and travel time limits. Our approach applies the coverage rules to the overall routing plan, instead of just to singular itineraries as in other recent studies. The algorithm's performance is validated through extensive computational experiments, demonstrating its ability to generate high-quality solutions within short computational times. To further validate the competitiveness of our approach, an exact method to compare the results of our approach is also implemented. The proposed approach showcases significant potential for practical applications in tourist decision support systems, offering a flexible and robust solution for planning enriched and diverse tourist experiences., This work has been partially supported by the Spanish Ministry of Science (PID2022-138860NB-I00 and RED2022-134703-T) .
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Sim-Exact Methods for Stochastic Optimization: A Complementary Approach to Simheuristics

  • Juan, Angel A.|||0000-0003-1392-1776
  • Escoto-Gomar, Marc
  • Medina-Rodriguez, Veronica
  • Rodríguez Uguina, Antonio
[EN] This paper introduces a sim-exact methodology for stochastic combinatorial optimization problems. The approach combines exact optimization models with Monte Carlo or discrete-event simulation to evaluate candidate solutions under uncertainty. The method iteratively adjusts a control parameter based on simulation feedback and solves a sequence of deterministic optimization problems. Unlike scenario-based stochastic programming, the approach does not rely on explicit scenario enumeration, and unlike simheuristics, it preserves optimality with respect to each deterministic subproblem. The methodology is tested on the vehicle routing problem with stochastic demands under different levels of demand variability. Results are compared with a simheuristic approach and a sample average approximation (SAA) method. The results show that sim-exact performance is comparable to simheuristics, with no statistically significant differences in most cases, while SAA shows weaker performance under medium and high variability., This work has been partially supported by the Spanish Ministry of Science, Innovation, and Universities/AEI (PID2022-138860NB-I00, AIA2025-163553-C44, https://doi.org/10.13039/501100011033) and the Generalitat Valenciana (2024-CIAICO-117).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A Weighted and Epsilon-Constraint Biased-Randomized Algorithm for the Biobjective TOP with Prioritized Nodes

  • Agud Albesa, Lucia|||0000-0002-1222-7988
  • Garrido-Saez, Neus|||0000-0002-7903-8591
  • Juan, Angel A.|||0000-0003-1392-1776
  • Oltra Crespo, Sandra|||0000-0003-1995-2557
  • Llorens, Almudena
[EN] This paper addresses a multiobjective version of the Team Orienteering Problem (TOP). The TOP focuses on selecting a subset of customers for maximum rewards while considering time and fleet size constraints. This study extends the TOP by considering two objectives: maximizing total rewards from customer visits and maximizing visits to prioritized nodes. The MultiObjective TOP (MO-TOP) is formulated mathematically to concurrently tackle these objectives. A multistart biased-randomized algorithm is proposed to solve MO-TOP, integrating exploration and exploitation techniques. The algorithm employs a constructive heuristic defining biefficiency to select edges for routing plans. Through iterative exploration from various starting points, the algorithm converges to high-quality solutions. The Pareto frontier for the MO-TOP is generated using the weighted method, epsilon-constraint method, and Epsilon-Modified Method. Computational experiments validate the proposed approach¿s effectiveness, illustrating its ability to generate diverse and high-quality solutions on the Pareto frontier. The algorithms demonstrate the ability to optimize rewards and prioritize node visits, offering valuable insights for real-world decision making in team orienteering applications., This work has been partially funded by the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00 and RED2022-134703-T).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

The stochastic maximum diversity problem

  • Martinez-Gavara, Anna
  • Keenan, Peter
  • Pariente, Antonio
  • Marti, Rafael
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] The Maximum Diversity Problem (MDP) is a well-known combinatorial optimisation model with applications ranging from facility location to social network analysis. This paper introduces a stochastic extension, the Stochastic Maximum Diversity Problem (SMDP), to better model applications based on attributes that may change, such as the travel time in location or routeing problems and affinity or preferences in social networks. The mathematical programming literature widely recognises that using stochastic data introduces an additional layer of difficulty to optimisation problems and therefore makes them more difficult to solve. The MDP is an NP-hard problem; consequently, the stochastic maximum diversity problem (SMDP) considered in this paper is difficult to solve. This paper proposes an extension to the scatter search (SS) method, the Stochastic SS, which integrates SS with simulation to solve the SMDP efficiently. Specifically, a Simheuristic SS algorithm is considered. It is based on customised search strategies to explore the solution space efficiently. The proposed approach is validated by an extensive comparison with alternative reference methods, and the results show the superior performance of the proposed method for stochastic problems., This work was supported by the Spanish Ministry of Science, Innovation and Universities (ERDF) (PID2024-160226OB-C21, PID2022-138860NB-I00, AIA2025-163553-C44, PID2021-125709OB-C21) and the Generalitat Valenciana (2021 CIAICO 224, 2024 CIAICO 117).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Using Reinforcement Learning in a Dynamic Team Orienteering Problem with Electric Batteries

  • Ammouriova, Majsa
  • Guerrero, Antoni
  • Tsertsvadze, Verónika
  • Schumacher, Christin
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] This paper addresses the team orienteering problem (TOP) with vehicles equipped with electric batteries under dynamic travel conditions influenced by weather and traffic, which impact travel times between nodes and hence might have a critical effect on the battery capacity to cover the planned route. The study incorporates a novel approach for solving the dynamic TOP, comparing two solution methodologies: a merging heuristic and a reinforcement learning (RL) algorithm. The heuristic combines routes using calculated savings and a biased-randomized strategy, while the RL model leverages a transformer-based encoder-decoder architecture to sequentially construct solutions. We perform computational experiments on 50 problem instances, each subjected to 200 dynamic conditions, for a total of 10,000 problems solved. The results demonstrate that while the deterministic heuristic provides an upper bound for rewards, the RL model consistently yields robust solutions with lower variability under dynamic conditions. However, the dynamic heuristic, with a 20 s time limit for solving each instance, outperformed the RL model by 3.35% on average. The study highlights the trade-offs between solution quality, computational resources, and time when dealing with dynamic environments in the TOP., The present work has been partially funded by the Spanish Government (IA4TES project 'Artificial Intelligence for Sustainable Energy Transition'), the Spanish Ministry of Science-AEI (PID2022- 138860NB-I00 and RED2022-134703-T), as well as the European Commission (SUN HORIZON-CL4- 2022-HUMAN-01-14-101092612, AIDEAS HORIZON-CL4- 2021-TWIN-TRANSITION-01-07-101057294).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A Biased-Randomized Iterated Local Search with Round-Robin for the Periodic Vehicle Routing Problem

  • Gomez, Juan F.
  • Antonio
  • Uguina, Antonio R.
  • Panadero, Javier
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] The periodic vehicle routing problem (PVRP) is a well-known challenge in real-life logistics, requiring the planning of vehicle routes over multiple days while enforcing visitation frequency constraints. Although numerous metaheuristic and exact methods have tackled various PVRP extensions, real-world settings call for additional features such as depot configurations, tight visitation frequency constraints, and heterogeneous fleets. In this paper, we present a two-phase biased-randomized algorithm that addresses these complexities. In the first phase, a round-robin assignment quickly generates feasible and promising solutions, ensuring each customer's frequency requirement is met across the multi-day horizon. The second phase refines these assignments via an iterative search procedure, improving route efficiency and reducing total operational costs. Extensive experimentation on standard PVRP benchmarks shows that our approach is able to generate solutions of comparable quality to established state-of-the-art algorithms in relatively low computational times and stands out in many instances, making it a practical choice for real life multi-day vehicle routing applications., This work was partially funded by the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00, RED2022-134703-T) and by the SUN project of the Horizon Europe program (HORIZON-CL4-2022-HUMAN-01-14-101092612).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Analyzing Key Performance Indicators for Mobility Logistics in Smart and Sustainable Cities: A Case Study Centered on Barcelona

  • Soriano-González, Raquel|||0000-0002-1337-9561
  • Pérez Bernabeu, Elena|||0000-0002-9221-7623
  • Carracedo-Garnateo, Patricia|||0000-0002-9352-9565
  • Camacho-García, Andrés|||0000-0001-8542-4264
  • Juan, Angel A.|||0000-0003-1392-1776
  • Ahsini, Yusef
[EN] Background: This article identifies and examines key performance indicators (KPIs) related to citizen mobility logistics in smart and sustainable urban areas. It begins with a comprehensive literature review to identify essential KPIs, offering valuable insights for both public and private stakeholders, including policymakers and mobility service providers. Drawing from various mobility projects in smart cities, the study extracts common KPIs and best practices. The focus of the paper then turns to Barcelona, Spain, where KPIs that matter most are analyzed. Methods: Using open data from the city council spanning from 2017 onwards, the study provides insights into the evolving mobility logistics landscape. KPIs from other European cities are also considered by utilizing similar open data sources. This comparative analysis provides valuable benchmarks and reveals disparities in mobility logistics. Throughout this investigation, the paper emphasizes the role of data quality in KPI selection. Results: Reliable open data significantly influence indicator choices and present challenges when comparing cities. Remarkably, the findings consistently highlight environmental data as an area requiring attention in sustainable mobility logistics. Conclusions: This paper makes contributions by identifying and examining KPIs relevant to citizen mobility logistics in smart and sustainable urban areas. It offers insights by applying these KPIs to Barcelona and conducting comparative analyses with other European cities. These findings serve as a valuable resource for policymakers, city planners, and mobility experts., This work was partially funded by the European Commission project UP2030 (HORIZONMISS-2021-CIT-02-01-101096405), the Alcoi¿s City Council (Catedra Alcoi Smart City), and the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00 and RED2022-134703-T).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Last Mile Drone Delivery: Complexity and Research Challenges

  • Xhafa, Fatos
  • Dominguez, Cristian
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] Drones or unmanned aerial vehicles technologies are experiencing a fast development pace propelled by a number of applications in diverse areas such as environmental monitoring, surveillance, military, smart cities, etc. In particular, the use of drones in smart city logistics is becoming increasingly relevant to the services of transporting small goods in urban neighborhoods. Hereby, a real life use case is the last mile delivery, which consists in completing the final phase of product delivery process from a truck to the customer's house. Prior to last mile delivery, products are shipped in a truck from a distribution center to a location in a city, which becomes the starting point of the last mile delivery. A key issue in last mile delivery is the drone route planning in order to guarantee the correct and efficient delivery service. Although the drone route planning in last mile delivery shares similar requirements with route planning in other delivery systems, there are complexities and challenges due to new requirements specific to drones such as limited flying distance, product weights, energy consumption, fleet costs, etc. In this paper, we analyze the complexity and research challenges of drone route planning in last mile drone delivery. The limitations of exact optimization methods versus heuristic methods are also highlighted through Gurobi solver results. The paper contributes to understanding the complex multi-objective nature of the drone routing in last mile delivery., This work has been partially supported by the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00 and RED2022-134703-T).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Sim-Learnheuristics: A Tool for Decision Making Under Stochastic and Dynamic Conditions

  • Juan, Angel A.|||0000-0003-1392-1776
  • Osorio-Muñoz, Celia|||0009-0000-5357-7063
  • Ammouriova, Majsa
  • Tsertsvadze, Verónika
[EN] Complex decision-making processes, especially those associated with NP-hard optimization problems, become even more challenging when faced with uncertainty and dynamic conditions. Traditional approaches like simulation and heuristics provide effective but limited solutions, often unable to adapt to changing environments. In this paper, we introduce sim-learnheuristics, a methodological tool combining simulation, metaheuristics, and machine learning. Sim-learnheuristics employ simulation models to model uncertainty, metaheuristic algorithms to efficiently explore the solution space, and machine learning methods to guide and adapt the heuristic process based on evolving conditions. We describe the methodology, provide pseudo-code, and discuss the main parts of an implementation that illustrates the adaptability of this approach. A review of related work is included, showing the potential of simlearnheuristics to improve decision making in real-life scenarios under dynamic and stochastic conditions., Supported by the Investigo Program (INVEST/2023/304), Horizon Europe (HORIZ ON-MISS-2021-CIT-02-01-101096405), and the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00 and RED2022-134703-T).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Evaluating visual mathematics in multimodal LLMs: a multilingual benchmark based on the Kangaroo tests

  • Igualde-Sáez, Arnau|||0009-0009-0824-6957
  • Rhomrassi-Amhar, Lamyae
  • Hoyas, Sergio|||0000-0002-8458-7288
  • García Sabater, José Pedro|||0000-0002-9097-2852
  • Fullana Alfonso, Màrius Josep|||0000-0002-0196-7876
  • Conejero, J. Alberto|||0000-0003-3681-7533
  • Ahsini Ouariaghli, Yusef
  • Vinuesa, Ricardo
[EN] Multimodal Large Language Models (MLLMs) promise advanced vision-language capabilities, yet their effectiveness in visually presented mathematics remains underexplored. This paper analyses the development and evaluation of MLLMs for mathematical problem-solving, focusing on diagrams, multilingual text, and symbolic notation. The computational demands of evaluating these large-scale models across multilingual datasets necessitate high-performance computing infrastructure, as systematic benchmarking of state-of-the-art MLLMs requires distributed processing of thousands of inference requests and parallel evaluation across multiple model architectures. We then assess several models-including GPT-4o, Pixtral, Qwen-VL, Llama 3.2 Vision variants, and Gemini 2.0 Flash-in a multilingual Kangaroo-style benchmark spanning English, French, Spanish, and Catalan. Our experiments reveal four key findings. First, overall accuracy remains moderate across geometry, visual algebra, logic, patterns, and combinatorics: no single model excels in every topic. Second, whilst most models see improved accuracy with questions that do not have images, the gain is often limited; performance for some remains nearly unchanged without visual input, indicating underutilisation of diagrammatic information. Third, substantial variation exists across languages and difficulty levels: models frequently handle easier items but struggle with advanced geometry and combinatorial reasoning. Notably, Gemini 2.0 Flash achieves the highest accuracy on image-based tasks, followed by Qwen-VL 2.5 72B and GPT-4o, though none approach human-level performance. Fourth, a complementary analysis aimed at distinguishing whether models reason or simply recite reveals that Gemini and GPT-4o stand out for their structured reasoning and consistent accuracy. In contrast, Pixtral and Llama exhibit less consistent reasoning, often defaulting to heuristics or randomness when unable to align their outputs with the given answer options., Open Access funding provided thanks to the CRUE-CSIC agreement with Springer Nature. AIS acknowledges the financial support from the European Union, Next GenerationEU, under the public subsidies of the Programa Investigo , within the framework of the Recovery, Transformation, and Resilience Plan (Reference INV/2023/25). SH acknowledges the funding of project PID2021-128676OB-I00 and JAC acknowledge funding of project PID2022-138860NB-I00 by FEDER/MCIN, funded by MCIN/ AEI/10.13039/501100011033 and by ERDF A Way of Making Europe by the European Union. RV acknowledges the funding provided by Digital Futures, in their Demonstrator-project programme. MJFA acknowledges the financial support of the Generalitat Valenciana Project grant CIAICO/2022/252. We also thank funding for open access charge: CRUE-Universitat Politècnica de València.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Generative Heuristics for Hard- and Soft-Criteria Optimization: Integrating LLMs Within Metaheuristics

  • Saiz, Miguel
  • Panadero, J.
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] In many real-world domains, optimization problems involve both quantitative objectives and qualitative criteria that cannot be directly formulated as mathematical functions. While recent research has integrated large language models (LLMs) into optimization algorithms, these approaches primarily use LLMs to guide the search process, generate heuristics, or tune optimization strategies, rather than to evaluate semantic objectives. This paper introduces generative heuristics, a methodology that combines traditional metaheuristics with LLM-based semantic evaluation to address 'soft optimization' problems containing both hard quantitative constraints and soft qualitative objectives. The proposed methodology first applies a metaheuristic algorithm to generate a shortlist of high-quality candidate solutions satisfying the quantitative objectives. These candidates are then evaluated by an LLM according to a user-defined qualitative rubric, and the resulting semantic scores are incorporated into the optimization process through a weighted soft objective. The methodology is illustrated through a constrained portfolio optimization problem in which financial risk is minimized while simultaneously promoting strategic objectives related to sector diversification, geographic exposure, environmental-social-governance quality, and overall portfolio coherence. Experimental results show that the proposed methodology consistently improves strategic alignment while producing solutions that remain close to those obtained from the hard optimization formulation., This work has been partially supported by the Spanish Ministry of Science, Innovation and Universities MICIU/AEI/10.13039/501100011033 (PID2022-138860NB-I00, AIA2025-163553-C44), the Barcelona City Council-La Caixa (2025 OVT 280226), and the Generalitat Valenciana (CIAICO/2024/117, CIBEST/2026/135).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Modeling and Optimization of NO2 Stations in the Smart City of Barcelona

  • Soriano-González, Raquel|||0000-0002-1337-9561
  • Pérez Bernabeu, Elena|||0000-0002-9221-7623
  • Carracedo-Garnateo, Patricia|||0000-0002-9352-9565
  • Martín-Solano, Xabier Andoni
[EN] The growing problem of nitrogen dioxide (NO2 ) pollution in urban environments is driving cities to adopt smart and sustainable approaches to address this challenge. To quantify and compare the effect of environmental policies, cities must be able to make informed decisions with real-time data that reflect the actual situation. Therefore, the objective of this work is threefold: The first is to study the behavior of the key performance indicator (KPI) of NO2 concentrations per station in Barcelona through exploratory analysis and clustering. The second is to predict NO2 concentration behavior, considering meteorological data. Lastly, a new distribution of current and new stations will be proposed using an optimization algorithm that maximizes the distance between them and covers the largest area of the city. As a result of this study, the importance of the location of measurement points and the need for better distribution in the city are highlighted. These new spatial distributions predict an 8% increase in NO2 concentrations. In conclusion, this study is a comprehensive tool for obtaining an accurate representation of NO2 concentrations in the city, contributing to informed decision-making, helping to improve air quality, and promoting a more sustainable urban environment., : This work has been partially funded by the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00 and RED2022-134703-T), the project SUN (HORIZON-CL4-2022-HUMAN01-14-101092612), the project UP2030 (HORIZON-MISS-2021-CIT-02-01-101096405) as well as by the Barcelona City Council and Fundació la Caixa under the framework of the Barcelona Science Plan 2020 2023 (grant 21S09355-001). Funding for open access charge: CRUE-Universitat Politècnica de València.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Strategic Decision-Making in SMEs: A Review of Heuristics and Machine Learning for Multi-Objective Optimization

  • Molina-Abril, Gines
  • Calvet, Laura
  • Riera, Daniel
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] Small- and medium-sized enterprises (SMEs) face dynamic and competitive environments where resilience and data-driven decision-making are critical. Despite the potential benefits of artificial intelligence (AI), machine learning (ML), and optimization techniques, SMEs often struggle to adopt these tools due to high costs, limited training, and restricted hardware access. This study reviews how SMEs can employ heuristics, metaheuristics, ML, and hybrid approaches to support strategic decisions under uncertainty and resource constraints. Using bibliometric mapping with UMAP and BERTopic, 82 key works are identified and clustered into 11 thematic areas. From this, the study develops a practical framework for implementing and evaluating optimization strategies tailored to SMEs' limitations. The results highlight critical application areas, adoption barriers, and success factors, showing that heuristics and hybrid methods are especially effective for multi-objective optimization with lower computational demands. The study also outlines research gaps and proposes future directions to foster digital transformation in SMEs. Unlike prior reviews focused on specific industries or methods, this work offers a cross-sectoral perspective, emphasizing how these technologies can strengthen SME resilience and strategic planning., This work has been partially supported by the Spanish Ministry of Science and the Spanish Research Agency (PID2022- 138860NB-I00 and RED2022-134703-T).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Evaluating Urban Mobility Transitions: A Dual-Track Framework for City-Scale and Local Assessment

  • Cuartas-Micieces, Javier A.
  • Soriano-González, Raquel|||0000-0002-1337-9561
  • Juan, Angel A.|||0000-0003-1392-1776
  • Ammouriova, Majsa
[EN] Evaluating urban mobility transitions is essential to determine whether local transport interventions support broader sustainability goals. Cities increasingly implement initiatives to promote public transport, active mobility, and low-carbon transport systems. Still, assessing their impact on city-scale structural change remains challenging. Existing evaluation approaches often rely on project-level monitoring or fragmented indicators, which limits cross-city comparison and the assessment of long-term system transformation. This paper proposes a dual-track methodology to evaluate sustainable urban mobility interventions. The first track uses city-defined key performance indicators to capture local implementation processes, governance dynamics, and perceived outcomes. The second track relies on publicly available open data to assess city-scale changes in mobility indicators, including public transport accessibility, cycling infrastructure provision, and traffic-related air pollution. The methodology is applied to ten European cities using open data and satellite-based environmental indicators. Results indicate that while cities report progress at the project level, external indicators show limited short-term structural change in city-wide mobility systems. These findings highlight the value of open data as an independent evaluation layer that contextualises local results and supports transparent assessment of urban mobility transitions., This work has been partially supported by the European Commission (UP2030, HORIZONMISS- 2021-CIT-02-01-101096405), the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00, AIA2025-163553-C44), and the Generalitat Valenciana (2024 CIAICO 117).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Advanced Insurance Risk Modeling for Pseudo-New Customers Using Balanced Ensembles and Transfomer Architectures

  • Solly, Finn L.
  • Guerrero, Antoni
  • Soriano-González, Raquel|||0000-0002-1337-9561
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] In insurance portfolios, classifying customers without a prior history at a given company is particularly challenging due to the absence of historical behavior, extreme class imbalance, heavy-tailed loss distributions, and strict operational constraints. Traditional machine learning approaches, including the baseline methodology proposed in previous studies, typically optimize global predictive accuracy and therefore fail to capture business-critical outcomes, especially the identification of high-risk clients. This study extends the existing approach by evaluating two complementary business-aware classification strategies: (i) a balanced bagging ensemble specifically designed to handle class imbalance and maximize expected profit under explicit customer-omission constraints, and (ii) a lightweight Transformer-based architecture capable of learning richer feature representations. Both approaches incorporate the asymmetric financial cost structure of insurance and operate under operational selection limits. The empirical analysis is conducted on a proprietary large-scale auto insurance dataset comprising 51,618 customers and is complemented by validation on nine synthetic datasets to assess robustness. Model performance is evaluated using statistical tests (ANOVA, Friedman, and pair-wise comparisons) together with business-oriented metrics. The results show that both proposed approaches consistently outperform the baseline methodology (p < 0.001) in terms of profit, with the ensemble offering a better balance of performance and efficiency, while the Transformer shows stronger robustness and generalization under data perturbations. The balanced ensemble provides the most favourable trade-off between predictive performance, robustness, interpretability, and computational efficiency, making it suitable for deployment in regulated insurance environments, while the Transformer achieves competitive results and exhibits stronger generalization under data perturbations. The proposed approach aligns machine learning with actuarial portfolio optimization by explicitly integrating profit-driven objectives and operational constraints, offering two practical and scalable solutions for risk-based decision-making in real-world insurance settings., This work has been partially supported by the Spanish Ministry of Science, Innovation and Universities/AEI (PID2022-138860NB-I00, DIN2024-013395, AIA2025-163553-C44) and the Generalitat Valenciana (2024 CIAICO 117).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Improving traffic light systems using Deep Q-networks

  • Moreno-Malo, Juan
  • Posadas-Yagüe, Juan-Luis|||0000-0002-5017-8689
  • Cano, Juan-Carlos|||0000-0002-0038-0539
  • Tavares De Araujo Cesariny Calafate, Carlos Miguel|||0000-0001-5729-3041
  • Conejero, J. Alberto|||0000-0003-3681-7533
  • Poza-Lujan, Jose-Luis|||0000-0003-2450-9920
[EN] As our cities become more complex and traffic demand grows, managing such traffic efficiently becomes challenging. Hence, solutions that allow building upon the current traffic light systems and that can be readily deployed are of global interest. In this work, we address the challenge of improving traffic light management at intersections. We propose an agent -based traffic light control system where an agent, one per intersection, dynamically regulates the light's phase cycle depending on the current traffic conditions. To this end, we will rely on Deep Networks to adequately train agents to make good decisions. Simulation results in a realistic scenario using SUMO show that our proposed approach can significantly reduce waiting times, improving transit times by 44% compared to the standard fixed -timing method. Additionally, to assess the effectiveness and reliability of our control algorithm, we introduce new performance metrics., This work has been funded by R&D projects PID2021-122580NB-100 and PID2022-138860NB-I00 from MCIN/AEI/10.13039/501100011033, Spain and "ERDF A way of making Europe". We also acknowledge Funding for open access charge: CRUE-Universitat Politecnica de Valencia.
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Solving the uncapacitated facility location problem under uncertainty: a hybrid tabu search with path-relinking simheuristic approach

  • Peidro Payá, David|||0000-0001-8678-6881
  • Juan, Angel A.|||0000-0003-1392-1776
  • Martín, Xabier A.
  • Panadero, Javier
[EN] The uncapacitated facility location problem (UFLP) is a well-known combinatorial optimization problem that finds practical applications in several fields, such as logistics and telecommunication networks. While the existing literature primarily focuses on the deterministic version of the problem, real-life scenarios often involve uncertainties like fluctuating customer demands or service costs. This paper presents a novel algorithm for addressing the UFLP under uncertainty. Our approach combines a tabu search metaheuristic with path-relinking to obtain near-optimal solutions in short computational times for the determinisitic version of the problem. The algorithm is further enhanced by integrating it with simulation techniques to solve the UFLP with random service costs. A set of computational experiments is run to illustrate the effectiveness of the solving method., This work has been partially supported by the Spanish Ministry of Science (PDC2022-133957-I00, PID2022-138860NB-I00 and RED2022-134703-T) and by the Generalitat Valenciana (PROMETEO/2021/065).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A Forward-Backward Simheuristic for the Stochastic Capacitated Dispersion Problem

  • Gómez, Juan F.
  • Martínez-Gavara, Anna
  • Panadero, Javier
  • Martí, Rafael
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] In an effort to balance the distribution of services across a given territory, dispersion and diversity models typically aim to maximize the minimum distance between any pair of facilities. Specifically, in the capacitated dispersion problem (CDP), each facility has an associated capacity or level of service, and the objective is to select a set of facilities so that the minimum distance between any pair of them (dispersion) is maximized, while ensuring a user-defined level of service. This problem can be formulated as a linear integer model, where the sum of the capacities of the selected facilities must match or exceed the total demand in the network. Real-life applications often necessitate considering the levels of uncertainty affecting the capacity of the nodes. Failure to account for this uncertainty could lead to low-quality or infeasible solutions in practical scenarios. However, research addressing the stochastic version of the CDP is scarce. This paper introduces two models for the CDP with stochastic capacities, incorporating soft constraints and penalty costs for violating the total capacity constraint. The first model includes a probabilistic constraint to ensure the required level of service with a certain probability, while the second model introduces a soft constraint with penalty costs for violations. To solve both variants of the model, a forward¿backward simheuristic algorithm is proposed. Our approach combines a metaheuristic algorithm with Monte Carlo simulation, enabling the efficient handling of the random behavior of node capacities and obtaining reliable solutions regardless of their probability distribution., This work has been partially funded by the European Commission via projects UP2030 (HORIZON-MISS- 2021-CIT-02-01-101096405) and SUN (HORIZON-CL4- 2022-HUMAN-01-14- 101092612), as well as by the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00 and RED2022-134703-T). The authors have been also supported by grant PID2021-125709OB-C21 funded by MCIN/AEI/ 10.13039/501100011033 and by ERDF A way of making Europe. They also received financial support from the Generalitat Valenciana (code CIAICO/2021/224).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Solving NP-Hard Challenges in Logistics and Transportation under General Uncertainty Scenarios Using Fuzzy Simheuristics

  • Juan, Angel A.|||0000-0003-1392-1776
  • Peidro Payá, David|||0000-0001-8678-6881
  • Rabe, Markus
  • Ammouriova, Majsa
  • Panadero, Javier
  • Riera, Daniel
[EN] n the field of logistics and transportation (L&T), this paper reviews the utilization of simheuristic algorithms to address NP-hard optimization problems under stochastic uncertainty. Then, the paper explores an extension of the simheuristics concept by introducing a fuzzy layer to tackle complex optimization problems involving both stochastic and fuzzy uncertainties. The hybrid approach combines simulation, metaheuristics, and fuzzy logic, offering a feasible methodology to solve large-scale NP-hard problems under general uncertainty scenarios. These scenarios are commonly encountered in L&T optimization challenges, such as the vehicle routing problem or the team orienteering problem, among many others. The proposed methodology allows for modeling various problem components¿including travel times, service times, customers¿ demands, or the duration of electric batteries¿as deterministic, stochastic, or fuzzy items. A cross-problem analysis of several computational experiments is conducted to validate the effectiveness of the fuzzy simheuristic methodology. Being a flexible methodology that allows us to tackle NP-hard challenges under general uncertainty scenarios, fuzzy simheuristics can also be applied in fields other than L&T., This work has been partially funded by the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00, RED2022-134703-T, PDC2022-133957-I00) and by the Generalitat Valenciana (PROMETEO/2021/065).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A sim-learnheuristic algorithm for solving a capacitated dispersion problem under stochastic and non-static conditions

  • Ghorbani, Elnaz
  • Gómez González, Juan Francisco
  • Panadero, Javier
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] A fundamental assumption in addressing real-world problems is acknowledging the presence of uncertainty and dynamism. Dismissing these factors can lead to the formulation of an optimal solution for an entirely different problem. This paper presents a novel variant of the capacitated dispersion problem (CDP) referred to as the stochastic and non-static CDP. The main objective of this problem is to strategically position facilities to achieve maximum dispersion while meeting the capacity demand constraint. The proposed approach combines stochastic and non-static elements, introducing a new paradigm to address the problem. This innovation allows us to consider more realistic and flexible environments. To solve this challenging problem, a novel sim-learnheuristic algorithm is proposed. This algorithm combines a biased-randomized metaheuristic (optimization component) with a simulation component (to model the uncertainty) and a machine learning component (to model nonstatic behavior). The non-static part works by using black box and white box mechanisms to learn the uncertainty with some related facilities¿ variables. Based on an extended set of traditional benchmarks for the CDP, a series of computational experiments were carried out. The results demonstrate the effectiveness of the proposed sim-learnheuristic approach for solving the CDP under non-static and stochastic scenarios., This work has been partially funded by the Spanish Ministry of Science and Innovation (PID2022-138860NB-I00, RED2022-134703-T) as well as by the Generalitat Valenciana (PROMETEO/2021/065).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Solving a Multi-Period Dynamic Pricing Problem Using Learning-Augmented Exact Methods and Learnheuristics

  • Juan, Angel A.|||0000-0003-1392-1776
  • Yangchongyi, Men
  • Medina-Rodriguez, Veronica
  • Escoto-Gomar, Marc
[EN] This paper addresses a dynamic multi-period pricing problem that incorporates time-varying contextual information and inventory constraints. Sales are modeled as a function of both price and a multidimensional context vector, which may include factors such as customer location, income, loyalty, competitor prices, and promotional activity. This formulation captures complex market dynamics over a finite selling horizon. The problem is formulated as a quadratic programming model, and two alternative solution approaches are proposed. The first uses a multivariate regression model to approximate the sales function linearly, allowing an exact quadratic programming solution that serves as a benchmark. The second is a 'learnheuristic' algorithm that combines a nonlinear sales learning model with metaheuristic optimization to generate high-quality pricing strategies under realistic operational constraints. Computational experiments demonstrate the effectiveness of the proposed learnheuristic approach., This work has been partially supported by the Spanish Ministry of Science, Innovation and Universities/AEI (PID2022-138860NB-I00, AIA2025-163553-C44), the Generalitat Valenciana (2024-CIAICO-117) and Coca-Cola EPP (CE20231180).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A discrete-event simheuristic for enhancing urban mobility

  • Peyman, Mohammad
  • Martín, Xabier A.
  • Panadero, Javier
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] This paper addresses a rich variant of the team orienteering problem under uncertainty to improve urban mobility. Specifically, we conduct a case study using real-world data from urban transportation hubs in Barcelona, gathered from Open Data Barcelona. The study involves routing autonomous delivery drones operating within a university campus to deliver items to designated drop-off points. Traditional optimization techniques often fail to account for the stochastic fluctuations inherent in urban traffic and the complex interactions between various transportation activities. To address these challenges, this research employs a simheuristic framework that combines heuristic optimization with commercial simulation software to replicate the dynamic and uncertain nature of urban environments accurately. The efficiency and practical applicability of our simheuristic framework are demonstrated through comprehensive computational experiments in a real-world context., This work was partially funded by the Spanish Ministry of Science and Innovation (PRE2020-091842, PID2022-138860NB-I00, RED2022-134703-T) and the Horizon Europe program (HORIZON-CL4-2022-HUMAN-01-14-101092612).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A sequential resource allocation algorithm for inter-plant debt management in returnable glass bottle logistics

  • Soriano-González, Raquel|||0000-0002-1337-9561
  • Escoto-Gomar, Marc
  • Wenwen, Chen
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] Efficient collection of empty glass bottles within a reverse logistics framework is essential for reducing operational costs and promoting environmental sustainability. This study presents a real-world case in a hybrid closed-loop supply chain, where production plants can exchange bottled products, creating a debt of empty bottles that must eventually be returned to the plant that originally purchased the new glass. Proper management of this inter-plant debt is crucial to maintaining inventory balance across facilities. The logistics process is triggered either by stockouts at a plant or by saturation of the central logistics hub, which must be cleared to receive new empty bottles. The proposed approach is based on the company's existing operational logic used in resource allocation meetings. This logic is replicated and enhanced through an algorithm that adjusts the order of resource distribution to minimize the overall bottle debt. The solution integrates real-time production and inventory data with a heuristic decision-making strategy. Computational results show improvements in inventory balance and overall supply chain efficiency, achieving the primary objective of minimizing inter-plant bottle debt., The authors disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This research was partially funded by the Spanish Ministry of Science and the Spanish Research Agency (PID2022-138860NB-I00, RED2022-134703-T).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

A Sim-Learnheuristic for the Team Orienteering Problem: Applications to Unmanned Aerial Vehicles

  • Peyman, Mohammad
  • Martín-Solano, Xabier Andoni
  • Panadero, Javier
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] In this paper, we introduce a novel sim-learnheuristic method designed to address the team orienteering problem (TOP) with a particular focus on its application in the context of unmanned aerial vehicles (UAVs). Unlike most prior research, which primarily focuses on the deterministic and stochastic versions of the TOP, our approach considers a hybrid scenario, which combines deterministic, stochastic, and dynamic characteristics. The TOP involves visiting a set of customers using a team of vehicles to maximize the total collected reward. However, this hybrid version becomes notably complex due to the presence of uncertain travel times with dynamically changing factors. Some travel times are stochastic, while others are subject to dynamic factors such as weather conditions and traffic congestion. Our novel approach combines a savings-based heuristic algorithm, Monte Carlo simulations, and a multiple regression model. This integration incorporates the stochastic and dynamic nature of travel times, considering various dynamic conditions, and generates high-quality solutions in short computational times for the presented problem., This work was partially funded by the Spanish Ministry of Science and Innovation (PRE2020-091842, PID2022-138860NB-I00, RED2022-134703-T) and the Horizon Europe program (HORIZON-CL4-2022-HUMAN-01-14-101092612).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Combining the A* Algorithm with Neural Networks to Solve the Team Orienteering Problem with Obstacles and Environmental Factors

  • Freixes, Alfons
  • Panadero, Javier
  • Serrat, Carles
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] This paper addresses the team orienteering problem applied to unmanned aerial vehicles (UAVs), considering obstacle avoidance and environmental factors such as wind conditions and payload weight. The objective is to optimize UAV routes to maximize collected rewards while adhering to operational constraints. To achieve this, we employ a simheuristic algorithm for the overall route optimization, while integrating the A* algorithm to determine feasible paths between nodes that avoid obstacles in a 2D grid-based environment. Then, a feedforward neural network estimates travel time based on UAV speed, wind conditions, trajectory distance, and payload weight. This estimation is incorporated into the optimization process to improve route planning accuracy. Numerical experiments evaluate the impact of various parameters, including obstacle placement, UAV speed, wind conditions, and payload weight. These experiments include maps with 30 to 100 points of interest and varying obstacle densities and show that our hybrid method improves solution quality by up to 15% in total profit compared to a baseline approach. Furthermore, computation times remain within 5-10% of the baseline, showing that the added predictive layer maintains computational efficiency., This work has been partially funded by the Spanish Ministry of Science (RED2022-134703-T, PID2022-138860NB-I00).
UPCommons. Portal del coneixement obert de la UPC
Publicación Artículo científico (JournalArticle)

Combining the A* algorithm with neural networks to solve the team orienteering problem with obstacles and environmental factors

  • Freixes Puig, Alfons
  • Panadero Martínez, Javier
  • Juan, Angel A.
  • Serrat Piè, Carles|||0000-0002-1504-5354
This paper addresses the team orienteering problem applied to unmanned aerial vehicles (UAVs), considering obstacle avoidance and environmental factors such as wind conditions and payload weight. The objective is to optimize UAV routes to maximize collected rewards while adhering to operational constraints. To achieve this, we employ a simheuristic algorithm for the overall route optimization, while integrating the A* algorithm to determine feasible paths between nodes that avoid obstacles in a 2D grid-based environment. Then, a feedforward neural network estimates travel time based on UAV speed, wind conditions, trajectory distance, and payload weight. This estimation is incorporated into the optimization process to improve route planning accuracy. Numerical experiments evaluate the impact of various parameters, including obstacle placement, UAV speed, wind conditions, and payload weight. These experiments include maps with 30 to 100 points of interest and varying obstacle densities and show that our hybrid method improves solution quality by up to 15% in total profit compared to a baseline approach. Furthermore, computation times remain within 5–10% of the baseline, showing that the added predictive layer maintains computational efficiency., This work has been also partially funded by the Spanish Ministry of Science (RED2022-134703-T), Peer Reviewed
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Combining the A* algorithm with neural networks to solve the team orienteering problem with obstacles and environmental factors

  • Freixes Puig, Alfons
  • Panadero Martínez, Javier
  • Juan, Angel A.
  • Serrat Piè, Carles
This paper addresses the team orienteering problem applied to unmanned aerial vehicles (UAVs), considering obstacle avoidance and environmental factors such as wind conditions and payload weight. The objective is to optimize UAV routes to maximize collected rewards while adhering to operational constraints. To achieve this, we employ a simheuristic algorithm for the overall route optimization, while integrating the A* algorithm to determine feasible paths between nodes that avoid obstacles in a 2D grid-based environment. Then, a feedforward neural network estimates travel time based on UAV speed, wind conditions, trajectory distance, and payload weight. This estimation is incorporated into the optimization process to improve route planning accuracy. Numerical experiments evaluate the impact of various parameters, including obstacle placement, UAV speed, wind conditions, and payload weight. These experiments include maps with 30 to 100 points of interest and varying obstacle densities and show that our hybrid method improves solution quality by up to 15% in total profit compared to a baseline approach. Furthermore, computation times remain within 5–10% of the baseline, showing that the added predictive layer maintains computational efficiency., This work has been also partially funded by the Spanish Ministry of Science (RED2022-134703-T), Peer Reviewed, Postprint (published version)
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

A Learnheuristic Algorithm for the Capacitated Dispersion Problem under Dynamic Conditions

  • Gómez González, Juan Francisco|||0000-0001-7692-9922
  • Rodríguez Uguina, Antonio|||0009-0001-5506-1674
  • Panadero, Javier|||0000-0002-3793-3328
  • Juan, Ángel A.|||0000-0003-1392-1776
The capacitated dispersion problem, which is a variant of the maximum diversity problem, aims to determine a set of elements within a network. These elements could symbolize, for instance, facilities in a supply chain or transmission nodes in a telecommunication network. While each element typically has a bounded service capacity, in this research, we introduce a twist. The capacity of each node might be influenced by a random Bernoulli component, thereby rendering the possibility of a node having zero capacity, which is contingent upon a black box mechanism that accounts for environmental variables. Recognizing the inherent complexity and the NP-hard nature of the capacitated dispersion problem, heuristic algorithms have become indispensable for handling larger instances. In this paper, we introduce a novel approach by hybridizing a heuristic algorithm with reinforcement learning to address this intricate problem variant.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Solving NP-Hard Challenges in Logistics and Transportation under General Uncertainty Scenarios Using Fuzzy Simheuristics

  • Juan, Ángel A.|||0000-0003-1392-1776
  • Rabe, Markus|||0000-0002-7190-9321
  • Ammouriova, Majsa|||0000-0002-6118-0389
  • Panadero, Javier|||0000-0002-3793-3328
  • Peidro, David|||0000-0001-8678-6881
  • Riera Terrén, Daniel|||0000-0002-4718-7234
In the field of logistics and transportation (L&T), this paper reviews the utilization of simheuristic algorithms to address NP-hard optimization problems under stochastic uncertainty. Then, the paper explores an extension of the simheuristics concept by introducing a fuzzy layer to tackle complex optimization problems involving both stochastic and fuzzy uncertainties. The hybrid approach combines simulation, metaheuristics, and fuzzy logic, offering a feasible methodology to solve large-scale NP-hard problems under general uncertainty scenarios. These scenarios are commonly encountered in L&T optimization challenges, such as the vehicle routing problem or the team orienteering problem, among many others. The proposed methodology allows for modeling various problem components-including travel times, service times, customers' demands, or the duration of electric batteries-as deterministic, stochastic, or fuzzy items. A cross-problem analysis of several computational experiments is conducted to validate the effectiveness of the fuzzy simheuristic methodology. Being a flexible methodology that allows us to tackle NP-hard challenges under general uncertainty scenarios, fuzzy simheuristics can also be applied in fields other than L&T.
Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Solving the uncapacitated facility location problem under uncertainty, a hybrid tabu search with path-relinking simheuristic approach

  • Peidro, David|||0000-0001-8678-6881
  • Martin, Xabier A.|||0000-0003-4182-0120
  • Panadero, Javier|||0000-0002-3793-3328
  • Juan, Ángel A.|||0000-0003-1392-1776
The uncapacitated facility location problem (UFLP) is a well-known combinatorial optimization problem that finds practical applications in several fields, such as logistics and telecommunication networks. While the existing literature primarily focuses on the deterministic version of the problem, real-life scenarios often involve uncertainties like fluctuating customer demands or service costs. This paper presents a novel algorithm for addressing the UFLP under uncertainty. Our approach combines a tabu search metaheuristic with path-relinking to obtain near-optimal solutions in short computational times for the determinisitic version of the problem. The algorithm is further enhanced by integrating it with simulation techniques to solve the UFLP with random service costs. A set of computational experiments is run to illustrate the effectiveness of the solving method.