Randomized Adaptive Vehicle Decomposition for Large-Scale Power Restoration
This paper considers the joint repair and restoration of the electrical power system after significant disruptions caused by natural disasters. This problem is computationally challenging because, when the goal is to minimize the size of the blackout, it combines a routing and a power restoration component, both of which are difficult on their own. The joint repair/restoration problem has been successfully approached with a 3-stage decomposition, whose last step is a multiple-vehicle, pickup-and-delivery routing problem with precedence and capacity constraints whose goal is to minimize the sum of the delivery times (PDRPPCCDT). Experimental results have shown that the PDRPPCCDT is a bottleneck and this paper proposes a Randomized Adaptive Vehicle Decomposition (RAVD) to scale to very large power outages. The RAVD approach is shown to produce significant computational benefits and provide high-quality results for infrastructures with more than 24000 components and 1200 damaged items, giving rise to PDRPPCCDT with more than 2500 visits.
KeywordsPower System Delivery Time Precedence Constraint Large Neighborhood Search Merging Oper
Unable to display preview. Download preview PDF.
- 1.Adibi, M.: Power System Restoration (Methodologies & Implementation Strategies) (2000)Google Scholar
- 6.Bent, R., Van Hentenryck, P.: A Two-Stage Hybrid Algorithm for Pickup and Delivery Vehicle Routing Problems with Time Windows. Computers and Operations Research (Special Issue on Applications in Combinatorial Optimization), 875–893 (2006)Google Scholar
- 7.Bent, R., Van Hentenryck, P.: Randomized Adaptive Spatial Decoupling For Large-Scale Vehicle Routing with Time Windows. In: Proceedings of the 22th National Conference on Artificial Intelligence (AAAI 2007). AAAI Press (July 2007)Google Scholar
- 11.FEMA. Hazus overview (2010), http://www.fema.gov/plan/prevent/hazus/
- 13.Duncan Glover, J., Sarma, M.S., Overbye, T.: Power Systems Analysis and Design. CL-Engineering (2007)Google Scholar
- 15.Huang, J.A., Galiana, F.D., Vuong, G.T.: Power system restoration incorporating interactive graphics and optimization, pp. 216–222 (May 1991)Google Scholar
- 17.Mori, H., Ogita, Y.: A parallel tabu search based approach to optimal network reconfigurations for service restoration in distribution systems, vol. 2, pp. 814–819 (2002)Google Scholar
- 19.Pacino, D., Van Hentenryck, P.: Large neighborhood search and adaptive randomized decompositions for flexible jobshop scheduling. In: Walsh, T. (ed.) IJCAI, pp. 1997–2002. IJCAI/AAAI (2011)Google Scholar
- 23.Van Hentenryck, P., Coffrin, C., Bent, R.: Vehicle routing for the last mile of power system restoration. In: Proceedings of the 17th Power Systems Computation Conference (PSCC 2011), Stockholm, Sweden (August 2011)Google Scholar