Are there algorithms for solving the problem of cargo transportation with this condition?

Question

Algorithms

Hello. Help me please.
There are many Z orders, which are described by volume (the total sum of the volumes of boxes specified in the order), the date of the start of the delivery period and the date of the end of the delivery period.
There are many vehicles T, which are characterized by the volume of the container.
It is necessary to compose flights (a set of orders in one load/trip of a vehicle) for each transport in such a way that the deviation of delivery times is minimal. At the same time, observe the restriction so that the volume of orders in the flight is less than or equal to the volume of transport.
Delivery is carried out from one point. All distances are known (from the origin to all destinations and from each destination to all other destinations).
Please tell me how to solve this problem