Instance 85_01 using the Global Sequencing Constraint

	NODES		TIME
	avg	min	avg	min
s_l_l_c_gs	191.20	190.00	1.39	1.39
r_e_l_c_gs	187.80	185.00	1.35	1.31
pq_e_m_c_gs	169.00	164.00	1.22	1.22
R_s_m_c_gs	188.80	188.00	1.29	1.27
L_e_m_c_gs	189.40	188.00	1.26	1.25
R_l_m_c_gs	191.00	189.00	1.26	1.25
L_l_m_o_gs	323.40	322.00	2.52	2.52
d_s_m_c_gs	189.00	188.00	1.25	1.24
d_l_l_c_gs	183.00	182.00	1.46	1.45
d_e_l_c_gs	192.40	191.00	1.47	1.44
s_l_m_c_gs	192.20	192.00	1.27	1.27
s_l_m_o_gs	--	--	--	--
S_l_l_o_gs	--	--	--	--
l_l_l_c_gs	191.20	190.00	1.37	1.34
l_l_m_c_gs	192.00	191.00	1.26	1.25
s_s_l_c_gs	187.80	185.00	1.35	1.33
L_s_l_c_gs	188.00	186.00	1.33	1.32
r_s_l_c_gs	187.80	185.00	1.35	1.32
R_e_m_c_gs	188.80	188.00	1.27	1.25
R_l_l_c_gs	192.80	188.00	1.40	1.39
S_e_m_c_gs	189.20	188.00	1.28	1.26
S_l_m_o_gs	--	--	--	--
r_l_l_o_gs	328.40	327.00	2.89	2.87
l_e_m_c_gs	190.60	190.00	1.29	1.28
pq_s_m_c_gs	170.40	168.00	1.22	1.22
pq_l_m_c_gs	169.40	166.00	1.22	1.21
l_l_m_o_gs	324.00	324.00	2.57	2.56
S_e_l_c_gs	188.00	186.00	1.36	1.34
d_l_m_o_gs	325.40	325.00	3.17	3.09
s_l_l_o_gs	--	--	--	--
mo_s_m_c_gs	179.60	175.00	1.31	1.29
S_s_l_c_gs	188.00	186.00	1.35	1.33
S_s_m_c_gs	189.20	188.00	1.28	1.26
pq_s_l_c_gs	172.60	171.00	1.36	1.33
r_l_m_c_gs	191.80	189.00	1.26	1.26
s_e_m_c_gs	190.00	190.00	1.28	1.27
R_e_l_c_gs	188.00	186.00	1.36	1.34
L_s_m_c_gs	189.40	188.00	1.26	1.25
pq_l_m_o_gs	273.00	273.00	3.69	3.67
L_e_l_c_gs	188.00	186.00	1.34	1.32
d_s_l_c_gs	188.60	187.00	1.44	1.43
d_e_m_c_gs	188.00	187.00	1.25	1.23
r_e_m_c_gs	188.80	187.00	1.28	1.26
R_l_l_o_gs	327.00	325.00	2.91	2.88
R_l_m_o_gs	327.40	326.00	2.68	2.67
d_l_m_c_gs	185.20	182.00	1.27	1.24
pq_l_l_o_gs	270.00	270.00	3.83	3.82
L_l_l_o_gs	328.20	325.00	2.79	2.76
s_s_m_c_gs	190.00	190.00	1.28	1.27
s_e_l_c_gs	187.80	185.00	1.35	1.32
S_l_l_c_gs	192.80	188.00	1.40	1.39
d_l_l_o_gs	326.00	326.00	3.35	3.32
r_l_l_c_gs	191.20	190.00	1.38	1.36
l_s_m_c_gs	190.60	190.00	1.28	1.27
l_s_l_c_gs	187.80	185.00	1.33	1.30
l_e_l_c_gs	187.80	185.00	1.34	1.32
mo_s_l_c_gs	170.20	170.00	1.45	1.44
pq_l_l_c_gs	172.00	171.00	1.36	1.33
S_l_m_c_gs	191.40	190.00	1.27	1.26
pq_e_l_c_gs	171.80	170.00	1.36	1.32
r_l_m_o_gs	326.20	326.00	2.69	2.68
L_l_l_c_gs	192.80	188.00	1.38	1.38
L_l_m_c_gs	192.80	190.00	1.24	1.24
r_s_m_c_gs	188.80	187.00	1.27	1.26
l_l_l_o_gs	324.20	324.00	2.76	2.73
R_s_l_c_gs	188.00	186.00	1.35	1.33

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