Determining reassignments of dockout times

A computer-implemented method comprising:

• obtaining inputs comprising dockout windows for routes from a depot, capacity information for the depot, and dockout preferences;
• determining respective assignment penalties associated with respective assignments for feasible combinations of the routes and time periods within the dockout windows for the routes;
• determining a solution set of the respective assignments that minimize a total penalty, comprising using mixed integer linear programming to minimize a sum of a dockout breach penalty and the respective assignment penalties based on constraints;
• reassigning at least a portion of dockout times in the solution set to spread out the portion of the dockout times at the depot based on the dockout preferences;
• and
• outputting the dockout times, as reassigned, for the routes.

A non-transitory computer-readable medium storing computing instructions that, when executed on a processor, cause the processor to perform operations comprising:

• obtaining inputs comprising dockout windows for routes from a depot, capacity information for the depot, and dockout preferences;
• determining respective assignment penalties associated with respective assignments for feasible combinations of the routes and time periods within the dockout windows for the routes;
• determining a solution set of the respective assignments that minimize a total penalty;
• reassigning at least a portion of dockout times in the solution set to spread out the portion of the dockout times at the depot based on the dockout preferences, comprising:
• sub-partitioning the time periods for which there are multiple of the routes assigned in the solution set;
• and
• greedily assigning routes to a feasible sub-partition based on a maximum average gap between the routes;
• and
• outputting the dockout times, as reassigned, for the routes.