Research Article

A Hyperheuristic Approach for Location-Routing Problem of Cold Chain Logistics considering Fuel Consumption

Table 3

Comparison between algorithms MOHH and NSGA-II in solution results.

InstanceSolution algorithmNPSDistribution timeTotal cost
Min.Max.Min.Max.

R101MOHH61222.11374.316523.018479.0
NSGA-II52045.72343.517410.518215.5

R102MOHH61193.81339.016525.118208.2
NSGA-II62113.92222.716868.017499.2

R103MOHH51179.21336.016310.718164.6
NSGA-II42173.32241.716920.818929.3

R104MOHH51166.01262.816108.618826.3
NSGA-II32127.32149.919552.719915.6

R105MOHH51157.31301.616927.017444.0
NSGA-II42137.22222.717760.518476.2

R106MOHH61207.81288.915714.216235.3
NSGA-II52248.82603.417007.017393.8

R107MOHH61178.81312.715500.917250.4
NSGA-II52106.42134.615368.016041.6

R108MOHH31135.01184.113818.215053.1
NSGA-II52135.22472.415600.016038.5

R109MOHH51229.41406.016358.518889.2
NSGA-II42053.32383.115302.515932.8