Research Article

Metaheuristic Algorithm for Solving Biobjective Possibility Planning Model of Location-Allocation in Disaster Relief Logistics

Table 6

The optimum factor for genetic algorithm and simulated annealing.

Problem sizeFactorsLevel 1Level 2Level 3Optimum factor

Genetic algorithmMean / ratioSmall −4.0524−3.9078−3.6780
−4.5873−3.7776−3.2731
−3.9725−3.9144−3.7512
−4.0079−3.7381−3.8921
Large −5.5750−5.4837−5.4807
−6.0750−5.4906−4.9739
−5.6615−5.4169−5.4610
−5.5713−5.3525−5.6156
Mean objective functionSmall 0.63010.63950.6558
0.59140.64790.6861
0.63600.63910.6502
0.63340.65140.6405
Large 0.52860.53390.5345
0.49950.53230.5641
0.52350.53800.5345
0.52900.54120.5258

Simulated annealingMean / ratioSmall −4.1877−4.0033−3.7003
−4.1164−3.9694−3.8055
−4.1038−3.7080−4.0795
−4.4123−4.0730−3.4060
Large −6.4144−6.0149−5.4369
−6.2095−6.0824−5.5743
−5.9112−5.8779−6.0771
−6.3202−5.8310−5.7150
Mean objective functionSmall 0.62090.63270.6544
0.62620.63530.6464
0.62720.65370.6270
0.60480.62720.6760
Large 0.48170.50320.5351
0.49250.50060.5269
0.51000.51080.4993
0.48800.51310.5189