Skip to content
naulon
Not checkedNot checked for notices yet.

Multi-objective genetic optimization of linear construction projects

Fatma A. Agrama

HBRC Journal · 2012

doi:10.1016/j.hbrcj.2012.09.010 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

In the real world, the majority cases of optimization problems, met by engineers, are composed of several conflicting objectives. This paper presents an approach for a multi-objective optimization model for scheduling linear construction projects. Linear construction projects have many identical units wherein activities repeat from one unit to another. Highway, pipeline, and tunnels are good examples that exhibit repetitive characteristics. These projects represent a large portion of the construction industry. The present model enables construction planners to generate optimal/near-optimal construction plans that minimize project duration, total work interruptions, and total number of crews. Each of these plans identifies, from a set of feasible alternatives, optimal crew synchronization for each activity and activity interruptions at each unit. This model satisfies the following aspects: (1) it is based on the line of balance technique; (2) it considers non-serial typical activities networks with finish–start relationship and both lag or overlap time between activities is allowed; (3) it utilizes a multi-objective genetic algorithms approach; (4) it is developed as a spreadsheet template that is easy to use. Details of the model with visual charts are presented. An application example is analyzed to illustrate the use of the model and demonstrate its capabilities in optimizing the scheduling of linear construction projects.

Abstract licence: CC BY-NC-ND

References15

    15 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.