The encoding of a solution is designed in such a way to minimize, for each vehicle, the slack between its capacity and the amount of customers’ requests i.e. rank the commands in the decreasing order of their weights, then load them into vehicles. This loading strategy, also called the greedy-based algorithm, allows narrowing the remaining space when loading objects.