Result of the computational experiments- comparative analysis for MP and constraint-driven approach
| MP | Constraint-driven approach | |||||||
|---|---|---|---|---|---|---|---|---|
| Example | Fc | T | V | C | Fc | T | V | C |
| N(1) | 706 | 94 | 875,678 | 56,756 | 706 | 3 | 688 | 845 |
| N(15) | 819 | 210 | 875,678 | 78,456 | 819 | 3 | 1,717 | 903 |
| N(50) | 4,979 | 556 | 875,678 | 94,565 | 4,979 | 3 | 9,601 | 8,745 |
| N(67) | 5,310 | 886 | 875,678 | 123,654 | 5,310 | 4 | 11,788 | 9,756 |
| N(80) | 5,632 | 996 | 875,678 | 145,675 | 5,632 | 5 | 13,227 | 9,821 |
| N(100) | 5,696 | 1,276 | 875,678 | 148,456 | 5,696 | 4 | 15,535 | 9,886 |
| N(125) | 6,309 | 1,456 | 875,678 | 148,756 | 6,309 | 7 | 17,814 | 9,888 |
| N(150) | 7,098a | 1,500b | 875,678 | 149,567 | 7,098 | 6 | 19,920 | 9,892 |
| N(200) | 8,456a | 1,500b | 875,678 | 152,345 | 7,715 | 7 | 24,120 | 9,896 |
| MP | Constraint-driven approach | |||||||
|---|---|---|---|---|---|---|---|---|
| Example | Fc | Fc | ||||||
| N(1) | 706 | 94 | 875,678 | 56,756 | 706 | 3 | 688 | 845 |
| 819 | 210 | 875,678 | 78,456 | 819 | 3 | 1,717 | 903 | |
| 4,979 | 556 | 875,678 | 94,565 | 4,979 | 3 | 9,601 | 8,745 | |
| 5,310 | 886 | 875,678 | 123,654 | 5,310 | 4 | 11,788 | 9,756 | |
| 5,632 | 996 | 875,678 | 145,675 | 5,632 | 5 | 13,227 | 9,821 | |
| 5,696 | 1,276 | 875,678 | 148,456 | 5,696 | 4 | 15,535 | 9,886 | |
| 6,309 | 1,456 | 875,678 | 148,756 | 6,309 | 7 | 17,814 | 9,888 | |
| 7,098a | 1,500b | 875,678 | 149,567 | 7,098 | 6 | 19,920 | 9,892 | |
| 8,456a | 1,500b | 875,678 | 152,345 | 7,715 | 7 | 24,120 | 9,896 | |
Notes: Fc: objective function; T: time of finding solution (in seconds); V: the number of decision variables; C: the number of constrains. aFeasible solution (not found optimality); binterrupt the process of finding a solution after a given time 1,500 s