IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v14y2022i24p16457-d997897.html
   My bibliography  Save this article

Optimal Design of an Inductive MHD Electric Generator

Author

Listed:
  • Sara Carcangiu

    (Electrical and Electronic Engineering Department, University of Cagliari, Via Marengo, 2, 09123 Cagliari, Italy)

  • Alessandra Fanni

    (Electrical and Electronic Engineering Department, University of Cagliari, Via Marengo, 2, 09123 Cagliari, Italy)

  • Augusto Montisci

    (Electrical and Electronic Engineering Department, University of Cagliari, Via Marengo, 2, 09123 Cagliari, Italy)

Abstract

In this paper, the problem of optimizing the design of an inductive Magneto-Hydro-Dynamic (MHD) electric generator is formalized as a multi-objective optimization problem where the conflicting objectives consist of maximizing the output power while minimizing the hydraulic losses and the mass of the apparatus. In the proposal, the working fluid is ionized with periodical pulsed discharges and the resulting neutral plasma is unbalanced by means of an intense DC electrical field. The gas is thus split into two charged streams, which induce an electromotive force into a magnetically coupled coil. The resulting generator layout does not require the use of superconducting coils and allows you to manage the issues related to the conductivity of the gas and the corrosion of the electrodes, which are typical limits of the MHD generators. A tailored multi-objective optimization algorithm, based on the Tabu Search meta-heuristics, has been implemented, which returns a set of Pareto optimal solutions from which it is possible to choose the optimal solution according to further applicative or performance constraints.

Suggested Citation

  • Sara Carcangiu & Alessandra Fanni & Augusto Montisci, 2022. "Optimal Design of an Inductive MHD Electric Generator," Sustainability, MDPI, vol. 14(24), pages 1-17, December.
  • Handle: RePEc:gam:jsusta:v:14:y:2022:i:24:p:16457-:d:997897
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/14/24/16457/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/14/24/16457/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Karamichailidou, Despina & Kaloutsa, Vasiliki & Alexandridis, Alex, 2021. "Wind turbine power curve modeling using radial basis function neural networks and tabu search," Renewable Energy, Elsevier, vol. 163(C), pages 2137-2152.
    2. Roberto Battiti & Giampietro Tecchiolli, 1994. "The Reactive Tabu Search," INFORMS Journal on Computing, INFORMS, vol. 6(2), pages 126-140, May.
    Full references (including those not matched with items on IDEAS)

    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. Shen, Liji & Buscher, Udo, 2012. "Solving the serial batching problem in job shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 221(1), pages 14-26.
    2. Nha Vo‐Thanh & Hans‐Peter Piepho, 2023. "Generating designs for comparative experiments with two blocking factors," Biometrics, The International Biometric Society, vol. 79(4), pages 3574-3585, December.
    3. Buscher, Udo & Shen, Liji, 2009. "An integrated tabu search algorithm for the lot streaming problem in job shops," European Journal of Operational Research, Elsevier, vol. 199(2), pages 385-399, December.
    4. Luca Maria Gambardella & Marco Dorigo, 2000. "An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 237-255, August.
    5. Mohammad Hassan Salmani & Kourosh Eshghi, 2017. "A Metaheuristic Algorithm Based on Chemotherapy Science: CSA," Journal of Optimization, Hindawi, vol. 2017, pages 1-13, February.
    6. Vittorio Maniezzo, 1999. "Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem," INFORMS Journal on Computing, INFORMS, vol. 11(4), pages 358-369, November.
    7. Li, Mingjie & Hao, Jin-Kao & Wu, Qinghua, 2024. "A flow based formulation and a reinforcement learning based strategic oscillation for cross-dock door assignment," European Journal of Operational Research, Elsevier, vol. 312(2), pages 473-492.
    8. Rex K. Kincaid & Keith E. Laba & Sharon L. Padula, 1997. "Quelling Cabin Noise in Turboprop Aircraft via Active Control," Journal of Combinatorial Optimization, Springer, vol. 1(3), pages 229-250, October.
    9. Tiago Maritan Ugulino Araújo & Lisieux Marie M. S. Andrade & Carlos Magno & Lucídio Anjos Formiga Cabral & Roberto Quirino Nascimento & Cláudio N. Meneses, 2016. "DC-GRASP: directing the search on continuous-GRASP," Journal of Heuristics, Springer, vol. 22(4), pages 365-382, August.
    10. C Alabas-Uslu, 2008. "A self-tuning heuristic for a multi-objective vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(7), pages 988-996, July.
    11. Juan Carlos Duque & Raúl Ramos & Jordi Suriñach, 2007. "Supervised Regionalization Methods: A Survey," International Regional Science Review, , vol. 30(3), pages 195-220, July.
    12. G W Kinney & R R Hill & J T Moore, 2005. "Devising a quick-running heuristic for an unmanned aerial vehicle (UAV) routing system," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(7), pages 776-786, July.
    13. J.C. James & S. Salhi, 2002. "A Tabu Search Heuristic for the Location of Multi-Type Protection Devices on Electrical Supply Tree Networks," Journal of Combinatorial Optimization, Springer, vol. 6(1), pages 81-98, March.
    14. Mario Inostroza-Ponta & Regina Berretta & Pablo Moscato, 2011. "QAPgrid: A Two Level QAP-Based Approach for Large-Scale Data Analysis and Visualization," PLOS ONE, Public Library of Science, vol. 6(1), pages 1-18, January.
    15. Michel Gendreau & Jean-Yves Potvin, 2005. "Metaheuristics in Combinatorial Optimization," Annals of Operations Research, Springer, vol. 140(1), pages 189-213, November.
    16. Zhang, Ruiyou & Zhao, Haishu & Moon, Ilkyeong, 2018. "Range-based truck-state transition modeling method for foldable container drayage services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 225-239.
    17. Liji Shen & Jatinder N. D. Gupta, 2018. "Family scheduling with batch availability in flow shops to minimize makespan," Journal of Scheduling, Springer, vol. 21(2), pages 235-249, April.
    18. N Wassan, 2007. "Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(12), pages 1630-1641, December.
    19. Shen, Liji & Dauzère-Pérès, Stéphane & Maecker, Söhnke, 2023. "Energy cost efficient scheduling in flexible job-shop manufacturing systems," European Journal of Operational Research, Elsevier, vol. 310(3), pages 992-1016.
    20. Swan, Jerry & Adriaensen, Steven & Brownlee, Alexander E.I. & Hammond, Kevin & Johnson, Colin G. & Kheiri, Ahmed & Krawiec, Faustyna & Merelo, J.J. & Minku, Leandro L. & Özcan, Ender & Pappa, Gisele L, 2022. "Metaheuristics “In the Large”," European Journal of Operational Research, Elsevier, vol. 297(2), pages 393-406.

    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:gam:jsusta:v:14:y:2022:i:24:p:16457-:d:997897. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.