^ Developing Shuffled Frog-Leaping Algorithm (SFLA) Method to Solve Power Load-Constrained TCRTO Problems in Civil Engineering | Structurae
0
  • DE
  • EN
  • FR
  • Internationale Datenbank und Galerie für Ingenieurbauwerke

Anzeige

Developing Shuffled Frog-Leaping Algorithm (SFLA) Method to Solve Power Load-Constrained TCRTO Problems in Civil Engineering

Autor(en):







Medium: Fachartikel
Sprache(n): Englisch
Veröffentlicht in: Advances in Civil Engineering, , v. 2019
Seite(n): 1-16
DOI: 10.1155/2019/1404636
Abstrakt:

It is extensively acknowledged that excessive on-site electricity power load often causes power failure across a construction site and surrounding residential zones and can result in unforeseen schedule delay, construction quality problems, life inconvenience, and even property loss. However, energy management, such as power load optimization, has long been ignored in construction scheduling. This study aims to develop a modified shuffled frog-leaping algorithm (SFLA) approach in project scheduling to aid decision-makers in identifying the best Pareto solution for time-cost-resource trade-off (TCRTO) problems under the constraint of precedence, resource availability, and on-site peak electricity power load. A mathematical model including three objective functions and five constraints was established followed by the application of the modified SLFA on real-case multiobjective optimization problems in construction scheduling. The performance of SLFA was compared with that of the nondominated sorting genetic algorithm (NSGA II). The results showed that the developed new approach was superior in identifying optimal project planning solutions, which could essentially assist on-site power load-oriented schedule decision-making for construction teams.

Copyright: © 2019 Xingyu Tao et al.
Lizenz:

Dieses Werk wurde unter der Creative-Commons-Lizenz Namensnennung 4.0 International (CC-BY 4.0) veröffentlicht und darf unter den Lizenzbedinungen vervielfältigt, verbreitet, öffentlich zugänglich gemacht, sowie abgewandelt und bearbeitet werden. Dabei muss der Urheber bzw. Rechteinhaber genannt und die Lizenzbedingungen eingehalten werden.

  • Über diese
    Datenseite
  • Reference-ID
    10312864
  • Veröffentlicht am:
    09.05.2019
  • Geändert am:
    02.06.2021