The advantages of electric vehicles (EVs) include reduction of greenhouse gas and other emissions, energy security, and fuel economy. The societal benefits of large-scale adoption of EVs cannot be realized without adequate deployment of publicly accessible charging stations. We propose a two-stage stochastic programming model to determine the optimal network of charging stations for a community, considering uncertainties in the arrival and dwell times of vehicles, the state of charge of arriving vehicles' batteries, drivers' walking ranges and charging preferences, demand during weekdays and weekends, and the community's rate of EV adoption. We conducted studies using the sample average approximation method, which asymptotically converges to an optimal solution for a two-stage stochastic problem. However, this method is computationally expensive for large-scale instances. Therefore, we also developed a heuristic to produce nearly optimal solutions quickly for our data instances. We conducted computational experiments using various publicly available data sources and evaluated the benefits of the solutions for a given community, both quantitatively and qualitatively.

Electric vehicles (EVs) provide a cleaner alternative that not only reduces greenhouse gas emissions but also improves air quality and reduces noise pollution. The consumer market for electrical vehicles is growing very rapidly. Designing a network with adequate capacity and types of public charging stations is a challenge that needs to be addressed to support the current trend in the EV market. In this research, we propose a choice modeling approach embedded in a two-stage stochastic programming model to determine the optimal layout and types of EV supply equipment for a community while considering randomness in demand and drivers' behaviors. Some of the key random data parameters considered in this study are: EV's dwell time at parking location, battery's state of charge, distance from home, willingness to walk, drivers' arrival patterns, and traffic on weekdays and weekends. The two-stage model uses the sample average approximation method, which asymptotically converges to an optimal solution. To address the computational challenges for large-scale instances, we propose an outer approximation decomposition algorithm. We conduct extensive computational experiments to quantify the efficacy of the proposed approach. In addition, we present the results and a sensitivity analysis for a case study based on publicly available data sources.

The past decade has seen a substantial increase in the use of small unmanned aerial vehicles (UAVs) in both civil and military applications. This article addresses an important aspect of refueling in the context of routing multiple small UAVs to complete a surveillance or data collection mission. Specifically, this article formulates a multiple-UAV routing problem with the refueling constraint of minimizing the overall fuel consumption for all the vehicles as a two-stage stochastic optimization problem with uncertainty associated with the fuel consumption of each vehicle. The two-stage model allows for the application of sample average approximation (SAA). Although the SAA solution asymptotically converges to the optimal solution for the two-stage model, the SAA run time can be prohibitive for medium- and large-scale test instances. Hence, we develop a tabu search-based heuristic that exploits the model structure while considering the uncertainty in fuel consumption. Extensive computational experiments corroborate the benefits of the two-stage model compared to a deterministic model and the effectiveness of the heuristic for obtaining high-quality solutions.

Integrating inventory and transportation decisions is vital in supply chain management and can enable decision-makers to achieve competitive advantages. This study considers a multi-item replenishment problem (MIRP) with a piece-wise linear transportation cost under demand uncertainty, which usually occurs both in retail and production environment when several items must be ordered from a single supplier. Conventionally, two-stage stochastic programming formulation is risk-neutral, and it lacks robustness in the presence of high data variability. Hence, we introduce the Conditional Value at Risk (CVaR) approach for MIRP. Additionally, we deploy both single and multi-cut L-shaped and the sample average approximation method to circumvent the computational complexity to solve large-scale instances. The data-driven simulation study is used to benchmark the results from deterministic, risk-neutral, and risk-averse stochastic models. The results indicate that under higher data variations, the risk-averse model provides better perspectives for a decision-maker. The results show a 40–50% reduction in lost sales with marginal growth in total cost while considering CVaR instead of a risk-neutral approach.