An improved multi-objective animated oat optimization algorithm for resource-constrained construction project organization design

Why Building Schedules Need Smarter Planning

When a new apartment block or housing complex goes up in a crowded city, getting the schedule wrong can mean spiraling costs, idle workers one week and shortages the next, and angry residents waiting for keys. This paper introduces a new computer-based planning method that treats construction scheduling like a complex puzzle with many trade-offs—how long the project takes, how much it costs, and how smoothly workers are used—and shows how a nature-inspired algorithm can find better solutions than today’s tools.

Big City Projects, Tangled Goals

Modern construction projects must juggle several goals at once. Developers want buildings finished quickly to start generating income. Contractors must hold down costs to stay profitable. Site managers need to keep crews busy but not overworked, coping with limits on how many workers are available each day. Traditional planning techniques, like hand-crafted Gantt charts or simple software rules, often treat one goal at a time—typically total project duration—and lean heavily on experience. In complex urban projects with tight deadlines and limited labor, this can lead to delays, cost overruns, and chaotic swings in workforce demand from day to day.

Learning from Rolling Seeds

The study builds on a relatively new “bio-inspired” optimization method called Animated Oat Optimization, which mimics how wild oat seeds roll and catapult themselves across the ground to find good spots to sprout. In the original version, this behavior was used to solve single-goal problems: the seeds wander widely at first (exploring) and then settle into promising areas (fine-tuning). The authors extend this idea so it can handle several goals at once, creating what they call the Multi-Objective Animated Oat Optimization algorithm, or MOAOO. Instead of hunting for one “best” answer, the method searches for a family of schedules that each balances time, cost, and workforce smoothness in different ways.

Turning Construction into a Search Problem

To apply the method, the researchers first translate a real small residential building project in Chengdu, China, into a mathematical model. Each construction task—such as earth excavation, foundations, structural work, and equipment installation—has a start time, a duration, and a number of workers assigned. Tasks must follow logical order (you can’t build walls before the foundation), and there is a daily upper limit on the available workforce. The model tracks three things: total project duration, total cost (mainly labor plus a fixed amount per task and overtime penalties), and how much the total number of workers on site varies from day to day. A smooth worker curve means fewer peaks and valleys, which is easier on hiring, training, and overtime.

How the New Algorithm Explores Options

MOAOO unleashes a population of “candidate schedules,” each represented like a rolling seed in a multi-dimensional space. In each round of computation, some candidates are nudged randomly to explore new possibilities, while others follow patterns inspired by the physics of rolling and swinging seeds—short adjustments for local improvement and longer leaps to escape dead ends. At the same time, the method keeps an evolving memory of especially good schedules that are not beaten on any of the three goals. These “elite” candidates help steer the search. A layered system checks and repairs violations of task order, timing, and resource limits, and a built-in monitor stops the search early once improvements become tiny, saving computation time.

What the Method Achieves in Practice

Using the Chengdu housing project as a case study, the authors show that MOAOO can quickly generate a wide range of feasible schedules. In their tests, the algorithm typically converged in about 118 rounds of computation. One schedule focused on pure speed cut the project duration by around a fifth compared with the baseline, though at higher cost. Another schedule minimized cost while accepting a longer build time. Most strikingly, a compromise schedule finished the project in 279 days at about $1.34 million, while reducing fluctuations in labor use by 72.7 percent. This means crews are used much more steadily over time, which is attractive for real contractors trying to avoid overtime spikes and idle periods.

Why This Matters for Future Building Projects

Beyond one case, the team tested MOAOO on standard mathematical benchmarks and found it competitive with or better than several well-known multi-goal optimization methods, suggesting the approach is broadly sound. For a layperson, the core message is that construction schedules no longer have to be rigid, hand-tuned compromises. By borrowing ideas from how seeds move in nature, this algorithm can automatically suggest many different plans, each trading off time, money, and workforce stability in a transparent way. Project managers can then choose a schedule that best fits their priorities and constraints, making urban construction more predictable, efficient, and resilient.

Citation: Xue, Q., Wu, C., Nie, J. et al. An improved multi-objective animated oat optimization algorithm for resource-constrained construction project organization design. Sci Rep 16, 10239 (2026). https://doi.org/10.1038/s41598-026-39502-7

Keywords: construction scheduling, multi-objective optimization, resource management, bio-inspired algorithms, project planning