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

Table 5

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

	Solution
1	The solution with the smallest in the Pareto solution set	2469.860	674.201
	The optimal solution obtained when only optimizing	2389.414	1051.805
2	The solution with the smallest in the Pareto solution set	3163.406	360.986
	The optimal solution obtained when only optimizing	3853.712	217.999
3	The solution with the smallest in the Pareto solution set	2483.145	547.795
	The optimal solution obtained when optimizing	2483.145	547.795