nb clients : giant trip order set of clients
-SOLUTION-DETAIL-CLIENTS---------------------------------------------------------------------
solution (riding time without loading time, total duration)
	resume for each trip :
	-	client list
	-	trip riding time , trip total duration
	-	departure time on the depot
-------------------------------------------------------------------------------
	for each trip 
	-	trip riding time , trip total duration, departure time on the depot
	-	load (volume) in the vehicle
	-	for each client
		o	number of client
		o	departure time
		o	load (time)
		o	load (volume)
		o	end of the loading
		o	wt waiting time during the shortest path to the next client 
		o	rt riding time during the shortest path to the next client
-SOLUTION-DETAIL-PCC------------------------------------------------------------------------------
solution detail with each shortest paths detail between clients
	for each trip 
		for each shortest path between 2 consecutive clients
		o	starting client
				number of client
				node associated with the client
		o	ending client
				number of client
				node associated with the client
		o	final shortest path cost :
				departure time
				waiting time
				riding time
					
		for each node in a shortest path
					number of the node
					arrived time
					waiting time
					departure time 
					riding time to the next node