Bi-Objective Optimization for Vehicle Routing Problems with a Mixed Fleet of Conventional and Electric Vehicles and Soft Time Windows

Table 6

Comparison of single-objective optimization and Pareto solution set for Instance II and Instance III.

<!C Cnt:6> Solution		Instance II		Instance III
		1	The solution with the smallest in the Pareto solution set	4869.104	2219.836	9107.542	2137.740
The optimal solution obtained when only optimizing	4619.759		2508.618	8538.144	4890.566
2	The solution with the smallest in the Pareto solution set	5272.350	771.920	10331.627	1801.689
	The optimal solution obtained when only optimizing	7989.809	539.332	14335.238	1100.925
3	The solution with the smallest in the Pareto solution set	5093.728	818.227	9120.650	2064.374
	The optimal solution obtained when optimizing	5093.728	818.227	9120.650	2064.374