Abstract: Systems and methods including one or more processors and one or more non-transitory storage devices storing computing instructions configured to run on the one or more processors and perform: receiving input information for generating one or more routes for one or more vehicles, the input information including one or more group classifiers; processing the input information based on the one or more group classifiers; analyzing, using one or more solving engines, the input information to generate the one or more routes for the one or more vehicles; selecting, from each of the one or more solving engines, a vehicle route from the one or more routes that satisfies a threshold; and transmitting the vehicle route to a dispatcher to facilitate coordinating, by the dispatcher, operation of a vehicle from the one or more vehicles along the vehicle route. Other embodiments are disclosed herein.

Abstract: A system including one or more processors and one or more non-transitory computer-readable media storing computing instructions that, when executed on the one or more processors, cause the one or more processors to perform operations: receiving a load design for loading a trailer to deliver orders; generating an initial grouping comprising stacks of pallets that are configured to be loaded interchangeably among respective floor spot assignments on the trailer; iteratively adjusting at least one of the stacks of pallets within the initial grouping to satisfy at least a center-of-gravity constraint in a final load design for the trailer; and outputting the final load design comprising the initial grouping to cause the stacks of pallets of the initial grouping to be loaded into the trailer according to the final load design. Other embodiments are described.

Abstract: Systems and methods including one or more processors and one or more non-transitory storage devices storing computing instructions configured to run on the one or more processors and perform: receiving input information for generating one or more routes for one or more vehicles, the input information including one or more group classifiers; processing the input information based on the one or more group classifiers; analyzing, using one or more solving engines, the input information to generate the one or more routes for the one or more vehicles; selecting, from each of the one or more solving engines, a vehicle route from the one or more routes that satisfies a threshold; and transmitting the vehicle route to a dispatcher to facilitate coordinating, by the dispatcher, operation of a vehicle from the one or more vehicles along the vehicle route. Other embodiments are disclosed herein.

Abstract: A system including one or more processors and one or more non-transitory computer-readable media storing computing instructions that, when executed on the one or more processors, cause the one or more processors to perform operations: generating a preliminary dock-out time boundary based on one or more delivery time windows for one or more deliveries; processing two parallel data flow paths to locate a range of dock-out times associated with one or more time constraints of the one or more delivery time windows; and transmitting the range of dock-out times to a user, wherein a trailer is dispatched to a distribution center between the range of dock-out times to load the trailer and deliver the one or more deliveries within the time constraints of the one or more delivery time windows based on a flexible period of time. Other embodiments are described.

Abstract: A system including one or more processors and one or more non-transitory computer-readable media storing computing instructions that, when executed on the one or more processors, cause the one or more processors to perform operations: receiving a load design for loading a trailer to deliver orders; generating an initial grouping comprising stacks of pallets that are configured to be loaded interchangeably among respective floor spot assignments on the trailer; iteratively adjusting at least one of the stacks of pallets within the initial grouping to satisfy at least a center-of-gravity constraint in a final load design for the trailer; and outputting the final load design comprising the initial grouping to cause the stacks of pallets of the initial grouping to be loaded into the trailer according to the final load design. Other embodiments are described.

Abstract: A system including one or more processors and one or more non-transitory computer-readable media storing computing instructions configured to run on the one or more processors and perform: generating a feasible dock-out plan designed to deliver one or more orders to one or more physical stores based on a feasible route plan by: generating a preliminary dock-out time boundary based on one or more delivery time windows; determining an earliest dock-out time based at least in part on the preliminary dock-out time boundary and a backward search; and determining a latest dock-out time based at least in part on the preliminary dock-out time boundary and a forward search; and transmitting a range of dock-out times comprising (i) the earliest dock-out time and (ii) the latest dock-out time to a user. Other embodiments are described.

Abstract: A system comprising one or more processors and one or more non-transitory computer-readable media storing computing instructions, that when executed on the one or more processors, cause the one or more processors, to perform functions comprising: receiving, by an application programing interface (API), a change request for a route plan, wherein the change request is subject to a scenario specification and a load feasibility specification; determining an updated route plan based on whether the change request for the route plan is a feasible route based on the scenario specification and the load feasibility specification, and the route stop time is the route start time is flexible; and outputting the updated route plan and, when the route stop time is flexible, outputting the route start time. Other embodiments are disclosed.

Abstract: A system comprising one or more processors; and one or more non-transitory computer-readable media storing computing instructions, that when executed on the one or more processors, cause the one or more processors to perform functions comprising: obtaining a route plan for outbound transport from a distribution center; processing multiple threads in parallel to obtain multiple improvements to the route plan, where each of the multiple threads customizes the route plan using one or more different parameters; selecting a lowest cost route solution from the multiple improvements to the route plan; and using the lowest cost route solution for the outbound transport from the distribution center. Other embodiments are disclosed.

