Scribd
Upload
72 views3 pages

Optimization Constraints Analysis

This document contains results from optimization algorithms and genetic algorithms with varying parameters. The objective is to minimize an objective function subject to constraints. Key results include: - Stochastic Quasi-Newton Positioning (SQP) achieved the best objective value of 3120.7084 with 19 function calls and 6 iterations. - Increasing the population size from 10 to 100 for the genetic algorithm improved the objective value slightly from 2989.9417 to 2989.9760 but greatly increased the number of function calls and iterations. - Increasing the penalty multiplier from 2 to 50 for the genetic algorithm slightly worsened the objective value from 2990.1009 to 2989.9318 but improved constraint violation.

Uploaded by

Muhammad Ahsun
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
72 views3 pages

Optimization Constraints Analysis

This document contains results from optimization algorithms and genetic algorithms with varying parameters. The objective is to minimize an objective function subject to constraints. Key results include: - Stochastic Quasi-Newton Positioning (SQP) achieved the best objective value of 3120.7084 with 19 function calls and 6 iterations. - Increasing the population size from 10 to 100 for the genetic algorithm improved the objective value slightly from 2989.9417 to 2989.9760 but greatly increased the number of function calls and iterations. - Increasing the penalty multiplier from 2 to 50 for the genetic algorithm slightly worsened the objective value from 2990.1009 to 2989.9318 but improved constraint violation.

Uploaded by

Muhammad Ahsun
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Description ARSM SQP MFD GA

Objective, f ( A ) 3209.6732 3120.7084 3167.5943 2990.2354


Constraint_1, g1 ( A ) ≤ 0 -163.2769 -1.32e-05 -1920.1339 -52.2653
Constraint_2, g2 ( A )≤ 0 -1701.7644 -2.12e-06 -29.106032 -47922.556
Constraint_3, g3 ( A )≤ 0 -3674.7643 -2901.9298 -3590.5969 -8036.6942
Constraint_4, g4 ( A ) ≤ 0 -41826.723 -42000.000 -40079.866 -41947.735
Constraint_5, g5 ( A )≤ 0 -46298.236 -48000.000 -47970.894 -77.444210
Constraint_6, g6 ( A )≤ 0 -38325.236 -39098.070 -38409.403 -33963.306
DesVar_1, A1 13.2826 12.6045 12.3637 23.269723
DesVar_1, A2 17.1036 16.9114 17.5565 6.02966
Number of Calls None 19 37 1062
Total Number of Iteration 14 6 10 20

Description Population Size


10 20 50 100
Objective,f ( A) 2989.9417 2990.1009 2989.9760 2989.9760
Constraint_1, g1 ( A )≤ 0 -48.8417 -49.13104 -49.3857 -49.038
Constraint_2, g2 ( A )≤ 0 -47929.018 -47914.850 -47929.246 -47928.348
Constraint_3, g3 ( A )≤ 0 -8034.5819 -8034.7265 -8034.9206 -8034.7024
Constraint_4, g4 ( A ) ≤ 0 -41951.158 -41950.869 -41950.614 -41950.962
Constraint_5, g5 ( A )≤ 0 -70.982044 -85.149716 -70.753963 -71.651905
Constraint_6, g6 ( A )≤ 0 -33965.418 -33965.273 -33965.079 -33965.298
DesVar_1, A1 23.2676 23.2676 23.2680 23.26778
DesVar_1, A2 6.02886 6.03031 6.0288 6.0289
Number of Calls 485 1692 1075 2866
Total Number of Iteration 40 30 20 30
Description Discrete States
128 1024 256 512
Objective,f ( A) 2994.7110 2990.1009 2994.1979 2992.8265
Constraint_1, g1 ( A )≤ 0 -62.0731 -49.13104 -109.78635 -85.7827
Constraint_2, g2 ( A )≤ 0 -47538.791 -47914.850 -47913.303 -47888.420
Constraint_3, g3 ( A )≤ 0 -8041.8252 -8034.7265 -8072.4304 -8057.4464
Constraint_4, g4 ( A ) ≤ 0 -41937.927 -41950.869 -41890.214 -41914.217
Constraint_5, g5 ( A )≤ 0 -461.20962 -85.149716 -86.696 -111.57976
Constraint_6, g6 ( A )≤ 0 -33958.175 -33965.273 -33927.570 -33942.554
DesVar_1, A1 23.2708 23.2676 23.3056 23.2902
DesVar_1, A2 6.0692 6.03031 6.0330 6.0345
Number of Calls 1053 1692 1607 1602
Total Number of Iteration 20 30 30 30
Description Discrete States
0.001 0.01 0.02 0.05
Objective,f ( A) 2989.9234 2990.1009 2989.9032 2990.0742
Constraint_1, g1 ( A )≤ 0 -49.02260 -49.13104 -48.8788 -48.7079
Constraint_2, g2 ( A ) ≤ 0 -47932.103 -47914.850 -47933.171 -47914.673
Constraint_3, g3 ( A )≤ 0 -8034.7020 -8034.7265 -8034.6153 -8034.4630
Constraint_4, g4 ( A ) ≤ 0 -41950.977 -41950.869 -41951.121 -41951.292
Constraint_5, g5 ( A )≤ 0 -67.8968 -85.149716 -66.8285 -85.3271
Constraint_6, g6 ( A )≤ 0 -33965.298 -33965.273 -33965.385 -33965.537
DesVar_1, A1 23.2678 23.2676 23.2677 23.2673
DesVar_1, A2 6.0285 6.03031 6.0284 6.0303
Number of Calls 1132 1692 1675 1135
Total Number of Iteration 20 30 30 20

