Electric buses (eBuses) will be the mainstream in mass urban transportation in the near future. Thus, installing the charging infrastructure in convenient locations will play a critical role in the transition to eBuses. Taking this into account, in this paper we propose an iterated local search algorithm to optimize the location of charging stations while satisfying certain properties of the transportation system, e.g., satisfying the demand and ensuring that the limited driving range of the buses will not impact the service. The effectiveness of our approach is demonstrated by experimenting with a set of problem instances with real data from 3 Irish cities, i.e., Limerick, Cork, and Dublin. We compare our approach against a MIP-based solution. Results show that our approach is superior in terms of scalability and its anytime behavior.
This paper presents a framework for the efficient management of renewable energies to charge a fleet of electric buses (eBuses). Our framework starts with the prediction of clean energy time windows, i.e., periods of time when the production of clean energy exceeds the demand of the country. Then, the optimization phase schedules charging events to reduce the use of non-clean energy to recharge eBuses while passengers are embarking or disembarking. The proposed framework is capable of overcoming the unstable and chaotic nature of wind power generation to operate the fleet without perturbing the quality of service. Our extensive empirical validation with real instances from Ireland suggests that our solutions can significantly reduce non-clean energy consumed on large data sets.
K-Anonymization is a popular approach for sharing datasets while preserving the privacy of personal and sensitive information. It ensures that each individual is indistinguishable from at least k-1 others in the anonymized dataset through data suppression or generalization, which inevitably leads to some information loss. The goal is to achieve k-anonymization with minimal information loss. This paper presents an efficient local search framework designed to address this challenge using arbitrary information loss metrics. The framework leverages anytime capabilities, allowing it to balance computation time and solution quality, thereby progressively improving the quality of the anonymized data. Our empirical evaluation shows that the proposed local search framework significantly reduces information loss compared to current state-of-the-art solutions, providing performance improvements of up to 54% and 43% w.r.t. the k-members and l-greedy heuristic solutions, the leading algorithms for large datasets. Additionally, our solution approach outperforms the Hun-garian-based solution, the best solution approach for small-size instances, by up to 4.7% on these instances.