IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v18y2025i18p5040-d1755187.html
   My bibliography  Save this article

Energy-Constrained Optimization of Data Center Layouts: An Integer Linear Programming Approach

Author

Listed:
  • Jing Liang

    (School of Economics, Wuhan University of Technology, Wuhan 430070, China)

  • Donglin Chen

    (School of Economics, Wuhan University of Technology, Wuhan 430070, China)

  • Shangying Xu

    (School of Economics, Wuhan University of Technology, Wuhan 430070, China)

Abstract

Optimizing the layout of data centers is important for the rapid development of digital infrastructure, while also addressing the issues of energy consumption, environmental sustainability, and geographic resource distribution. Traditional strategies usually focus only on the distance to demand centers and ignore the energy and environmental costs of data centers in densely populated areas. In this paper, we propose a layout optimization model based on energy consumption constraints that combines integer linear programming with binary decision variables. The model combines energy efficiency, renewable resource availability, and regional characteristics to balance economic benefits and environmental impacts, consistent with the “East data, West computing” project. The experimental results showed that the energy efficient scenario consistently reduced costs, from ¥3.68 × 10 8 to ¥3.08 × 10 8 without energy constraints, and from ¥4.08 × 10 8 to ¥3.47 × 10 8 under energy consumption constraints. Additionally, energy constraints increased the number of required data centers from two to three. The results of the study emphasized the importance of strategic siting, especially in low electricity price areas, in order to optimize the layout and improve sustainability.

Suggested Citation

  • Jing Liang & Donglin Chen & Shangying Xu, 2025. "Energy-Constrained Optimization of Data Center Layouts: An Integer Linear Programming Approach," Energies, MDPI, vol. 18(18), pages 1-20, September.
  • Handle: RePEc:gam:jeners:v:18:y:2025:i:18:p:5040-:d:1755187
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/18/18/5040/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1996-1073/18/18/5040/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:gam:jeners:v:18:y:2025:i:18:p:5040-:d:1755187. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.