AIOps algorithms playa crucial role in the mainte-nance of microservice systems. Many previous benchmarks' per-formance leaderboard provides valuable guidance for selecting appropriate algorithms. However, existing AIOps benchmarks mainly utilize offline static datasets to evaluate algorithms. They cannot consistently evaluate the performance of algorithms using real-time datasets, and the operation scenarios for evaluation are static, which is insufficient for effective algorithm selection. To address these issues, we propose an evaluation-consistent and scenario-oriented evaluation framework named AIOpsArena. The core idea is to build a live microservice benchmark to generate real-time datasets and consistently simulate the specific operation scenarios on it. AIOpsArena supports different leaderboards by selecting specific algorithms and datasets according to the operation scenarios. It also supports the deployment of various types of algorithms, enabling algorithms hot-plugging. At last, we test AIOpsArena with typical microservice operation scenarios to demonstrate its efficiency and usability. Platform and a video demonstrating the functioning of AIOpsArena is available from https://github.com/AIOpsArena/aiopsarena.

Seagull optimization algorithm (SOA) exhibits certain weaknesses such as poor accuracy and a tendency to stagnate in local optimal solutions when solving complex optimization problems. This paper suggests an enhanced variant of SOA, referred to as planar-mirror reflection imaging learning based SOA (PRIL-SOA), to address these limitations. First, we present the novel nonlinear strategies for adjusting the employing variable A and control parameter B are presented to achieve a balance between global and local search capabilities. Second, a modified position update equation is devised that incorporates velocity components and personal history best positions, thereby enhance solution precision. Third, a new PRIL strategy is introduced to maintain diversity and prevent premature convergence. To validate the performance of PRIL-SOA, we conduct a series of benchmark tests, including 23 classical functions and a feature selection problem involving 21 datasets are used. The results indicate that PRIL-SOA consistently outperforms basic SOA and other meta-heuristics. The average search success rate of PRIL-SOA on benchmark test problems is 91.3 %, with 21 out of 23 problems achieving the theoretical optimal value. Compare with SOA, mountain gazelle optimizer (MGO), whale optimization algorithm (WOA), hunger games search (HGS), HHO-based joint opposite selection (HHO-JOS), modified SCA (MSCA), and exploration-enhanced GWO (EEGWO), the average success rates of PRIL-SOA is better to 86.95 %, 78.26 %, 82.61 %, 65.22 %, 56.52 %, 60.87 %, and 4.35 %, respectively.

Traffic congestion, a common and complicated phenomenon in urban transportation systems, is attracting increasing attention from researchers in Geographical Information Science (GIS) and other fields. In this study, we illustrate a general mechanism that reveals the relationship between travel time and dynamic traffic conditions. We measure a vehicle’s travel time to its destination along any path, where the travel time is calculated based on the path length and on the real-time traffic volume and transport capacity of each road segment on the path. On the basis of this measurement, we present a simple dynamic routing strategy that allows each vehicle to dynamically choose the path to its destination while imposing the minimum travel time. The application of our routing algorithm to the Chengdu street network, Barabási–Albert scale-free network and Erdös–Rényi random network shows that the proposed strategy remarkably improves network throughput and balances traffic load distribution. Our findings suggest that mining the time mechanism of network transport is important to explore efficient time-optimization routing algorithms to enhance the transport capacity of urban street networks and other kinds of networks.

We present a new hybrid method for solving constrained numerical and engineering optimization problems in this paper. The proposed hybrid method takes advantage of the differential evolution (DE) ability to find global optimum in problems with complex design spaces while directly enforcing feasibility of constraints using a modified augmented Lagrangian multiplier method. The basic steps of the proposed method are comprised of an outer iteration, in which the Lagrangian multipliers and various penalty parameters are updated using a first-order update scheme, and an inner iteration, in which a nonlinear optimization of the modified augmented Lagrangian function with simple bound constraints is implemented by a modified differential evolution algorithm. Experimental results based on several well-known constrained numerical and engineering optimization problems demonstrate that the proposed method shows better performance in comparison to the state-of-the-art algorithms.