Research Article

A Nonlinear Multiobjective Bilevel Model for Minimum Cost Network Flow Problem in a Large-Scale Construction Project

Table 5

The most time-saving plan for MCNFP in Shuibuya case.

Transportation path 1234567891011

Material volume 950.0001013.517758.507820.24757.7351700.000948.7621056.185253.39241.661647.444
Material volume 265.783354.500308.790329.11545.111573.575492.092422.106157.70721.322363.277
Material volume 427.952324.088400.510476.40339.031523.953354.168405.05448.49128.744222.921
Material volume 293.735334.929390.005432.16538.571602.472398.627315.83156.69639.224199.717

Transportation path 1213141516171819202122

Material volume 1002.556200.4351279.5651380.0001700.0001057.049192.9511150.0001300.000500.306759.694
Material volume 489.996100.614337.177417.547552.807274.888127.423337.068377.977274.467369.143
Material volume 402.297109.078535.589454.315539.657493.531131.399451.603525.488255.822299.626
Material volume 265.07431.314406.799508.137607.536439.66047.452361.329396.53565.138331.525