Instance 75_03 using the Global Sequencing Constraint

	NODES		TIME
	avg	min	avg	min
s_l_l_c_gs	179.20	178.00	1.20	1.17
r_e_l_c_gs	179.60	177.00	1.18	1.14
pq_e_m_c_gs	139.20	137.00	1.00	1.00
R_s_m_c_gs	177.60	176.00	1.09	1.06
L_e_m_c_gs	177.80	176.00	1.07	1.03
R_l_m_c_gs	180.40	179.00	1.13	1.11
L_l_m_o_gs	291.40	290.00	2.17	2.15
d_s_m_c_gs	177.40	175.00	1.13	1.12
d_l_l_c_gs	170.00	170.00	1.19	1.18
d_e_l_c_gs	180.60	177.00	1.21	1.21
s_l_m_c_gs	177.80	176.00	1.10	1.08
s_l_m_o_gs	--	--	--	--
S_l_l_o_gs	--	--	--	--
l_l_l_c_gs	179.20	178.00	1.19	1.18
l_l_m_c_gs	177.80	177.00	1.09	1.08
s_s_l_c_gs	179.60	177.00	1.20	1.15
L_s_l_c_gs	177.00	173.00	1.16	1.14
r_s_l_c_gs	179.60	177.00	1.19	1.14
R_e_m_c_gs	177.80	176.00	1.09	1.05
R_l_l_c_gs	179.80	179.00	1.22	1.16
S_e_m_c_gs	177.00	175.00	1.08	1.05
S_l_m_o_gs	--	--	--	--
r_l_l_o_gs	298.00	297.00	2.55	2.50
l_e_m_c_gs	177.00	175.00	1.07	1.05
pq_s_m_c_gs	143.80	143.00	1.00	0.99
pq_l_m_c_gs	140.60	140.00	1.01	1.00
l_l_m_o_gs	295.80	295.00	2.17	2.16
S_e_l_c_gs	177.00	173.00	1.18	1.14
d_l_m_o_gs	298.80	298.00	2.67	2.65
s_l_l_o_gs	--	--	--	--
mo_s_m_c_gs	166.60	165.00	1.18	1.17
S_s_l_c_gs	177.00	173.00	1.18	1.15
S_s_m_c_gs	177.00	175.00	1.07	1.05
pq_s_l_c_gs	141.80	139.00	1.12	1.12
r_l_m_c_gs	178.00	177.00	1.10	1.08
s_e_m_c_gs	177.20	175.00	1.08	1.06
R_e_l_c_gs	177.00	173.00	1.18	1.15
L_s_m_c_gs	177.60	176.00	1.07	1.04
pq_l_m_o_gs	263.00	263.00	3.20	3.18
L_e_l_c_gs	177.00	173.00	1.16	1.13
d_s_l_c_gs	177.20	173.00	1.20	1.18
d_e_m_c_gs	177.60	174.00	1.13	1.13
r_e_m_c_gs	176.40	175.00	1.06	1.04
R_l_l_o_gs	292.40	291.00	2.53	2.51
R_l_m_o_gs	300.80	300.00	2.30	2.28
d_l_m_c_gs	179.60	177.00	1.16	1.16
pq_l_l_o_gs	248.00	248.00	3.27	3.26
L_l_l_o_gs	293.60	291.00	2.38	2.37
s_s_m_c_gs	177.20	175.00	1.07	1.06
s_e_l_c_gs	179.60	177.00	1.19	1.13
S_l_l_c_gs	179.80	179.00	1.22	1.15
d_l_l_o_gs	303.00	303.00	2.85	2.84
r_l_l_c_gs	179.20	178.00	1.19	1.16
l_s_m_c_gs	177.00	175.00	1.07	1.06
l_s_l_c_gs	179.60	177.00	1.17	1.13
l_e_l_c_gs	179.60	177.00	1.18	1.13
mo_s_l_c_gs	164.60	157.00	1.20	1.18
pq_l_l_c_gs	138.00	136.00	1.14	1.12
S_l_m_c_gs	177.80	176.00	1.13	1.11
pq_e_l_c_gs	138.00	136.00	1.13	1.12
r_l_m_o_gs	296.00	296.00	2.31	2.31
L_l_l_c_gs	179.80	179.00	1.20	1.15
L_l_m_c_gs	179.60	177.00	1.10	1.08
r_s_m_c_gs	176.40	175.00	1.07	1.05
l_l_l_o_gs	301.00	300.00	2.37	2.36
R_s_l_c_gs	177.00	173.00	1.18	1.15

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