Table IV

Result of the computational experiments- comparative analysis for MP and constraint-driven approach

MPConstraint-driven approach
ExampleFcTVCFcTVC
N(1)70694875,67856,7567063688845
N(15)819210875,67878,45681931,717903
N(50)4,979556875,67894,5654,97939,6018,745
N(67)5,310886875,678123,6545,310411,7889,756
N(80)5,632996875,678145,6755,632513,2279,821
N(100)5,6961,276875,678148,4565,696415,5359,886
N(125)6,3091,456875,678148,7566,309717,8149,888
N(150)7,098a1,500b875,678149,5677,098619,9209,892
N(200)8,456a1,500b875,678152,3457,715724,1209,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

or Create an Account

Close Modal
Close Modal