1SVRPDP-SP

This web page provide all the detailed of the results introduced in:

Eric Bourreau, Philippe Lacomme, Marina Vinot. A Constraint Based Approach to Efficiently Solve the One-Commodity Split Vehicle Routing Problem with Delivery and Pickup including Service Time and Precedence Relationships (1SVRPDP-SP).
Submited to Transportation Research.

• Instances.

Instances


Instances informations For the instances with 6 customers, the location of the customers in the instances can be divided into 2 configurations:

Uniform configuration LMQV_HU	Cluster configuration LMQV_HC

• Detailed Solutions.

Sum up of all results for the instances BSF: the best found solution
TT: the total CPU time in seconds
T*: the CPU time in seconds to get the BSF
Gap: the gap in percent between the BFS of CPLEX and the BFS of CPLEX

	CPLEX (integrated resolution)			GRASPxELS (integrated resolution)
Instances	Optimal Solution		TT	BFS		TT	T*	Gap
LMQV_HU1	74	Solution	11 002	79	Solution	83	3	6.8
LMQV_HU2	144	Solution	11 148	153	Solution	165	91	6.3
LMQV_HU3	188	Solution	14 324	195	Solution	159	106	3.7
LMQV_HU4	79	Solution	8 472	79	Solution	128	86	0.0
LMQV_HU5	157	Solution	6 712	157	Solution	140	81	0.0
LMQV_HU6	178	Solution	6 883	178	Solution	156	113	0.0
LMQV_HU7	66	Solution	1 797	69	Solution	102	51	4.5
LMQV_HU8	134	Solution	1 376	142	Solution	86	53	6.0
LMQV_HU9	158	Solution	2 024	194	Solution	38	11	22.8

All solution of the instances in a .zip file: