Spatiotemporally Coordinated Operation in Multiple Data Centers Based on Adaptive Large Neighborhood Search Algorithm with Hierarchical Collaboration

Data centers have become essential infrastructure for digital services, while their rapidly growing electricity demand makes coordinated workload and power management an important optimization problem. This paper studies the multi-data-center operation problem under time-of-use electricity pricing and formulates it as a multi-data-center mixed-integer nonlinear programming model (MDC-MINLP). The model jointly represents binary task scheduling decisions, including temporal workload shifting and spatial task migration, and continuous power-side variables, including device-level utilization, IT and auxiliary power consumption, energy storage dynamics, grid power procurement, and quality-of-service constraints. The objective is to minimize the total operating cost by integrating electricity purchasing cost, IT operation loss, storage degradation cost, and migration cost. To solve the resulting large-scale discrete–continuous coupled problem, an Adaptive Large Neighborhood Search algorithm with Hierarchical Collaboration (HC-ALNS) is proposed. HC-ALNS reconstructs feasible task action sets, employs a surrogate objective for fast candidate screening, performs accurate power-layer evaluation for selected solutions, and adaptively adjusts search intensity according to convergence behavior. Numerical results show that HC-ALNS reduces the total operating cost by 3.67% and achieves better convergence and solution quality than NSGA-II and PSO. These findings demonstrate that the proposed MDC-MINLP and HC-ALNS provide an effective mathematical optimization framework for coordinated computation–power scheduling.