A Multimodal Passenger-and-Package Sharing Network for Urban Logistics

Table 3

Comparison of results and computation times of the algorithms.

Scale of the problem	Exact algorithm in CPLEX			Modified GA
	Computation time (min)	Best solution	Gap (%)	Computation time (min)	Best solution
(40, 28, 5)	8.6	83,139	0.0	26.7	83,139
(40, 28, 15)	15.4	159,712	0.0	46.6	159,712
(70, 30, 8)	201.5	358,149	0.0	183.9	358,656
(70, 40, 14)	1,440.0	378,673	3.1	892.4	374,123
(100, 30, 15)	1,440.0	818,480	5.6	1,056.1	782,291
(100, 75, 15)	1,440.0	700,527	14.8	1,440.0	670,920
(110, 30, 15)	1,440.0	901,690	20.5	1,440.0	858,458
(110, 80, 20)	1,440.0	n.f.s.p.	9.0	1,440.0	781,913
(127, 94, 15)	1,440.0	n.f.s.p.	23.3	1,440.0	973,549
(127, 94, 20)	1,440.0	n.f.s.p.	13.4	1,440.0	977,518

The upper time limit, i.e., 24 hours; n.f.s.p.: no feasible solution provided.