An iterated sample construction with path relinking method: application to switch allocation in electrical distribution networks

DOI10.1016/J.COR.2012.05.006zbMATH Open1349.90156OpenAlexW2037057090MaRDI QIDQ339534FDOQ339534

Authors: Alexander J. Benavides, Marcus Ritt, Luciana Buriol, P. M. França 

Publication date: 11 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2012.05.006

Recommendations

• The electrical distribution network planning problem
• The location of protection devices on electrical tree networks: a heuristic approach
• Multiobjective service restoration in electric distribution networks using a local search based heuristic
• Path relinking, cycle-based neighbourhoods and capacitated multicommodity network design
• Heuristic for solving capacitor allocation problems in electric energy radial distribution networks

zbMATH Keywords

metaheuristicspath relinkingpower systems reliabilitysample algorithmsswitch allocation

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10)

Cites Work

• A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set
• TTT plots: a perl program to create time-to-target plots

Cited In (2)

• An integrated planning model in centralized power systems
• Switch allocation problem in power distribution systems with distributed generation

Uses Software

• PERL
• TTTPLOTS

This page was built for publication: An iterated sample construction with path relinking method: application to switch allocation in electrical distribution networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339534)