Instance 75_01 using the Global Sequencing Constraint

	NODES		TIME
	avg	min	avg	min
s_l_l_c_gs	190.00	190.00	1.22	1.22
r_e_l_c_gs	189.20	189.00	1.22	1.21
pq_e_m_c_gs	171.20	170.00	1.06	1.05
R_s_m_c_gs	191.00	191.00	1.12	1.11
L_e_m_c_gs	191.00	191.00	1.11	1.10
R_l_m_c_gs	191.00	191.00	1.07	1.06
L_l_m_o_gs	299.60	299.00	2.21	2.20
d_s_m_c_gs	191.60	190.00	1.15	1.14
d_l_l_c_gs	182.00	182.00	1.31	1.30
d_e_l_c_gs	191.00	191.00	1.31	1.30
s_l_m_c_gs	190.80	190.00	1.06	1.05
s_l_m_o_gs	--	--	--	--
S_l_l_o_gs	--	--	--	--
l_l_l_c_gs	190.00	190.00	1.20	1.19
l_l_m_c_gs	191.00	191.00	1.05	1.04
s_s_l_c_gs	189.20	189.00	1.21	1.20
L_s_l_c_gs	188.80	188.00	1.22	1.20
r_s_l_c_gs	189.20	189.00	1.22	1.21
R_e_m_c_gs	191.00	191.00	1.12	1.11
R_l_l_c_gs	189.60	189.00	1.22	1.21
S_e_m_c_gs	191.00	191.00	1.12	1.11
S_l_m_o_gs	--	--	--	--
r_l_l_o_gs	303.00	303.00	2.59	2.57
l_e_m_c_gs	190.60	190.00	1.11	1.11
pq_s_m_c_gs	172.60	172.00	1.06	1.05
pq_l_m_c_gs	170.80	170.00	1.07	1.06
l_l_m_o_gs	300.00	300.00	2.24	2.21
S_e_l_c_gs	188.80	188.00	1.22	1.21
d_l_m_o_gs	295.00	295.00	2.66	2.65
s_l_l_o_gs	--	--	--	--
mo_s_m_c_gs	177.40	171.00	1.13	1.13
S_s_l_c_gs	188.80	188.00	1.22	1.21
S_s_m_c_gs	191.00	191.00	1.11	1.11
pq_s_l_c_gs	174.40	174.00	1.19	1.16
r_l_m_c_gs	190.80	190.00	1.07	1.05
s_e_m_c_gs	190.20	188.00	1.11	1.10
R_e_l_c_gs	188.80	188.00	1.22	1.20
L_s_m_c_gs	191.00	191.00	1.11	1.10
pq_l_m_o_gs	221.00	221.00	2.97	2.97
L_e_l_c_gs	188.80	188.00	1.21	1.20
d_s_l_c_gs	191.00	191.00	1.31	1.30
d_e_m_c_gs	191.80	191.00	1.15	1.15
r_e_m_c_gs	190.40	189.00	1.12	1.11
R_l_l_o_gs	302.00	302.00	2.60	2.59
R_l_m_o_gs	300.00	300.00	2.32	2.30
d_l_m_c_gs	184.20	183.00	1.15	1.14
pq_l_l_o_gs	222.00	222.00	3.18	3.17
L_l_l_o_gs	302.00	302.00	2.44	2.43
s_s_m_c_gs	190.20	188.00	1.11	1.11
s_e_l_c_gs	189.20	189.00	1.21	1.20
S_l_l_c_gs	189.60	189.00	1.23	1.22
d_l_l_o_gs	297.00	297.00	2.82	2.81
r_l_l_c_gs	190.00	190.00	1.24	1.24
l_s_m_c_gs	190.60	190.00	1.11	1.10
l_s_l_c_gs	189.20	189.00	1.19	1.18
l_e_l_c_gs	189.20	189.00	1.19	1.18
mo_s_l_c_gs	186.60	184.00	1.32	1.30
pq_l_l_c_gs	172.40	170.00	1.19	1.17
S_l_m_c_gs	191.00	191.00	1.07	1.06
pq_e_l_c_gs	173.40	172.00	1.19	1.16
r_l_m_o_gs	300.00	300.00	2.31	2.30
L_l_l_c_gs	189.60	189.00	1.21	1.21
L_l_m_c_gs	191.00	191.00	1.06	1.05
r_s_m_c_gs	190.40	189.00	1.12	1.12
l_l_l_o_gs	303.00	303.00	2.43	2.41
R_s_l_c_gs	188.80	188.00	1.21	1.21

Best configurations

['L_e_l_c_gs', 'L_e_m_c_gs', 'L_l_l_c_gs', 'L_l_l_o_gs', 'L_l_m_c_gs', 'L_l_m_o_gs', 'L_s_l_c_gs', 'L_s_m_c_gs', 'R_e_l_c_gs', 'R_e_m_c_gs', 'R_l_l_c_gs', 'R_l_l_o_gs', 'R_l_m_c_gs', 'R_l_m_o_gs', 'R_s_l_c_gs', 'R_s_m_c_gs', 'S_e_l_c_gs', 'S_e_m_c_gs', 'S_l_l_c_gs', 'S_l_m_c_gs', 'S_s_l_c_gs', 'S_s_m_c_gs', 'd_e_l_c_gs', 'd_e_m_c_gs', 'd_l_l_c_gs', 'd_l_l_o_gs', 'd_l_m_c_gs', 'd_l_m_o_gs', 'd_s_l_c_gs', 'd_s_m_c_gs', 'l_e_l_c_gs', 'l_e_m_c_gs', 'l_l_l_c_gs', 'l_l_l_o_gs', 'l_l_m_c_gs', 'l_l_m_o_gs', 'l_s_l_c_gs', 'l_s_m_c_gs', 'mo_s_l_c_gs', 'mo_s_m_c_gs', 'pq_e_l_c_gs', 'pq_e_m_c_gs', 'pq_l_l_c_gs', 'pq_l_l_o_gs', 'pq_l_m_c_gs', 'pq_l_m_o_gs', 'pq_s_l_c_gs', 'pq_s_m_c_gs', 'r_e_l_c_gs', 'r_e_m_c_gs', 'r_l_l_c_gs', 'r_l_l_o_gs', 'r_l_m_c_gs', 'r_l_m_o_gs', 'r_s_l_c_gs', 'r_s_m_c_gs', 's_e_l_c_gs', 's_e_m_c_gs', 's_l_l_c_gs', 's_l_m_c_gs', 's_s_l_c_gs', 's_s_m_c_gs']

Description

Each table represents some statics related to given configuration. A configuration is denoted by A_B_C_D_E where :

A is the selection criteria. We denote by

mo : Max option
pq : The capacity q\p
d : The residual demand
l : The load
s : The slack
r : The usage rate

B is the aggregation function. We denote by

l : Lexicographic order
s : Sum of the elements
e : Euclidean norm

C is the exploration criteria. We denote by

l : Lexicographic exploration
m : Middle towars sides

D is the Branching parameter. We denote by

o : Option
c : Class

E is the filtering model. We denote by

n : The default model using sum constraints
am : The model using the AtMostSeqCard Constraint
gs : The model using the Global Sequencing Constraint (GSC)
gsam : The model combining AtMostSeqCard+GSC
f : The model using the new filtering algorithm