Patent application number | Description | Published |
20150063123 | METHODS AND SYSTEMS FOR ROUTING SELECTION BASED ON ROUTING DISTANCE AND CAPACITY - A system, computer-readable storage medium storing at least one program, and computer-implemented method for route selection based on payload delivery capacity and routing distance are described. Network demand information is obtained. The network demand information may include a network graph and information related to an outbound demand of each node of the network graph. A simplified demand graph based on the outbound demand of each node and a distance between each node pair is generated. A plurality of return routes for the simplified network graph is generated and a payload delivery capacity of each of the routes is calculated. An advised return route from the plurality of return routes is generated based in part on the payload delivery capacities of the plurality of return routes. | 03-05-2015 |
20150081077 | PRODUCTION RESOURCE MANAGEMENT - In accordance with aspects of the disclosure, systems and methods are provided for managing production resources including scheduling production events for production resources used to manufacture products relative to time intervals while maintaining collaboration among the production resources. The systems and methods may include retrieving information related to each production resource, evaluating each production event for each product to determine a sequence of the production events, and generating potential production scheduling schemes for use of each production resource within the time intervals while maintaining collaboration among the production resources. The systems and methods may include generating a production schedule for the production events within the time intervals based on the potential production scheduling schemes for use of each production resource within the time intervals while maintaining collaboration among the production resources. | 03-19-2015 |
20150081911 | MIGRATION EVENT SCHEDULING MANAGEMENT - In accordance with aspects of the disclosure, systems and methods are provided for scheduling migration events for server resources in a server cluster relative to a time interval while considering load balance constraints and data transfer constraints of the server cluster. The systems and methods may include generating one or more potential migration scheduling schemes for migration of each server resource to at least one other server resource in the server cluster within the time interval while considering the load balance constraints and the data transfer constraints of the server cluster, and generating a migration event schedule for each migration event within the time interval based on the one or more potential migration scheduling schemes generated for migration of each server resource to at least one other server resource in the server cluster. | 03-19-2015 |
20150088417 | System and Method for Dynamic Path Optimization - Techniques of dynamic path optimization are disclosed. In some embodiments, a method comprises receiving an instruction to determine an optimal path from a source geographical location to a destination geographical location, and determining an optimal path from the source geographical location to the destination geographical location using corresponding historical traffic information for each one of a plurality of sub-paths. The historical traffic information for each sub-path may correspond to an estimated arrival time at a start location for the corresponding sub-path and be used to select sub-paths from the plurality of sub-paths. The selected sub-paths may define the optimal path. In some embodiments, the historical traffic information comprises an indication of traffic flow for the corresponding sub-path. In some embodiments, the indication of traffic flow comprises an average speed of traffic flow. | 03-26-2015 |
20150120600 | TIME AND LOCATION BASED DELIVERY OPTIMIZATION - Methods, systems, and computer program products for logistics management are described. A root node in a tree representing a home base may be established, the root node comprising a capacity of a corresponding delivery vehicle. One or more unassigned delivery points may be added as a child node of the root node if a path to the corresponding unassigned delivery point is feasible. A next level delivery point may be added as a child node of a node in a tree level | 04-30-2015 |
20150120731 | PREFERENCE BASED CLUSTERING - To cluster objects associated with a dataset, a selection of criteria is received. For the received criteria, preference information is received to perform a preference-based clustering of the objects. Based on the preference information, a uni-criterion preference degree corresponding to each of the selected criterion is computed. The uni-criterion preference degrees of all the selected criteria are aggregated to compute a universal preference degree. Based on a preference-type and the computed preference degree, a relationship matrix is generated. The matrix representing similarity measure between the objects is generated. The objects are clustered according to the relationship matrix. A visualization of the clustered objects is rendered on an associated user interface. | 04-30-2015 |
20150178799 | SYSTEM AND METHOD OF FUEL FILLING TO MINIMIZE FUEL COST - In an example, a method for determining quantities of fuel to dispense at a plurality of terminals along a transit route of a vehicle includes identifying a plurality of terminals along the transit route, each terminal of the plurality of terminals have an associated cost-per-unit of fuel dispensed; initializing a set of candidate fueling scenarios, each candidate fueling scenario including an initial array of values, each value in the array of values indicating a quantity of fuel to dispense to the vehicle at one of the plurality of terminals along the transit route; iteratively, using at least one processor, modifying the set of candidate scenarios; identifying the candidate scenario of the set of candidate scenarios with the lowest total fuel cost; and transmitting for display, the quantity of fuel to dispense at each of the plurality of terminals according to the identified lowest total fuel cost candidate scenario. | 06-25-2015 |