Optimizing distribution of shipping items by receiving distribution data for a first item. The distribution data including a starting location and a destination. The distribution data also including a constraint for shipment with a second item. A time space network mode is created for tracking the first item relative to the constraint for shipment with the second item. An objection function is performed using the time space network model to optimize the distribution data by minimizing the sum of an objective function including a minimized fulfillment penalty and a minimized unmet order penalty. A delivery plan is executed with the distribution data that was optimized.

Systems, computer program products, and methods are described herein for dynamic resource allocation based on vehicle route selection. The present invention is configured to receive an origin and a destination for a user; determine travel routes for the user; determine resource distribution entities along the one or more travel routes; determine resources associated with the resource distribution entities; display the travel routes, the resource distribution entities along each of the travel routes, and the resources associated with each of the resource distribution entities; receive a user selection of at least one of the travel routes; and distribute the resources to the computing device of the user along the at least one of the one or more travel routes selected by the user.

An apparatus configured to: perform a simulation of sequences different from each other by using a condition that, when a procedure group including processing procedures specifying a route and work to be performed at a work point on the route is defined, processing subjects has executed the sequences of processing according to the processing procedures assigned to the processing subjects, and the work point overlaps and time at which the work is performed overlaps between the processing subjects, subjects other than one of the processing subjects that has started the work first stand by until the one of the processing subjects completes the work; extract stand-by information for each of the processing subjects from a result of the performing of the simulation; and update the procedure group by combining the processing procedures of two or more of the processing subjects into one processing procedure according to the extracted stand-by information.

Methods and systems to develop routes for an aircraft to travel through an airspace. The system includes interface circuitry to receive one or more objectives and one or more constraints for the routes. Processing circuitry is configured to optimize the routes based on one or more of the input parameters. The processing circuitry is configured to: generate a set of routes that each comprise a different flight path through the airspace; rank the routes in the set based on how each of the routes dominates the other routes based on the one or more objectives and constraints; maintain dominant routes in the set and eliminate dominated routes from the set based on the rankings; generate additional dominant routes based on the one or more objectives and constraints; and supplement the set with the additional dominant routes.

An apparatus includes a processor to generate routes for delivering packages in a vehicle routing problem, obtain a first optimum solution of the vehicle routing problem with respect to the routes, determine whether a difference between an objective function value of the first optimum solution and an objective function value of a second optimum solution is greater than or equal to a first threshold value, the second optimum solution being obtained for a linear relaxation problem of the vehicle routing problem, and remove routes for which a variable indicative of a corresponding route is less than or equal to a second threshold value in the second optimum solution, upon finding that the difference is greater than or equal to the first threshold value, wherein a processor generates new routes for delivering packages other than packages that are to be delivered by one or more routes which are left remaining.

Described herein are systems and methods for storing items in storage facilities. The method can include receiving, by a computing system, a request to identify a destination location for a storage item, identifying a set of available storage locations from among a plurality of storage locations, and determining a score for each respective storage location of the set of available storage locations based on multiple sub-scores specific to the respective storage location, to generate a set of scores corresponding to the set of available storage locations. The method also includes selecting a selected storage location from among the available storage locations based on the selected storage location having a most favorable score from among the set of scores corresponding to the set of available storage locations, and providing instructions to cause a mechanical moving system to route the storage item to the selected storage location.

Described are systems and methods for identifying an item in a storage facility to fulfill a pick request. The method includes receiving, by a computing system, a request for a physical item of a particular type, identifying a set of available physical items of the particular type from a plurality of physical items stored in storage locations in the storage facility, determining a score for each respective available physical item based on multiple sub-scores specific to the respective available physical item, to generate a set of scores corresponding to the set of available physical items, selecting a selected physical item from among the set based on the selected physical item having a most favorable score, identifying a selected storage location of the selected physical item, and providing instructions to cause a mechanical moving system to route the selected physical item from the selected storage location to a destination picking location.

A multi-objective scheduling advisor for generating a multi-stop visitation schedule includes generating, by a computer, a road network map corresponding to a predetermined area including a plurality of tasks locations. A task to be performed is assigned to each of the plurality of task locations. The computer calculates a business value for each task location using at least one of a calculation, a selected business rule applied to a delay duration, and an input value received from a client. A duration of a respective task is calculated using historical data on task durations associated with a staff of operators over different predetermined areas to determine an average task duration for every operator in the staff. Finally, using a metaheuristic binary optimization algorithm, the computer chooses different candidate tasks for the multi-stop visitation schedule to visit multiple assets in a single trip within the predetermined area.

A processing system including at least one processor may identify a demand for a plurality of types of items in an area that is assigned to a delivery vehicle, determine a first route to traverse the area to maximize a fulfillment of the demand, identify items from the plurality of types of items to load onto the delivery vehicle, and dispatch the delivery vehicle on a first trip over the first route, the delivery vehicle carrying the items that are identified.

Systems and methods for controlling an autonomous vehicle are provided. In one example embodiment, a computer-implemented method includes receiving data representing a first location associated with a service request. The method includes controlling the autonomous vehicle to travel in accordance with a first route that leads to the first location. The method includes determining a second location for the service request when the autonomous vehicle is en route to the first location. The method includes controlling the autonomous vehicle to provide the requested service at the second location.