Instance 85_07 using the Global Sequencing Constraint

	NODES		TIME
	avg	min	avg	min
s_l_l_c_gs	179.60	179.00	1.35	1.30
r_e_l_c_gs	183.60	177.00	1.42	1.33
pq_e_m_c_gs	155.00	151.00	1.21	1.19
R_s_m_c_gs	178.60	175.00	1.20	1.18
L_e_m_c_gs	177.60	175.00	1.17	1.13
R_l_m_c_gs	177.60	176.00	1.19	1.17
L_l_m_o_gs	330.00	330.00	2.61	2.61
d_s_m_c_gs	182.80	179.00	1.25	1.22
d_l_l_c_gs	178.00	177.00	1.38	1.37
d_e_l_c_gs	187.80	186.00	1.38	1.37
s_l_m_c_gs	177.40	176.00	1.17	1.16
s_l_m_o_gs	--	--	--	--
S_l_l_o_gs	--	--	--	--
l_l_l_c_gs	179.60	179.00	1.34	1.28
l_l_m_c_gs	175.00	174.00	1.15	1.13
s_s_l_c_gs	183.60	177.00	1.41	1.34
L_s_l_c_gs	184.40	183.00	1.37	1.35
r_s_l_c_gs	183.60	177.00	1.43	1.35
R_e_m_c_gs	178.00	175.00	1.20	1.17
R_l_l_c_gs	185.20	183.00	1.41	1.40
S_e_m_c_gs	179.40	179.00	1.20	1.20
S_l_m_o_gs	--	--	--	--
r_l_l_o_gs	332.00	332.00	3.09	3.06
l_e_m_c_gs	177.00	176.00	1.22	1.18
pq_s_m_c_gs	156.60	154.00	1.20	1.18
pq_l_m_c_gs	156.20	147.00	1.22	1.17
l_l_m_o_gs	333.20	333.00	2.66	2.66
S_e_l_c_gs	184.40	183.00	1.40	1.37
d_l_m_o_gs	323.60	322.00	3.10	3.09
s_l_l_o_gs	--	--	--	--
mo_s_m_c_gs	179.40	171.00	1.19	1.17
S_s_l_c_gs	184.40	183.00	1.39	1.37
S_s_m_c_gs	179.40	179.00	1.21	1.20
pq_s_l_c_gs	151.60	150.00	1.34	1.33
r_l_m_c_gs	175.20	174.00	1.16	1.14
s_e_m_c_gs	173.40	172.00	1.20	1.17
R_e_l_c_gs	184.40	183.00	1.38	1.37
L_s_m_c_gs	177.60	175.00	1.17	1.14
pq_l_m_o_gs	265.00	265.00	3.60	3.58
L_e_l_c_gs	184.40	183.00	1.37	1.36
d_s_l_c_gs	186.80	185.00	1.38	1.37
d_e_m_c_gs	183.20	180.00	1.24	1.20
r_e_m_c_gs	175.40	172.00	1.20	1.16
R_l_l_o_gs	332.40	331.00	3.04	3.02
R_l_m_o_gs	332.80	332.00	2.75	2.71
d_l_m_c_gs	180.00	175.00	1.24	1.20
pq_l_l_o_gs	250.00	250.00	3.73	3.71
L_l_l_o_gs	332.60	331.00	2.93	2.92
s_s_m_c_gs	173.40	172.00	1.20	1.17
s_e_l_c_gs	183.60	177.00	1.43	1.36
S_l_l_c_gs	185.20	183.00	1.42	1.41
d_l_l_o_gs	326.40	324.00	3.29	3.27
r_l_l_c_gs	179.60	179.00	1.35	1.30
l_s_m_c_gs	177.00	176.00	1.21	1.18
l_s_l_c_gs	183.60	177.00	1.40	1.33
l_e_l_c_gs	183.60	177.00	1.41	1.32
mo_s_l_c_gs	1658.00	1231.00	2.06	1.82
pq_l_l_c_gs	540.60	163.00	1.66	1.39
S_l_m_c_gs	177.60	176.00	1.20	1.16
pq_e_l_c_gs	153.60	152.00	1.35	1.33
r_l_m_o_gs	331.60	329.00	2.81	2.79
L_l_l_c_gs	185.20	183.00	1.41	1.40
L_l_m_c_gs	176.60	175.00	1.15	1.11
r_s_m_c_gs	175.40	172.00	1.20	1.17
l_l_l_o_gs	332.20	332.00	2.96	2.95
R_s_l_c_gs	184.40	183.00	1.38	1.36

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