Optimization of material hoisting operations and storage locations in multi-storey building construction by mixed-integer programming

摘要

Layout design is a typical combinatorial optimization problem in the field of management science with a finite but large number of feasible solutions. There exist many numerical solution methods for this kind of problem. Stochastic solution algorithm such as GA, which is based on probabilistic solution procedures like crossover and mutation, cannot locate the true optimal solution point The problem can also be formulated as a binary-mixed-integer linear problem (BMILP) and can be solved deterministically by standard branch-and-bound techniques locating the true optimal solution point within manageable computational efforts.