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.

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.

Mobility and transportation activities in smart cities require an increasing amount of energy. With the frequent energy crises arising worldwide and the need for a more sustainable and environmental friendly economy, optimizing energy consumption in these growing activities becomes a must. This work reviews the latest works in this matter and discusses several challenges that emerge from the aforementioned social and industrial demands. The paper analyzes how collaborative concepts and the increasing use of electric vehicles can contribute to reduce energy consumption practices, as well as intelligent x-heuristic algorithms that can be employed to achieve this fundamental goal. In addition, the paper analyzes computational results from previous works on mobility and transportation in smart cities applying x-heuristics algorithms. Finally, a novel computational experiment, involving a ridesharing example, is carried out to illustrate the benefits that can be obtained by employing these algorithms.

The team orienteering problem (TOP) is an NP‐hard optimization problem with an increasing number of potential applications in smart cities, humanitarian logistics, wildfire surveillance, etc. In the TOP, a fixed fleet of vehicles is employed to obtain rewards by visiting nodes in a network. All vehicles share common origin and destination locations. Since each vehicle has a limitation in time or traveling distance, not all nodes in the network can be visited. Hence, the goal is focused on the maximization of the collected reward, taking into account the aforementioned constraints. Most of the existing literature on the TOP focuses on its deterministic version, where rewards and travel times are assumed to be predefined values. This paper focuses on a more realistic TOP version, where travel times are modeled as random variables, which introduces reliability issues in the solutions due to the route‐length constraint. In order to deal with these complexities, we propose a simheuristic algorithm that hybridizes biased‐randomized heuristics with a variable neighborhood search and MCS. To test the quality of the solutions generated by the proposed simheuristic approach, we employ the well‐known sample average approximation (SAA) method, as well as a combination model that hybridizes the metaheuristic used in the simheuristic approach with the SAA algorithm. The results show that our proposed simheuristic outperforms the SAA and the hybrid model both on the objective function values and computational time.

Urban logistics consumes a large portion of energy resources worldwide. Thus, optimization algorithms are used to define mobility modes, vehicle fleets, routing plans, and last-mile delivery operations to reduce energy consumption such as metaheuristics. With the emergence of smart cities, new opportunities were defined, such as carsharing and ridesharing. In addition to last-mile delivery, these opportunities form a challenging problem because of the dynamism they possess. New orders or ride requests could be placed or canceled at any time. Further, transportation times might evolve due to traffic conditions. These dynamic changes challenge traditional optimization methods to propose solutions in real-time to large-scale energy-optimization problems. Thus, a more `agile optimization’ approach is required to provide fast solutions to optimization problems when these changes occur. Agile optimization combines biased randomization and parallelism. It provides `good’ solutions compared to solutions found by traditional optimization methods, such as in-team orienteering problems. Additionally, these solutions are found in short wall clock, real-time.

Carsharing practices are spreading across many cities in the world. This paper analyzes real-life data obtained from a private carsharing company operating in the city of Barcelona, Spain. After describing the main trends in the data, machine learning and time-series analysis methods are employed to better understand citizens’ needs and behavior, as well as to make predictions about the evolution of their demand for this service. In addition, an original proposal is made regarding the location of the pick-up points. This proposal is based on a capacitated dispersion algorithm, and aims at balancing two relevant factors, including scattering of pick-up points (so that most users can benefit from the service) and efficiency (so that areas with higher demand are well covered). Our aim is to gain a deeper understanding of citizens’ needs and behavior in relation to carsharing services. The analysis includes three main components: descriptive, predictive, and prescriptive, resulting in customer segmentation and forecast of service demand, as well as original concepts for optimizing parking station location.