Instance 80_07 using the Global Sequencing Constraint

	NODES		TIME
	avg	min	avg	min
s_l_l_c_gs	190.80	190.00	1.22	1.20
r_e_l_c_gs	186.80	186.00	1.20	1.20
pq_e_m_c_gs	170.20	170.00	1.04	1.03
R_s_m_c_gs	190.20	189.00	1.11	1.08
L_e_m_c_gs	190.20	189.00	1.10	1.07
R_l_m_c_gs	191.20	189.00	1.10	1.08
L_l_m_o_gs	303.60	303.00	2.25	2.24
d_s_m_c_gs	188.80	181.00	1.08	1.05
d_l_l_c_gs	181.20	178.00	1.17	1.09
d_e_l_c_gs	192.20	191.00	1.20	1.16
s_l_m_c_gs	191.40	190.00	1.10	1.08
s_l_m_o_gs	--	--	--	--
S_l_l_o_gs	--	--	--	--
l_l_l_c_gs	190.80	190.00	1.21	1.20
l_l_m_c_gs	191.40	189.00	1.11	1.08
s_s_l_c_gs	186.80	186.00	1.19	1.17
L_s_l_c_gs	186.80	186.00	1.20	1.19
r_s_l_c_gs	186.80	186.00	1.21	1.19
R_e_m_c_gs	190.40	189.00	1.10	1.08
R_l_l_c_gs	191.20	190.00	1.23	1.22
S_e_m_c_gs	190.20	190.00	1.10	1.07
S_l_m_o_gs	--	--	--	--
r_l_l_o_gs	310.20	310.00	2.96	2.95
l_e_m_c_gs	190.20	190.00	1.10	1.07
pq_s_m_c_gs	174.80	173.00	1.08	1.06
pq_l_m_c_gs	170.20	170.00	1.04	1.03
l_l_m_o_gs	302.80	301.00	2.26	2.24
S_e_l_c_gs	186.80	186.00	1.20	1.19
d_l_m_o_gs	298.20	297.00	2.52	2.50
s_l_l_o_gs	--	--	--	--
mo_s_m_c_gs	177.00	175.00	1.04	1.04
S_s_l_c_gs	186.80	186.00	1.20	1.19
S_s_m_c_gs	190.20	190.00	1.09	1.07
pq_s_l_c_gs	172.20	171.00	1.14	1.14
r_l_m_c_gs	191.60	190.00	1.10	1.08
s_e_m_c_gs	190.00	189.00	1.09	1.07
R_e_l_c_gs	186.80	186.00	1.21	1.20
L_s_m_c_gs	190.20	189.00	1.09	1.07
pq_l_m_o_gs	254.00	254.00	3.01	2.99
L_e_l_c_gs	186.80	186.00	1.20	1.19
d_s_l_c_gs	191.80	190.00	1.21	1.17
d_e_m_c_gs	185.20	176.00	1.09	1.05
r_e_m_c_gs	190.20	190.00	1.10	1.07
R_l_l_o_gs	310.80	310.00	2.93	2.92
R_l_m_o_gs	297.40	297.00	2.54	2.52
d_l_m_c_gs	180.20	177.00	1.09	1.07
pq_l_l_o_gs	247.00	247.00	3.15	3.14
L_l_l_o_gs	311.80	311.00	2.55	2.53
s_s_m_c_gs	190.00	189.00	1.09	1.06
s_e_l_c_gs	186.80	186.00	1.20	1.18
S_l_l_c_gs	191.20	190.00	1.22	1.21
d_l_l_o_gs	297.80	297.00	2.73	2.72
r_l_l_c_gs	190.80	190.00	1.23	1.21
l_s_m_c_gs	190.20	190.00	1.10	1.06
l_s_l_c_gs	186.80	186.00	1.19	1.18
l_e_l_c_gs	186.80	186.00	1.19	1.18
mo_s_l_c_gs	174.20	171.00	1.15	1.13
pq_l_l_c_gs	170.20	168.00	1.17	1.14
S_l_m_c_gs	191.60	189.00	1.10	1.08
pq_e_l_c_gs	170.20	168.00	1.17	1.13
r_l_m_o_gs	298.60	298.00	2.57	2.54
L_l_l_c_gs	191.20	190.00	1.22	1.21
L_l_m_c_gs	191.40	189.00	1.10	1.08
r_s_m_c_gs	190.20	190.00	1.11	1.07
l_l_l_o_gs	313.00	313.00	2.55	2.53
R_s_l_c_gs	186.80	186.00	1.21	1.20

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