Abstract: Systems and methods including one or more processors and one or more non-transitory storage devices storing computing instructions configured to run on the one or more processors and cause the one or more processors to perform receiving one or more orders comprising a list of one or more pallets; grouping each pallet of the one or more pallets into one or more groups using one or more respective qualities of each respective pallet; for each group of the one or more groups, building one or more stacks of pallets using at least three different stacking models; selecting a final stack list of a model of the at least three different stacking models having a lowest number of stacks; and optimizing the final stack list using a probabilistic model. Other embodiments are disclosed herein.

Abstract: A system including one or more processors and one or more non-transitory computer-readable media storing computing instructions that, when executed on the one or more processors, perform certain acts. The acts can include obtaining an original load design for loading a trailer to deliver stacks of pallets to physical stores. The load design specifies a respective floor spot assignment for each of the stacks. The original load design satisfies center-of-gravity constraints. The acts also can include generating fluid groups of the stacks to form an initial fluid grouping. The acts additionally can include determining that the fluid groups do not collectively satisfy the center-of-gravity constraints. The acts further can include until the fluid groups collectively satisfy the center-of-gravity constraints, repeatedly determining one or more infeasible groups from the fluid groups, and adjusting at least one of the one or more infeasible groups to update the fluid groups.

Abstract: Systems and methods including one or more processors and one or more non-transitory storage devices storing computing instructions configured to run on the one or more processors and cause the one or more processors to perform (1) receiving one or more first delivery routes comprising one or more delivery stops in a sequence; (2) shuffling the one or more delivery stops among the one or more first delivery routes to create one or more second delivery routes different than the one or more first delivery routes; (3) determining whether the one or more second delivery routes are on a list of banned delivery routes; (4) when (a) the one or more second delivery routes are not on the list of banned delivery routes and (b) a second cost of the one or more second delivery routes is lower than a first cost of the one or more first delivery routes, persisting the one or more second delivery routes in the one or more non-transitory computer-readable storage devices; and (5) repeating (2) through (4) until the second cos

Abstract: Systems and methods including one or more processors and one or more non-transitory storage devices storing computing instructions configured to run on the one or more processors and cause the one or more processors to perform receiving one or more orders comprising a list of one or more pallets; grouping each pallet of the one or more pallets into one or more groups using one or more respective qualities of each respective pallet; for each group of the one or more groups, building one or more stacks of pallets using at least three different stacking models; selecting a final stack list of a model of the at least three different stacking models having a lowest number of stacks; and optimizing the final stack list using a probabilistic model. Other embodiments are disclosed herein.

Abstract: Systems and methods including one or more processors and one or more non-transitory storage devices storing computing instructions configured to run on the one or more processors and perform acts of (1) receiving one or more orders; (2) inserting the one or more orders into a plurality of pre-constructed routes to create a plurality of modified routes; (3) selecting a route of the plurality of modified routes with a lowest cost; (4) generating an initial load plan for the route with the lowest cost; (5) when the initial load plan does not pass one or more feasibility checks, splitting the one or more orders into two or more orders; and (6) repeating (1) through (5) until no more orders remain. Other embodiments are disclosed herein.

Abstract: A system including one or more processors and one or more non-transitory computer-readable media storing computing instructions that, when executed on the one or more processors, perform certain acts. The acts can include obtaining an original load design for loading a trailer to deliver stacks of pallets to physical stores. The load design specifies a respective floor spot assignment for each of the stacks. The original load design satisfies center-of-gravity constraints. The acts also can include generating fluid groups of the stacks to form an initial fluid grouping. The acts additionally can include determining that the fluid groups do not collectively satisfy the center-of-gravity constraints. The acts further can include until the fluid groups collectively satisfy the center-of-gravity constraints, repeatedly determining one or more infeasible groups from the fluid groups, and adjusting at least one of the one or more infeasible groups to update the fluid groups.

Abstract: A system including one or more processors and one or more non-transitory computer-readable media storing computing instructions configured to run on the one or more processors and perform: generating a feasible dock-out plan designed to deliver one or more orders to one or more physical stores based on a feasible route plan by: generating a preliminary dock-out time boundary based on one or more delivery time windows; determining an earliest dock-out time based at least in part on the preliminary dock-out time boundary and a backward search; and determining a latest dock-out time based at least in part on the preliminary dock-out time boundary and a forward search; and transmitting a range of dock-out times comprising (i) the earliest dock-out time and (ii) the latest dock-out time to a user. Other embodiments are described.

Abstract: A relocatable container inspection device, which is constituted by modularized units, is used for inspecting a container.

Abstract: A relocatable container inspection device, which is constituted by modularized units, is used for inspecting a container.