Instance 85_04 using the Global Sequencing Constraint

	NODES		TIME
	avg	min	avg	min
s_l_l_c_gs	183.40	182.00	1.38	1.36
r_e_l_c_gs	183.80	182.00	1.37	1.36
pq_e_m_c_gs	154.80	147.00	1.39	1.34
R_s_m_c_gs	180.40	178.00	1.24	1.23
L_e_m_c_gs	182.60	182.00	1.22	1.22
R_l_m_c_gs	179.60	177.00	1.26	1.23
L_l_m_o_gs	335.80	334.00	2.83	2.82
d_s_m_c_gs	187.60	187.00	1.35	1.33
d_l_l_c_gs	182.80	179.00	1.34	1.31
d_e_l_c_gs	184.20	182.00	1.33	1.31
s_l_m_c_gs	181.00	180.00	1.25	1.24
s_l_m_o_gs	305.60	304.00	3.81	3.75
S_l_l_o_gs	--	--	--	--
l_l_l_c_gs	183.40	182.00	1.35	1.35
l_l_m_c_gs	183.60	181.00	1.23	1.22
s_s_l_c_gs	183.40	181.00	1.37	1.36
L_s_l_c_gs	184.00	183.00	1.41	1.40
r_s_l_c_gs	183.40	181.00	1.37	1.35
R_e_m_c_gs	181.40	179.00	1.23	1.23
R_l_l_c_gs	185.60	184.00	1.44	1.42
S_e_m_c_gs	179.60	176.00	1.24	1.23
S_l_m_o_gs	3500.00	3497.00	5.59	5.53
r_l_l_o_gs	341.00	341.00	3.20	3.17
l_e_m_c_gs	181.80	180.00	1.22	1.20
pq_s_m_c_gs	152.20	146.00	1.32	1.29
pq_l_m_c_gs	150.80	145.00	1.34	1.32
l_l_m_o_gs	333.00	332.00	2.83	2.82
S_e_l_c_gs	184.00	183.00	1.44	1.42
d_l_m_o_gs	329.20	328.00	3.21	3.20
s_l_l_o_gs	--	--	--	--
mo_s_m_c_gs	181.00	175.00	1.32	1.29
S_s_l_c_gs	184.00	183.00	1.43	1.42
S_s_m_c_gs	179.60	176.00	1.24	1.23
pq_s_l_c_gs	151.60	146.00	1.39	1.38
r_l_m_c_gs	182.00	179.00	1.24	1.23
s_e_m_c_gs	178.00	176.00	1.25	1.23
R_e_l_c_gs	184.80	183.00	1.43	1.41
L_s_m_c_gs	180.80	180.00	1.23	1.22
pq_l_m_o_gs	--	--	--	--
L_e_l_c_gs	184.80	183.00	1.42	1.41
d_s_l_c_gs	185.40	184.00	1.37	1.35
d_e_m_c_gs	187.20	185.00	1.36	1.35
r_e_m_c_gs	180.80	177.00	1.24	1.22
R_l_l_o_gs	331.20	330.00	3.22	3.21
R_l_m_o_gs	331.80	331.00	2.95	2.92
d_l_m_c_gs	188.20	187.00	1.36	1.35
pq_l_l_o_gs	--	--	--	--
L_l_l_o_gs	331.00	331.00	3.14	3.13
s_s_m_c_gs	178.00	176.00	1.24	1.23
s_e_l_c_gs	183.40	181.00	1.38	1.37
S_l_l_c_gs	185.60	184.00	1.45	1.43
d_l_l_o_gs	722.60	339.00	5.00	3.33
r_l_l_c_gs	183.40	182.00	1.37	1.36
l_s_m_c_gs	180.60	179.00	1.22	1.20
l_s_l_c_gs	183.40	181.00	1.36	1.35
l_e_l_c_gs	183.80	182.00	1.36	1.34
mo_s_l_c_gs	173.00	170.00	1.35	1.34
pq_l_l_c_gs	151.40	146.00	1.44	1.39
S_l_m_c_gs	179.80	177.00	1.27	1.25
pq_e_l_c_gs	149.60	148.00	1.47	1.42
r_l_m_o_gs	331.40	329.00	2.94	2.93
L_l_l_c_gs	185.60	184.00	1.44	1.42
L_l_m_c_gs	180.40	179.00	1.24	1.24
r_s_m_c_gs	179.60	175.00	1.23	1.22
l_l_l_o_gs	338.20	334.00	3.12	3.09
R_s_l_c_gs	184.00	183.00	1.43	1.42

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