In the past, the Webster optimal cycle time formula was limited to calculate the optimal cycle from historical data for fixed-time traffic signal control. This paper focuses on the design of an adaptive traffic signal control based on fuzzy logic with Webster and modified Webster’s formula. These formulas are used to calculate the optimal cycle time depending on the current traffic situation which applying in the next cycle. The alternation of the traffic condition between two successive cycles is monitored and handled through the fuzzy logic system to compensate the fluctuation. The obtained optimal cycle time is used to determine adaptively the effective phase green times i.e. is used to determine adaptively the maximum allowable extension limit of the green phase in the next cycle. The SUMO traffic simulator is used to compare the results of the proposed adaptive control methods with fuzzy logic based traffic control, and a fixed-time Webster and modified Webster based traffic control methods. The proposed methods are tested on an isolated intersection. In this study, real field-collected data obtained from three, four, and five approaches intersections in Kilis/Turkey are used to test the performance of the proposed methods. In addition, to examine the efficiency of the proposed techniques at heavy demands, the arbitrary demands are generated by SUMO for a four approaches intersection. The obtained simulation results indicate that the proposed methods over perform the fixed time and fuzzy logic based traffic control methods in terms of average vehicular delay, speed, and travel time.

The increasing adoption of electric vehicles (EVs) has led to the widespread implementation of battery swapping stations. However, ensuring fairness in battery pricing remains a significant challenge since variations in battery health and performance among swapped batteries can result in user dissatisfaction and operational inefficiencies. This paper introduces a novel approach to enhance fairness in battery swapping by integrating a machine learning-based real-time prediction model with a pricing strategy based on remaining useful life (RUL) estimation to address this issue. The proposed solution comprises a real-time RUL estimation system and a dynamic pricing mechanism that ensures fair pricing based on battery health and performance. This integrated approach aims to improve user satisfaction and the operational efficiency of swapping stations. The paper evaluates various machine learning algorithms for real-time RUL estimation regarding accuracy, computation time, and memory usage. The results suggest that XGBoost provides the most suitable balance between accuracy and efficiency, making it an effective solution for real-world applications. Comparative analysis shows that the XGBoost model outperforms the second-best method (Random Forest) with a lower error (3.50 vs 3.79) while maintaining competitive computational efficiency (9.75 vs 8.52 seconds) and memory usage (2.12 vs 2.32 MB) when solving a typical numerical case study problem. The proposed approach has the potential to accelerate the adoption of electric vehicles and contribute to sustainability goals by promoting efficient battery utilization and fair pricing mechanisms.

The changes that positive or negative results cause in an individual's behavior are called Operant Conditioning. This paper introduces an operant conditioning approach (OCA) for large scale swarm optimization models. The proposed approach has been applied to social learning particle swarm optimization (SL-PSO), a variant of the PSO algorithm. In SL-PSO, the swarm particles are sorted according to the objective function and all particles are updated with learning from the others. In this study, each particle's learning rate is determined by the mathematical functions that are inspired by the operant conditioning. The proposed approach adjusts the learning rate for each particle. By using the learning rate, a particle close to the optimum solution is aimed to learn less. Thanks to the learning rate, a particle is prevented from being affected by particles close to the optimum point and particles far from the optimum point at the same rate. The proposed OCA-SL-PSO is compared with SL- PSO and pure PSO on CEC 13 functions. Also, the proposed OCA-SL-PSO is tested for large-scale optimization (100-D, 500-D, and 1000-D) benchmark functions. This paper has a novel contribution which is the usage of OCA on Social Optimization Algorithms. The results clearly indicate that the OCA is increasing the results of large-scale SL-PSO.