Oracle International Corporation

Andrew Vakhutinsky

Jorge Luis Rivero Perez

Su-Ming Wu

Setareh Borjian Boroujeni

Kenny C Gross

Sungpack Hong

David Vengerov

Alan Paul Wood

Kiran V Panchamgam

Bradley R Williams

Sajith Vijayan

Saraswati Yagnavajhala

DeJun Li

Dhruv Agarwal

Akash Chatterjee

Recep Yusuf Bekci

Mengzhenyu Zhang

Kirby Bosch

Jean-Philippe Dumont

John Thomas Coulthurst

Denysse Diaz

Ngai-Hang Zachary Leung

Sanghoon Cho

Kresimir Mihic

Santosh Bai Reddy

Embodiments upsell a hotel room selection by generating a first hierarchical prediction model corresponding to a first hotel chain, the first hierarchical prediction model receiving reservation data from one or more corresponding first hotel properties, and generating a second hierarchical prediction model corresponding to a second hotel chain, the second hierarchical prediction model receiving reservation data from one or more corresponding second hotel properties. At each of the first hierarchical prediction model and the second hierarchical prediction model, embodiments generate corresponding model parameters. At a horizontal federated server, embodiments receive the corresponding model parameters and average the model parameters to be used as a new probability distribution, and distribute the new probability distribution to the first hotel properties and the second hotel properties.

Machine learning based federated learning with hierarchical modeling hotel upsell

Embodiments generate a demand model for a potential hotel customer of a hotel room. Embodiments, based on features of the potential hotel customer, form a plurality of clusters, each cluster including a corresponding weight and cluster probabilities. Embodiments generate an initial estimated mixture of multinomial logit ('MNL') models corresponding to each of the plurality of clusters, the mixture of MNL models including a weighted likelihood function based on the features and the weights. Embodiments determine revised cluster probabilities and update the weights. Embodiments estimate an updated estimated mixture of MNL models and maximize the weighted likelihood function based on the revised cluster probabilities and updated weights. Based on the update weights and updated estimated mixture of MNL models, embodiments generate the demand model that is adapted to predict a choice probability of room categories and rate code combinations for the potential hotel customer.

Artificial intelligence based hotel demand model

Embodiments optimize inventory allocation of a retail item, where the retail item is allocated from a plurality of different fulfillment centers to a plurality of different customer groups. Embodiments receive historical sales data for the retail item and estimate demand model parameters. Embodiments generate a network including first nodes corresponding to the fulfillment centers, second nodes corresponding to the customer groups, and third nodes between the first nodes and the second nodes, each of the third nodes corresponding to one of the second nodes. Embodiments generate an initial feasible inventory allocation from the first nodes to the second nodes and solves a minimum cost flow problem for the network to generate an optimal inventory allocation.

Inventory allocation and pricing optimization system for distribution from fulfillment centers to customer groups

Embodiments provide optimized room assignments for a hotel in response to receiving a plurality of hard constraints and soft constraints and receiving reservation preferences and room features. The optimization includes determining a guest satisfaction assignment cost based on the reservation preferences and room features, determining an operational efficiency assignment cost, generating a weighted cost matrix based on the guest satisfaction assignment cost and the operational efficiency assignment cost, and generating preliminary room assignments based on the weighted cost matrix. When the preliminary room assignments are feasible, the preliminary room assignments are the optimized room assignments comprising a feasible selection of elements of the matrix. When the preliminary room assignments are infeasible, embodiments relax one or more constraints and repeat the performing optimization until the preliminary room assignments are feasible.

Method, system, and non-transitory computer readable medium for an artificial intelligence based room assignment optimization system

Systems, methods, and other embodiments associated with controlling inventory depletion by offering different prices to different customers are described. In one embodiment, a method includes establishing first and second allocations of fulfillment centers to different geographic regions during a markdown phase. Different price schedules are determined for the orders to be fulfilled during the markdown phase based on the first and second allocations. A predicted profit is generated for the orders fulfilled under each of the different price schedules. A price schedule corresponding to the first allocation is selected as resulting in a greater predicted profit than another one of the different price schedules. A sale terminal is controlled to enact the selected price schedule during the markdown phase to cause fulfillment of the incoming orders according to the first allocation of the fulfillment centers.

System and method for controlling inventory depletion by offering different prices to different customers

Embodiments determine a price schedule for an item by, for each item, receiving a set of prices for the item, an inventory quantity for the item, a per-segment demand model for the item, and an objective function that is a function of the per-segment demand model and maximizes revenue based at least on a probability of a return of the item and a cost of the return. Embodiments allocate the inventory quantity among a plurality of customer segments based at least on a predicted contribution of each customer segment to the objective function. Embodiments determine a markdown portion of the price schedule for the item that maximizes the objective function, where the markdown portion assigns a series of prices selected from the set of prices for respective time periods during a clearance season for the item.

Price optimization system

The disclosed embodiments relate to a system that facilitates deployment of utility repair crews to nodes in a utility network. During operation, the system determines a node criticality for each node in the utility network based on a network-reliability analysis, which considers interconnections among the nodes in the utility network. The system also determines a node failure probability for each node in the utility network based on historical weather data, historical node failure data and weather forecast information for the upcoming weather event. The system uses the determined node criticalities and the determined node failure probabilities to determine a deployment plan for deploying repair crews to nodes in the utility network in preparation for the upcoming weather event. The system then presents the deployment plan to a person who uses the deployment plan to deploy repair crews to be available to service nodes in the utility network.

Optimally deploying utility repair assets to minimize power outages during major weather events

A system for determining product pricing for a product category receives a non-linear problem for the product category, in which the non-linear problem includes a demand model. For a plurality of pair of products in the product category, the system determines coefficients for a change in demand of a first product when a price of a second product is changed. The system then generates an approximate Mixed Integer Linear Programming ('MILP') problem that includes a change of demand based on a sum of the determined coefficients. The system then solves the MILP problem to obtain a MILP solution, which provides the product pricing.

Product pricing optimizer

A system for optimizing shelf space placement for a product receives decision variables and constraints, and executes a Randomized Search ('RS') using the decision variables and constraints until an RS solution is below a pre-determined improvement threshold. The system then solves a Mixed-Integer Linear Program ('MILP') problem using the decision variables and constraints, and using the RS solution as a starting point, to generate a MILP solution. The system repeats the RS executing and MILP solving as long as the MILP solution is not within a predetermined accuracy or does not exceed a predetermined time duration. The system then, based on the final MILP solution, outputs a shelf position and a number of facings for the product.

Growing community of inventors

Sharon, MA, United States of America

Andrew Vakhutinsky