IDEAS home Printed from https://ideas.repec.org/a/eee/appene/v278y2020ics0306261920311223.html
   My bibliography  Save this article

Heuristic algorithms for the Wind Farm Cable Routing problem

Author

Listed:
  • Cazzaro, Davide
  • Fischetti, Martina
  • Fischetti, Matteo

Abstract

The Wind Farm Cable Routing problem plays a key role in offshore wind farm design. Given the positions of turbines and substation in a wind farm and a set of electrical cables needed to transfer the electrical power produced by the turbines to the substation, the task is to define a cable-connection tree that minimizes the overall cable cost. In the present paper we describe, implement and test five different metaheuristic schemes for this problem: Simulated Annealing, Tabu Search, Variable Neighborhood Search, Ants Algorithm, and Genetic Algorithm. We also describe a construction heuristic, called Sweep, that typically finds an initial high-quality solution in a very short computing time. We compare the performance of our heuristics on two datasets: one contains instances from the literature and is used as a training set to tune our codes, while the second is a very large new set of realistic instances (that we make publicly available) used as a test set. Some practical recommendations on the proposed heuristics are finally provided: according to our experiments, Variable Neighborhood Search obtains the best overall performance, while Tabu Search is our second best heuristic.

Suggested Citation

  • Cazzaro, Davide & Fischetti, Martina & Fischetti, Matteo, 2020. "Heuristic algorithms for the Wind Farm Cable Routing problem," Applied Energy, Elsevier, vol. 278(C).
    • Handle: RePEc:eee:appene:v:278:y:2020:i:c:s0306261920311223
    DOI: 10.1016/j.apenergy.2020.115617
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0306261920311223
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.apenergy.2020.115617?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    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. Martina Fischetti & Jesper Runge Kristoffersen & Thomas Hjort & Michele Monaci & David Pisinger, 2020. "Vattenfall Optimizes Offshore Wind Farm Design," Interfaces, INFORMS, vol. 50(1), pages 80-94, January.
    2. Wędzik, Andrzej & Siewierski, Tomasz & Szypowski, Michał, 2016. "A new method for simultaneous optimizing of wind farm’s network layout and cable cross-sections by MILP optimization," Applied Energy, Elsevier, vol. 182(C), pages 525-538.
    3. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    4. Martina Fischetti & Michele Monaci, 2016. "Proximity search heuristics for wind farm optimal layout," Journal of Heuristics, Springer, vol. 22(4), pages 459-474, August.
    5. Jack Brimberg & Pierre Hansen & Keh-Wei Lin & Nenad Mladenović & MichÈle Breton, 2003. "An Oil Pipeline Design Problem," Operations Research, INFORMS, vol. 51(2), pages 228-239, April.
    6. Fred Glover, 1990. "Tabu Search: A Tutorial," Interfaces, INFORMS, vol. 20(4), pages 74-94, August.
    7. Martina Fischetti & David Pisinger, 2019. "Mathematical Optimization and Algorithms for Offshore Wind Farm Design: An Overview," Business & Information Systems Engineering: The International Journal of WIRTSCHAFTSINFORMATIK, Springer;Gesellschaft für Informatik e.V. (GI), vol. 61(4), pages 469-485, August.
    8. Jin, Rongsen & Hou, Peng & Yang, Guangya & Qi, Yuanhang & Chen, Cong & Chen, Zhe, 2019. "Cable routing optimization for offshore wind power plants via wind scenarios considering power loss cost model," Applied Energy, Elsevier, vol. 254(C).
    9. Billy E. Gillett & Leland R. Miller, 1974. "A Heuristic Algorithm for the Vehicle-Dispatch Problem," Operations Research, INFORMS, vol. 22(2), pages 340-349, April.
    10. Fred Glover, 1990. "Tabu Search—Part II," INFORMS Journal on Computing, INFORMS, vol. 2(1), pages 4-32, February.
    11. Fischetti, Martina & Pisinger, David, 2018. "Optimizing wind farm cable routing considering power losses," European Journal of Operational Research, Elsevier, vol. 270(3), pages 917-930.
    12. Alain Hertz & Odile Marcotte & Asma Mdimagh & Michel Carreau & François Welt, 2017. "Design of a wind farm collection network when several cable types are available," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(1), pages 62-73, January.
    13. Joanna Bauer & Jens Lysgaard, 2015. "The offshore wind farm array cable layout problem: a planar open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 66(3), pages 360-368, March.
    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. Butterwick, Thomas & Kheiri, Ahmed & Lulli, Guglielmo & Gromicho, Joaquim & Kreeft, Jasper, 2023. "Application of selection hyper-heuristics to the simultaneous optimisation of turbines and cabling within an offshore windfarm," Renewable Energy, Elsevier, vol. 208(C), pages 1-16.
    2. Magnus Daniel Kallinger & José Ignacio Rapha & Pau Trubat Casal & José Luis Domínguez-García, 2023. "Offshore Electrical Grid Layout Optimization for Floating Wind—A Review," Clean Technol., MDPI, vol. 5(3), pages 1-37, June.
    3. Martina Fischetti & Matteo Fischetti, 2023. "Integrated Layout and Cable Routing in Wind Farm Optimal Design," Management Science, INFORMS, vol. 69(4), pages 2147-2164, April.
    4. Lingling Li & Jiarui Pei & Qiang Shen, 2023. "A Review of Research on Dynamic and Static Economic Dispatching of Hybrid Wind–Thermal Power Microgrids," Energies, MDPI, vol. 16(10), pages 1-23, May.
    5. M. Blokland & R. D. van der Mei & J. F. J. Pruyn & J. Berkhout, 2023. "Literature Survey on Automatic Pipe Routing," SN Operations Research Forum, Springer, vol. 4(2), pages 1-56, June.
    6. Song, Dongran & Yan, Jiaqi & Gao, Yang & Wang, Lei & Du, Xin & Xu, Zhiliang & Zhang, Zhihong & Yang, Jian & Dong, Mi & Chen, Yang, 2023. "Optimization of floating wind farm power collection system using a novel two-layer hybrid method," Applied Energy, Elsevier, vol. 348(C).
    7. Aguayo, Maichel M. & Fierro, Pablo E. & De la Fuente, Rodrigo A. & Sepúlveda, Ignacio A. & Figueroa, Dante M., 2021. "A mixed-integer programming methodology to design tidal current farms integrating both cost and benefits: A case study in the Chacao Channel, Chile," Applied Energy, Elsevier, vol. 294(C).
    8. Pedersen, Jaap & Weinand, Jann Michael & Syranidou, Chloi & Rehfeldt, Daniel, 2024. "An efficient solver for large-scale onshore wind farm siting including cable routing," European Journal of Operational Research, Elsevier, vol. 317(2), pages 616-630.

    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. Martina Fischetti & Matteo Fischetti, 2023. "Integrated Layout and Cable Routing in Wind Farm Optimal Design," Management Science, INFORMS, vol. 69(4), pages 2147-2164, April.
    2. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    3. Dimitris Fouskakis & David Draper, 2002. "Stochastic Optimization: a Review," International Statistical Review, International Statistical Institute, vol. 70(3), pages 315-349, December.
    4. Lin Xie & Marius Merschformann & Natalia Kliewer & Leena Suhl, 2017. "Metaheuristics approach for solving personalized crew rostering problem in public bus transit," Journal of Heuristics, Springer, vol. 23(5), pages 321-347, October.
    5. Shao, Saijun & Xu, Gangyan & Li, Ming & Huang, George Q., 2019. "Synchronizing e-commerce city logistics with sliding time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 123(C), pages 17-28.
    6. R Logendran & Y Karim, 2003. "Design of manufacturing cells in the presence of alternative cell locations and material transporters," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 54(10), pages 1059-1075, October.
    7. Hai Wang, 2019. "Routing and Scheduling for a Last-Mile Transportation System," Service Science, INFORMS, vol. 53(1), pages 131-147, February.
    8. U Derigs & K Reuter, 2009. "A simple and efficient tabu search heuristic for solving the open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(12), pages 1658-1669, December.
    9. Mohammad Javad Feizollahi & Igor Averbakh, 2014. "The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 321-335, May.
    10. C N Potts & V A Strusevich, 2009. "Fifty years of scheduling: a survey of milestones," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(1), pages 41-68, May.
    11. Huang, Yeran & Yang, Lixing & Tang, Tao & Gao, Ziyou & Cao, Fang, 2017. "Joint train scheduling optimization with service quality and energy efficiency in urban rail transit networks," Energy, Elsevier, vol. 138(C), pages 1124-1147.
    12. B Dengiz & C Alabas-Uslu & O Dengiz, 2009. "Optimization of manufacturing systems using a neural network metamodel with a new training approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1191-1197, September.
    13. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    14. Yuanhang Qi & Peng Hou & Guisong Liu & Rongsen Jin & Zhile Yang & Guangya Yang & Zhaoyang Dong, 2021. "Cable Connection Optimization for Heterogeneous Offshore Wind Farms via a Voronoi Diagram Based Adaptive Particle Swarm Optimization with Local Search," Energies, MDPI, vol. 14(3), pages 1-21, January.
    15. Joseph B. Mazzola & Robert H. Schantz, 1997. "Multiple‐facility loading under capacity‐based economies of scope," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(3), pages 229-256, April.
    16. Abdmouleh, Zeineb & Gastli, Adel & Ben-Brahim, Lazhar & Haouari, Mohamed & Al-Emadi, Nasser Ahmed, 2017. "Review of optimization techniques applied for the integration of distributed generation from renewable energy sources," Renewable Energy, Elsevier, vol. 113(C), pages 266-280.
    17. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    18. Chris S. K. Leung & Henry Y. K. Lau, 2018. "Multiobjective Simulation-Based Optimization Based on Artificial Immune Systems for a Distribution Center," Journal of Optimization, Hindawi, vol. 2018, pages 1-15, May.
    19. Ilfat Ghamlouche & Teodor Gabriel Crainic & Michel Gendreau, 2003. "Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design," Operations Research, INFORMS, vol. 51(4), pages 655-667, August.
    20. Joaquín Pacheco & Rafael Caballero & Manuel Laguna & Julián Molina, 2013. "Bi-Objective Bus Routing: An Application to School Buses in Rural Areas," Transportation Science, INFORMS, vol. 47(3), pages 397-411, August.

    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:appene:v:278:y:2020:i:c:s0306261920311223. 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/wps/find/journaldescription.cws_home/405891/description#description .

    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.