Instance 80_03 using the Global Sequencing Constraint

	NODES		TIME
	avg	min	avg	min
s_l_l_c_gs	192.40	191.00	1.21	1.20
r_e_l_c_gs	183.00	182.00	1.11	1.10
pq_e_m_c_gs	149.80	146.00	0.97	0.95
R_s_m_c_gs	183.60	182.00	1.02	1.01
L_e_m_c_gs	183.60	182.00	1.01	0.99
R_l_m_c_gs	188.00	186.00	1.03	1.00
L_l_m_o_gs	272.00	272.00	2.01	2.00
d_s_m_c_gs	180.60	179.00	1.00	0.97
d_l_l_c_gs	179.00	177.00	1.14	1.13
d_e_l_c_gs	183.20	179.00	1.12	1.10
s_l_m_c_gs	185.60	183.00	1.03	1.00
s_l_m_o_gs	238.00	238.00	3.11	3.08
S_l_l_o_gs	--	--	--	--
l_l_l_c_gs	192.40	191.00	1.21	1.19
l_l_m_c_gs	186.00	184.00	1.04	1.02
s_s_l_c_gs	183.00	182.00	1.11	1.09
L_s_l_c_gs	183.80	183.00	1.11	1.10
r_s_l_c_gs	183.00	182.00	1.12	1.10
R_e_m_c_gs	183.80	182.00	1.03	1.01
R_l_l_c_gs	189.20	189.00	1.19	1.19
S_e_m_c_gs	183.60	182.00	1.01	0.99
S_l_m_o_gs	--	--	--	--
r_l_l_o_gs	271.80	269.00	2.41	2.38
l_e_m_c_gs	182.60	182.00	1.03	1.00
pq_s_m_c_gs	147.20	145.00	0.97	0.96
pq_l_m_c_gs	149.80	146.00	0.98	0.95
l_l_m_o_gs	279.60	274.00	2.07	2.03
S_e_l_c_gs	183.80	183.00	1.12	1.10
d_l_m_o_gs	--	--	--	--
s_l_l_o_gs	--	--	--	--
mo_s_m_c_gs	1376.00	167.00	1.62	0.97
S_s_l_c_gs	183.80	183.00	1.12	1.10
S_s_m_c_gs	183.60	182.00	1.02	0.99
pq_s_l_c_gs	161.20	160.00	1.12	1.11
r_l_m_c_gs	185.80	184.00	1.04	1.02
s_e_m_c_gs	183.60	182.00	1.03	1.01
R_e_l_c_gs	183.80	183.00	1.13	1.12
L_s_m_c_gs	183.60	182.00	1.02	0.99
pq_l_m_o_gs	242.00	242.00	2.64	2.64
L_e_l_c_gs	183.80	183.00	1.11	1.10
d_s_l_c_gs	182.20	178.00	1.14	1.13
d_e_m_c_gs	181.60	180.00	1.01	0.98
r_e_m_c_gs	182.60	182.00	1.02	0.99
R_l_l_o_gs	272.00	272.00	2.36	2.35
R_l_m_o_gs	275.60	274.00	2.10	2.09
d_l_m_c_gs	181.60	178.00	1.01	1.00
pq_l_l_o_gs	224.00	224.00	2.85	2.82
L_l_l_o_gs	271.80	271.00	2.19	2.18
s_s_m_c_gs	183.60	182.00	1.02	0.99
s_e_l_c_gs	183.00	182.00	1.12	1.10
S_l_l_c_gs	189.20	189.00	1.19	1.18
d_l_l_o_gs	275.00	275.00	2.39	2.38
r_l_l_c_gs	192.40	191.00	1.21	1.21
l_s_m_c_gs	182.60	182.00	1.03	0.99
l_s_l_c_gs	183.00	182.00	1.12	1.10
l_e_l_c_gs	183.00	182.00	1.11	1.10
mo_s_l_c_gs	178.20	177.00	1.10	1.09
pq_l_l_c_gs	157.80	145.00	1.10	1.09
S_l_m_c_gs	185.80	185.00	1.02	0.99
pq_e_l_c_gs	158.40	145.00	1.11	1.10
r_l_m_o_gs	281.00	281.00	2.17	2.15
L_l_l_c_gs	189.20	189.00	1.18	1.18
L_l_m_c_gs	187.80	185.00	1.02	0.99
r_s_m_c_gs	182.60	182.00	1.03	1.00
l_l_l_o_gs	272.60	272.00	2.26	2.24
R_s_l_c_gs	183.80	183.00	1.12	1.10

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_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_l_m_o_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