From: An algorithm for solving the bi-objective median path-shaped facility on a tree network
λ | Path P | D(P) | Comment |
---|---|---|---|
λ=1 | \(P_{v_{7},v_{11}}\) | s1=(131,689) | Obtained from minimizing criterion 1 |
λ=0 | \(P_{v_{1},v_{12}}\) | s2=(219,350) | Obtained from minimizing criterion 2 |
\(\lambda =\frac {339}{427}\) | \(P_{v_{7},v_{12}}\) | s3=(169,474) | Supported point between s1 and s2 |
\(\lambda =\frac {215}{253}\) | \(\left \{\begin {array}{c}P_{v_{7},v_{11}} \\ P_{v_{7},v_{12}}\end {array}\right. \) | \(\left \{\begin {array}{c}s^{1}=(131,689) \\ s^{3}=(169,474)\end {array} \right. \) | No supported points between s1 and s3 |
\(\lambda =\frac {124}{174}\) | \(\left \{\begin {array}{c}P_{v_{1},v_{12}} \\ P_{v_{7},v_{12}}\end {array} \right. \) | \(\left \{\begin {array}{c}s^{2}=(219,350) \\ s^{3}=(169,474)\end {array} \right. \) | No supported points between s3 and s2 |