Instance 75_07 using the Global Sequencing Constraint

	NODES		TIME
	avg	min	avg	min
s_l_l_c_gs	191.40	189.00	1.21	1.18
r_e_l_c_gs	189.40	189.00	1.14	1.12
pq_e_m_c_gs	175.20	173.00	1.02	1.00
R_s_m_c_gs	191.40	191.00	1.03	1.01
L_e_m_c_gs	189.80	189.00	1.01	0.99
R_l_m_c_gs	192.00	191.00	1.04	1.03
L_l_m_o_gs	289.00	289.00	2.07	2.06
d_s_m_c_gs	185.40	178.00	1.05	1.01
d_l_l_c_gs	178.80	175.00	1.14	1.05
d_e_l_c_gs	190.80	187.00	1.15	1.07
s_l_m_c_gs	192.00	191.00	1.04	1.02
s_l_m_o_gs	--	--	--	--
S_l_l_o_gs	--	--	--	--
l_l_l_c_gs	191.40	189.00	1.19	1.16
l_l_m_c_gs	192.00	191.00	1.04	1.02
s_s_l_c_gs	189.60	187.00	1.13	1.12
L_s_l_c_gs	189.60	187.00	1.12	1.10
r_s_l_c_gs	189.60	187.00	1.13	1.12
R_e_m_c_gs	190.00	190.00	1.02	1.00
R_l_l_c_gs	191.00	189.00	1.21	1.19
S_e_m_c_gs	191.40	191.00	1.02	1.00
S_l_m_o_gs	--	--	--	--
r_l_l_o_gs	298.00	298.00	2.88	2.86
l_e_m_c_gs	190.00	189.00	1.02	0.99
pq_s_m_c_gs	173.20	172.00	0.99	0.99
pq_l_m_c_gs	175.40	173.00	1.03	1.02
l_l_m_o_gs	292.00	292.00	2.10	2.10
S_e_l_c_gs	189.60	187.00	1.14	1.12
d_l_m_o_gs	283.20	283.00	2.36	2.35
s_l_l_o_gs	--	--	--	--
mo_s_m_c_gs	179.80	178.00	1.02	1.01
S_s_l_c_gs	189.60	187.00	1.14	1.11
S_s_m_c_gs	191.40	191.00	1.03	1.00
pq_s_l_c_gs	170.80	169.00	1.05	1.04
r_l_m_c_gs	192.00	191.00	1.04	1.02
s_e_m_c_gs	191.00	190.00	1.01	1.00
R_e_l_c_gs	189.00	188.00	1.14	1.13
L_s_m_c_gs	191.40	191.00	1.01	0.99
pq_l_m_o_gs	244.00	244.00	2.86	2.85
L_e_l_c_gs	189.00	188.00	1.14	1.11
d_s_l_c_gs	190.80	187.00	1.15	1.07
d_e_m_c_gs	184.60	176.00	1.05	1.01
r_e_m_c_gs	190.00	189.00	1.02	0.99
R_l_l_o_gs	298.00	298.00	2.83	2.81
R_l_m_o_gs	293.00	293.00	2.29	2.28
d_l_m_c_gs	178.40	176.00	1.07	1.05
pq_l_l_o_gs	231.00	231.00	2.83	2.82
L_l_l_o_gs	296.00	296.00	2.36	2.35
s_s_m_c_gs	191.00	190.00	1.01	0.99
s_e_l_c_gs	189.60	187.00	1.14	1.12
S_l_l_c_gs	191.00	189.00	1.20	1.19
d_l_l_o_gs	282.00	281.00	2.59	2.57
r_l_l_c_gs	191.40	189.00	1.21	1.19
l_s_m_c_gs	191.20	190.00	1.01	0.99
l_s_l_c_gs	189.60	187.00	1.13	1.10
l_e_l_c_gs	189.40	189.00	1.13	1.10
mo_s_l_c_gs	178.40	172.00	1.11	1.11
pq_l_l_c_gs	169.80	168.00	1.09	1.07
S_l_m_c_gs	192.00	191.00	1.04	1.03
pq_e_l_c_gs	169.80	168.00	1.08	1.07
r_l_m_o_gs	294.00	294.00	2.32	2.31
L_l_l_c_gs	191.00	189.00	1.20	1.16
L_l_m_c_gs	192.00	191.00	1.05	1.02
r_s_m_c_gs	191.20	190.00	1.02	1.00
l_l_l_o_gs	298.00	298.00	2.38	2.37
R_s_l_c_gs	189.60	187.00	1.14	1.13

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