IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v189y2008i3p694-705.html
   My bibliography  Save this article

Multiobjective service restoration in electric distribution networks using a local search based heuristic

Author

Listed:
  • Garcia, Viní­cius Jacques
  • França, Paulo Morelato

Abstract

Contingency situations may cause emergency states in distribution systems; these states are defined as the interruption of power supply. Such situations should be avoided whenever possible in order to maintain certain quality limits related to frequency and duration of interruptions. The main objective of service restoration is to minimize the number of consumers affected by the fault, by transferring them to energized support feeders. Electrical and operational conditions, such as radial network configuration, equipment and voltage drop limits, must be respected. This paper presents a new multiobjective local search based heuristic for the restoration of service which considers the minimization of two conflicting criteria: the load not supplied and the number of switching operations involved. Computational experiments with three network systems have shown the flexibility and effectiveness of the proposed method.

Suggested Citation

  • Garcia, Viní­cius Jacques & França, Paulo Morelato, 2008. "Multiobjective service restoration in electric distribution networks using a local search based heuristic," European Journal of Operational Research, Elsevier, vol. 189(3), pages 694-705, September.
    • Handle: RePEc:eee:ejores:v:189:y:2008:i:3:p:694-705
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(06)01178-7
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Matthias Ehrgott & Xavier Gandibleux, 2004. "Approximative solution methods for multiobjective combinatorial optimization," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 12(1), pages 1-63, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Vizcaino González, José Federico & Lyra, Christiano & Usberti, Fábio Luiz, 2012. "A pseudo-polynomial algorithm for optimal capacitor placement on electric power distribution networks," European Journal of Operational Research, Elsevier, vol. 222(1), pages 149-156.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Aritra Pal & Hadi Charkhgard, 2019. "A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 115-133, February.
    2. T. Gómez & M. Hernández & J. Molina & M. León & E. Aldana & R. Caballero, 2011. "A multiobjective model for forest planning with adjacency constraints," Annals of Operations Research, Springer, vol. 190(1), pages 75-92, October.
    3. M. Ehrgott & J. Puerto & A. M. Rodríguez-Chía, 2007. "Primal-Dual Simplex Method for Multiobjective Linear Programming," Journal of Optimization Theory and Applications, Springer, vol. 134(3), pages 483-497, September.
    4. Tobias Kuhn & Stefan Ruzika, 2017. "A coverage-based Box-Algorithm to compute a representation for optimization problems with three objective functions," Journal of Global Optimization, Springer, vol. 67(3), pages 581-600, March.
    5. Luis Paquete & Tommaso Schiavinotto & Thomas Stützle, 2007. "On local optima in multiobjective combinatorial optimization problems," Annals of Operations Research, Springer, vol. 156(1), pages 83-97, December.
    6. Delorme, Xavier & Gandibleux, Xavier & Degoutin, Fabien, 2010. "Evolutionary, constructive and hybrid procedures for the bi-objective set packing problem," European Journal of Operational Research, Elsevier, vol. 204(2), pages 206-217, July.
    7. Herbert Dawid & Reinhold Decker & Thomas Hermann & Hermann Jahnke & Wilhelm Klat & Rolf König & Christian Stummer, 2017. "Management science in the era of smart consumer products: challenges and research perspectives," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(1), pages 203-230, March.
    8. Hanne, Thomas, 2007. "A multiobjective evolutionary algorithm for approximating the efficient set," European Journal of Operational Research, Elsevier, vol. 176(3), pages 1723-1734, February.
    9. Francis Sourd & Olivier Spanjaard, 2008. "A Multiobjective Branch-and-Bound Framework: Application to the Biobjective Spanning Tree Problem," INFORMS Journal on Computing, INFORMS, vol. 20(3), pages 472-484, August.
    10. Dubois-Lacoste, Jérémie & López-Ibáñez, Manuel & Stützle, Thomas, 2015. "Anytime Pareto local search," European Journal of Operational Research, Elsevier, vol. 243(2), pages 369-385.
    11. H. Edwin Romeijn & Dolores Romero Morales & Wilco Van den Heuvel, 2014. "Computational complexity of finding Pareto efficient outcomes for biobjective lot‐sizing models," Naval Research Logistics (NRL), John Wiley & Sons, vol. 61(5), pages 386-402, August.
    12. Özarık, Sami Serkan & Lokman, Banu & Köksalan, Murat, 2020. "Distribution based representative sets for multi-objective integer programs," European Journal of Operational Research, Elsevier, vol. 284(2), pages 632-643.
    13. Alcaraz, Javier & Landete, Mercedes & Monge, Juan F. & Sainz-Pardo, José L., 2020. "Multi-objective evolutionary algorithms for a reliability location problem," European Journal of Operational Research, Elsevier, vol. 283(1), pages 83-93.
    14. Kallio, Markku & Halme, Merja, 2013. "Cone contraction and reference point methods for multi-criteria mixed integer optimization," European Journal of Operational Research, Elsevier, vol. 229(3), pages 645-653.
    15. Perugia, Alessandro & Moccia, Luigi & Cordeau, Jean-François & Laporte, Gilbert, 2011. "Designing a home-to-work bus service in a metropolitan area," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1710-1726.
    16. Doerner, K.F. & Gutjahr, W.J. & Hartl, R.F. & Strauss, C. & Stummer, C., 2006. "Pareto ant colony optimization with ILP preprocessing in multiobjective project portfolio selection," European Journal of Operational Research, Elsevier, vol. 171(3), pages 830-841, June.
    17. Braekers, Kris & Hartl, Richard F. & Parragh, Sophie N. & Tricoire, Fabien, 2016. "A bi-objective home care scheduling problem: Analyzing the trade-off between costs and client inconvenience," European Journal of Operational Research, Elsevier, vol. 248(2), pages 428-443.
    18. Doerner, K.F. & Gutjahr, W.J. & Hartl, R.F. & Strauss, C. & Stummer, C., 2008. "Nature-inspired metaheuristics for multiobjective activity crashing," Omega, Elsevier, vol. 36(6), pages 1019-1037, December.
    19. F. Zeynep Sargut & Caner Altuntaş & Dilek Cetin Tulazoğlu, 2017. "Multi-objective integrated acyclic crew rostering and vehicle assignment problem in public bus transportation," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(4), pages 1071-1096, October.
    20. Shah, Ruchit & Reed, Patrick, 2011. "Comparative analysis of multiobjective evolutionary algorithms for random and correlated instances of multiobjective d-dimensional knapsack problems," European Journal of Operational Research, Elsevier, vol. 211(3), pages 466-479, June.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:189:y:2008:i:3:p:694-705. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.