With limited financial resources, decision-makers in firms and governments face the task of selecting the best portfolio of projects to invest in. As the pool of project proposals increases and more ...realistic constraints are considered, the problem becomes NP-hard. Thus, metaheuristics have been employed for solving large instances of the project portfolio selection problem (PPSP). However, most of the existing works do not account for uncertainty. This paper contributes to close this gap by analyzing a stochastic version of the PPSP: the goal is to maximize the expected net present value of the inversion, while considering random cash flows and discount rates in future periods, as well as a rich set of constraints including the maximum risk allowed. To solve this stochastic PPSP, a simulation-optimization algorithm is introduced. Our approach integrates a variable neighborhood search metaheuristic with Monte Carlo simulation. A series of computational experiments contribute to validate our approach and illustrate how the solutions vary as the level of uncertainty increases.
The design of supply chain networks (SCNs) aims at determining the number, location, and capacity of production facilities, as well as the allocation of markets (customers) and suppliers to one or ...more of these facilities. This paper reviews the existing literature on the use of simulation-optimization methods in the design of resilient SCNs. From this review, we classify some of the many works in the topic according to factors such as their methodology, the approach they use to deal with uncertainty and risk, etc. The paper also identifies several research opportunities, such as the inclusion of multiple criteria (e.g., monetary, environmental, and social dimensions) during the design-optimization process and the convenience of considering hybrid approaches combining metaheuristic algorithms, simulation, and machine learning methods to account for uncertainty and dynamic conditions, respectively.
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.
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.
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 non-static 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.
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.
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.
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.
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.
Many real-life combinatorial optimization problems are subject to a high degree of dynamism, while, simultaneously, a certain level of synchronization among agents and events is required. Thus, for ...instance, in ride-sharing operations, the arrival of vehicles at pick-up points needs to be synchronized with the times at which users reach these locations so that waiting times do not represent an issue. Likewise, in warehouse logistics, the availability of automated guided vehicles at an entry point needs to be synchronized with the arrival of new items to be stored. In many cases, as operational decisions are made, a series of interdependent events are scheduled for the future, thus making the synchronization task one that traditional optimization methods cannot handle easily. On the contrary, discrete-event simulation allows for processing a complex list of scheduled events in a natural way, although the optimization component is missing here. This paper discusses a hybrid approach in which a heuristic is driven by a list of discrete events and then extended into a biased-randomized algorithm. As the paper discusses in detail, the proposed hybrid approach allows us to efficiently tackle optimization problems with complex synchronization issues.