Pasar al contenido principal

Resultados relacionados

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

RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times

  • Martín, Xabier A.
  • Panadero, Javier
  • Peidro Payá, David|||0000-0001-8678-6881
  • Pérez Bernabeu, Elena|||0000-0002-9221-7623
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] Stochastic, as well as fuzzy uncertainty, can be found in most real-world systems. Considering both types of uncertainties simultaneously makes optimization problems incredibly challenging. In this paper we propose a fuzzy simheuristic to solve the Time Capacitated Arc Routing Problem (TCARP) when the nature of the travel time can either be deterministic, stochastic or fuzzy. The main goal is to find a solution (vehicle routes) that minimizes the total time spent in servicing the required arcs. However, due to uncertainty, other characteristics of the solution are also considered. In particular, we illustrate how reliability concepts can enrich the probabilistic information given to decision-makers. In order to solve the aforementioned optimization problem, we extend the concept of simheuristic framework so it can also include fuzzy elements. Hence, both stochastic and fuzzy uncertainty are simultaneously incorporated into the CARP. In order to test our approach, classical CARP instances have been adapted and extended so that customers' demands become either stochastic or fuzzy. The experimental results show the effectiveness of the proposed approach when compared with more traditional ones. In particular, our fuzzy simheuristic is capable of generating new best-known solutions for the stochastic versions of some instances belonging to the tegl, tcarp, val, and rural benchmarks., Spanish Ministry of Science, Grant/Award Number: PID2019-111100RB-C21/AEI/10.13039/501100011033; Barcelona Council and the "la Caixa" Foundation under the framework of the Barcelona Science Plan 2020-2023, Grant/Award Number: 21S09355-001; Generalitat Valenciana,Grant/Award Number: PROMETEO/2021/065
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Optimization of vehicular networks in smart cities: from agile optimization to learnheuristics and simheuristics

  • Peyman, Mohammad
  • Fluechter, Tristan
  • Panadero, Javier
  • Serrat, Carles
  • Xhafa, Fatos
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] Vehicular ad hoc networks (VANETs) are a fundamental component of intelligent transportation systems in smart cities. With the support of open and real-time data, these networks of inter-connected vehicles constitute an 'Internet of vehicles' with the potential to significantly enhance citizens' mobility and last-mile delivery in urban, peri-urban, and metropolitan areas. However, the proper coordination and logistics of VANETs raise a number of optimization challenges that need to be solved. After reviewing the state of the art on the concepts of VANET optimization and open data in smart cities, this paper discusses some of the most relevant optimization challenges in this area. Since most of the optimization problems are related to the need for real-time solutions or to the consideration of uncertainty and dynamic environments, the paper also discusses how some VANET challenges can be addressed with the use of agile optimization algorithms and the combination of metaheuristics with simulation and machine learning methods. The paper also offers a numerical analysis that measures the impact of using these optimization techniques in some related problems. Our numerical analysis, based on real data from Open Data Barcelona, demonstrates that the constructive heuristic outperforms the random scenario in the CDP combined with vehicular networks, resulting in maximizing the minimum distance between facilities while meeting capacity requirements with the fewest facilities., This work has been partially funded by the Spanish Ministry of Science (PID2019-111100RB-C21 /AEI/ 10.13039/501100011033), as well as by the Barcelona City Council and Fundacio "la Caixa" under the framework of the Barcelona Science Plan 2020-2023 (grant 21S09355-001).
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)

Determining Reliable Solutions for the Team Orienteering Problem with Probabilistic Delays

  • Herrera, Erika M.
  • Panadero, Javier
  • Carracedo-Garnateo, Patricia|||0000-0002-9352-9565
  • Juan, Angel A.|||0000-0003-1392-1776
  • Pérez Bernabeu, Elena|||0000-0002-9221-7623
[EN] In the team orienteering problem, a fixed fleet of vehicles departs from an origin depot towards a destination, and each vehicle has to visit nodes along its route in order to collect rewards. Typically, the maximum distance that each vehicle can cover is limited. Alternatively, there is a threshold for the maximum time a vehicle can employ before reaching its destination. Due to this driving range constraint, not all potential nodes offering rewards can be visited. Hence, the typical goal is to maximize the total reward collected without exceeding the vehicle's capacity. The TOP can be used to model operations related to fleets of unmanned aerial vehicles, road electric vehicles with limited driving range, or ride-sharing operations in which the vehicle has to reach its destination on or before a certain deadline. However, in some realistic scenarios, travel times are better modeled as random variables, which introduce additional challenges into the problem. This paper analyzes a stochastic version of the team orienteering problem in which random delays are considered. Being a stochastic environment, we are interested in generating solutions with a high expected reward that, at the same time, are highly reliable (i.e., offer a high probability of not suffering any route delay larger than a user-defined threshold). In order to tackle this stochastic optimization problem, which contains a probabilistic constraint on the random delays, we propose an extended simheuristic algorithm that also employs concepts from reliability analysis., This work has been partially funded by the Spanish Ministry of Science (PID2019-111100RBC21-C22/AEI/10.13039/501100011033), the Barcelona City Council and Fundacio "la Caixa" under the framework of the Barcelona Science Plan 2020-2023 (grant 21S09355-001), and the Generalitat Valenciana (PROMETEO/2021/065).
RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia
Publicación Artículo científico (JournalArticle)

Optimizing Transport Logistics under Uncertainty with Simheuristics: Concepts, Review and Trends

  • Castaneda, Juliana
  • Ghorbani, Elnaz
  • Ammouriova, Majsa
  • Panadero, Javier
  • Juan, Angel A.|||0000-0003-1392-1776
[EN] Background: Uncertainty conditions have been increasingly considered in optimization problems arising in real-life transportation and logistics activities. Generally, the analysis of complex systems in these non-deterministic environments is approached with simulation techniques. However, simulation is not an optimization tool. Hence, it must be combined with optimization methods when our goal is to: (i) minimize operating costs while guaranteeing a given quality of service; or (ii) maximize system performance using limited resources. When solving NP-hard optimization problems, the use of metaheuristics allows us to deal with large-scale instances in reasonable computation times. By adding a simulation layer to the metaheuristics, the methodology becomes a simheuristic, which allows the optimization element to solve scenarios under uncertainty. Methods: This paper reviews the indexed documents in Elsevier Scopus database of both initial as well as recent applications of simheuristics in the logistics and transportation field. The paper also discusses open research lines in this knowledge area. Results: The simheuristics approaches to solving NP-hard and large-scale combinatorial optimization problems under uncertainty scenarios are discussed, as they frequently appear in real-life applications in logistics and transportation activities. Conclusions: The way in which the different simheuristic components interact puts a special emphasis in the different stages that can contribute to make the approach more efficient from a computational perspective. There are several lines of research that are still open in the field of simheuristics., This work has been partially funded by the Spanish Ministry of Science (PID2019-111100RBC21-C22/AEI/10.13039/501100011033), the Barcelona City Council and Fundacio "la Caixa" under the framework of the Barcelona Science Plan 2020-2023 (grant 21S09355-001), and the Generalitat Valenciana (PROMETEO/2021/065).