Description Elite Population


5 10 15 20
Objective, f ( A ) 2989.9032 2989.9276 2989.9032 2989.9032
Constraint_1, g1 ( A )≤ 0 -48.8788 -49.0302 -48.8788 -48.8788
Constraint_2, g2 ( A )≤ 0 -47933.171 -47931.730 -47933.171 -47933.171
Constraint_3, g3 ( A )≤ 0 -8034.6153 -8034.7058 -8034.6153 -8034.6153
Constraint_4, g4 ( A ) ≤ 0 -41951.121 -41950.970 -41951.121 -41951.121
Constraint_5, g5 ( A )≤ 0 -66.82852 -68.2698 -66.828 -66.8285
Constraint_6, g6 ( A )≤ 0 -33965.385 -33965.294 -33965.385 -33965.385
DesVar_1, A1 23.267 23.267 23.267 23.267
DesVar_1, A2 6.028 6.028 6.028 6.028
Number of Calls 1212 1706 1115 1027
Total Number of Iteration 20 30 20 20
Description Number of Contender
2 3 4 5
Objective, f ( A ) 2990.1009 2989.9436 2989.9032 2989.9032
Constraint_1, g1 ( A )≤ 0 -49.13104 -49.1663 -48.8788 -48.8788
Constraint_2, g2 ( A )≤ 0 -47914.850 -47931.035 -47933.171 -47933.171
Constraint_3, g3 ( A )≤ 0 -8034.7265 -8034.7887 -8034.6153 -8034.6153
Constraint_4, g4 ( A ) ≤ 0 -41950.869 -41950.834 -41951.121 -41951.121
Constraint_5, g5 ( A )≤ 0 -85.149716 -68.965 -66.8285 -66.8285
Constraint_6, g6 ( A )≤ 0 -33965.273 -33965.211 -33965.385 -33965.385
DesVar_1, A1 23.2676 23.2678 23.2677 23.2677
DesVar_1, A2 6.03031 6.0286 6.0284 6.0284
Number of Calls 1692 1133 1124 1100
Total Number of Iteration 30 20 20 20
Description Penalty Multiplier
2 10 25 50
Objective, f ( A ) 2990.1009 2989.9070 2989.9032 2989.9318
Constraint_1, g1 ( A )≤ 0 -49.13104 -48.9393 -48.8788 -49.037
Constraint_2, g2 ( A )≤ 0 -47914.850 -47933.197 -47933.171 -47931.357
Constraint_3, g3 ( A )≤ 0 -8034.7265 -8034.6529 -8034.6153 -8034.7096
Constraint_4, g4 ( A ) ≤ 0 -41950.869 -41951.061 -41951.121 -41950.962
Constraint_5, g5 ( A )≤ 0 -85.149716 -66.8031 -66.8285 -68.6428
Constraint_6, g6 ( A )≤ 0 -33965.273 -33965.347 -33965.385 -33965.290
DesVar_1, A1 23.2676 23.267 23.267 23.267
DesVar_1, A2 6.03031 6.0284 6.028 6.0286
Number of Calls 1692 1629 1140 1129
Total Number of Iteration 30 30 20 20
Description Penalty Power
1.0 1.2 1.5 2.0
Objective, f ( A ) 2990.1009 2990.034 3126.8226 3126.4546
Constraint_1, g1 ( A )≤ 0 -49.13104 -50.0810 -225.0649 -95.5096
Constraint_2, g2 ( A )≤ 0 -47914.850 -47928.033 -8.6142 -67.1383
Constraint_3, g3 ( A )≤ 0 -8034.7265 -8035.3499 -2988.7284 -2966.1956
Constraint_4, g4 ( A ) ≤ 0 -41950.869 -41949.919 -41774.935 -41904.490
Constraint_5, g5 ( A )≤ 0 -85.149716 -71.9669 -47991.386 -47932.862

You might also like