Feasible Initial Population with Genetic Diversity for a Population-Based Algorithm Applied to the Vehicle Routing Problem with Time Windows

Table 1

Average of 30 executions per benchmark for calculation of Hamming distance for the Solomon’s benchmarks.

Instance	NN	D/S	S	1-1 and 2-2	Hybrid
Type 1 (Hamming distance)
C101	20	29	30	28	36
C102	18	31	22	34	38
C103	21	20	21	26	31
C104	24	25	23	24	27
C105	21	23	25	29	32
C106	22	21	24	22	26
C107	18	19	24	20	24
C108	25	24	29	28	32
C109	23	25	30	29	30
R101	32	44	39	40	45
R102	38	42	41	45	49
R103	35	40	43	41	43
R104	41	43	45	47	48
R105	38	38	39	40	40
R106	41	40	43	46	46
R107	40	45	42	46	49
R108	43	46	44	45	47
R109	35	37	41	40	42
R110	39	42	45	46	49
R111	39	40	43	41	43
R112	36	39	44	43	45
RC101	39	36	39	38	42
RC102	36	37	40	39	44
RC103	35	37	37	39	41
RC104	34	34	36	40	40
RC105	39	41	40	41	45
RC106	35	34	36	38	38
RC107	32	34	40	38	40
RC108	34	35	38	37	39
Type 2 (Hamming distance)
C201	33	35	36	36	41
C202	35	35	36	39	45
C203	35	36	42	44	44
C204	38	39	42	41	46
C205	34	37	40	43	47
C206	32	34	35	37	42
C207	34	38	40	42	42
C208	36	40	42	40	46
R201	50	51	54	50	55
R202	49	50	52	52	57
R203	50	50	51	51	54
R204	56	58	58	60	60
R205	52	55	58	55	59
R206	49	52	55	51	55
R207	48	51	54	54	59
R208	55	57	58	52	61
R209	52	52	53	53	60
R210	50	51	54	56	58
R211	49	55	57	56	57
RC201	44	45	49	45	50
RC202	42	42	45	43	49
RC203	46	49	53	51	52
RC204	41	41	44	42	48
RC205	46	47	49	44	51
RC206	47	48	51	50	53
RC207	41	41	43	45	47
RC208	43	46	47	51	52