Shelf space product placement 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 predetermined improvement threshold. The system then solves a MixedInteger 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.
Latest Oracle Patents:
 Dynamically selecting contact center workflows based on workflow insights
 Network of nodes with delta processing
 Quick learning recommendation method, nontransitory computer readable medium and system for baskets of goods
 Method and system for efficient processing of polymorphic table functions
 Automatic derivation of shard key values and transparent multishard transaction and query support
This application claims priority of Provisional Patent Application Ser. No. 61/625,366, filed on Apr. 17, 2012, the contents of which is hereby incorporated by reference.
FIELDOne embodiment is directed generally to a computer system, and in particular to a computer system that optimizes retail shelf space product placement.
BACKGROUND INFORMATION“Facings” in the retail industry refers to the amount of shelf space a particular product is given. A lot of facing generally increases sales of a particular product, and frequently manufacturers will pay more money to get more facings for their products. This inevitably leads to situations where the largest manufacturers end up with the most amount of facings because they are able to pay the most.
In conjunction with facing determinations for retail products, efficient allocation of shelf space and product assortment can significantly improve a retailer's profitability. A retail shelf space optimization problem in general is the problem of finding the optimal placement of merchandise items on the shelves to maximize one of many potential key performance indicators (“KPI”), such as revenue, profit or sales volume, by deciding where to place an item and how many facings to allocate subject to business and operation constraints.
The shelf space optimization problem can be considered a microspace optimization problem in that it is the problem of creating a planogram (“POG”) for a given retail category within given physical space. A POG is a diagram or model that indicates the placement of retail products on shelves in order to maximize sales
SUMMARYOne embodiment is a system for optimizing shelf space placement for a product. The system receives decision variables and constraints, and executes a Randomized Search (“RS”) using the decision variables and constraints until an RS solution is below a predetermined improvement threshold. The system then solves a MixedInteger 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.
One embodiment optimizes shelf space placement by alternating between a randomized search (“RS”) heuristic and solving a MixedInteger Linear Program (“MILP”) in order to determine, for a retail item, which shelf the item should be assigned and the number of its facings. The determination maximizes at least one of a key performance indicator (“KPI”), such as revenue, profit or sales volume.
Computer readable media may be any available media that can be accessed by processor 22 and includes both volatile and nonvolatile media, removable and nonremovable media, and communication media. Communication media may include computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media.
Processor 22 is further coupled via bus 12 to a display 24, such as a Liquid Crystal Display (“LCD”), for displaying information to a user. A keyboard 26 and a cursor control device 28, such as a computer mouse, is further coupled to bus 12 to enable a user to interface with system 10.
In one embodiment, memory 14 stores software modules that provide functionality when executed by processor 22. The modules include an operating system 15 that provides operating system functionality for system 10. The modules further include a shelf space product placement optimization module 16 that generates optimized shelf space product placement for retail products, as disclosed in more detail below. System 10 can be part of a larger system, such as an enterprise resource planning (“ERP”) system. Therefore, system 10 will typically include one or more additional functional modules 18 to include the additional functionality. A database 17 is coupled to bus 12 to provide centralized storage for modules 16 and 18 and store pricing information, inventory information, ERP data, etc.
In one embodiment, system 10 receives a set of merchandise items (i.e., a planogram (“POG”) category) in a selected store area (e.g., an aisle or department) defined by the area fixtures, item attributes and demand as a function of the number of facings and location. Given the item set positioned in the specific area of a particular store, the main objective is to determine location and the number of facings for each item that would maximize certain KPI parameters, such as total revenue, profit, or sales volume subject to the total shelf capacity, and certain item placement and assortment rules.
Further, in one embodiment each item may have one or two attributes determining its placement rules. One attribute (e.g., the brand of the item) is referred to as the “vertical blocking attribute” and determines the vertical boundaries between groups of items with the same attribute value (i.e., vertical blocking between different brands). These boundaries are defined within some given tolerance.
Other placement and assortment rules in one embodiment may include the list of mandatory items that cannot be dropped out of assortment, allornothing items that can be dropped out of assortment only together, limited selection item groups with given min/max number of items to be present in the assortment, equal number of facings item groups that have to be placed with the same number of facings, and item groups that have to be placed on the same shelves.
In one embodiment, the solution to the problem (i.e., the optimized shelf space product placement determination) is the decision as to whether to keep the item or to take it out of the assortment, and in the former case the number of its facings and shelf location. Therefore, since each item cannot be placed on more than one shelf, embodiments generate two sets of decisions: (1) the shelf the item should be assigned; and (2) the number of its facings.
One embodiment has an optimization objective of maximizing one of the KPIs such as sales volume, revenue, profit margin etc. For the purpose of formulating the optimization problem, it is assumed in one embodiment that all KPIs are functions of sales volume, with known userdefined parameters such as the price and the cost of an item. The sales volume of each item is considered to be a function of the number of facings and shelf assignment, which is given as part of the input. When an item is taken out of the assortment, its associated sales volume and generated revenue are assumed to be partially transferred to other similar items in the assortment.
In one embodiment, the following constraints are considered as inputs to the optimization problem:

 Usable Shelf Capacity
This is a hard constraint based on the shelf length.

 AttributeBased Blocking and General Visual Guidance
This constraint forces items that share the same attribute value (e.g., brand or size) to be placed together in the block defined by vertical or horizontal boundaries. It is also assumed that there is a certain tolerance associated with violating vertical block alignment.

 AssortmentBased Group Constraints
These constraints include mandatory items and allornothing groups.

 Placement Constraints
A group of items can be requested to be placed on the same shelf (“same shelf” constraint). Alternatively, constraints limit the shelves on which certain items can be placed or their min/max number of facings. Another type of placement constraint ensures the same number of facings for several items in a predefined group.

 Shelf Uniqueness
An item can be assigned only to a single shelf.
 Shelf Uniqueness
In one embodiment, input data in addition to the constraints is received by system 10 of

 Assortment information:
 List of items together with their attributes and prices;
 Items that are allowed to be dropped from the assortment;
 Groups of items that are allowed to be dropped only together and choosefrom item groups and their attributes; and
 Cumulative demand transference from the dropped item, which is computed as total increase in the objective function value due to demand transfer to other items when the given item is taken out of assortment.
 Per item/per shelf: min/max number of facings, interitem spacing (default=0).
 Number of shelves and their length.
 Itemtoshelf assignment restrictions:
 Peritem: which shelves the item is allowed to be placed; and
 Peritemgroup: placetogether group list and shelf restrictions (if any).
 Peritem, pershelf, per number of facings: expected sales volume and total facing width.
 Merchandise attributebased blocking rules and attributebased spacing.
 Assortment information:
The following are input decision variables used in one embodiment, where the attributebased blocking is defined as brandbased blocking. However, embodiments can used any other item attribute without loss of generality. The input decision variable are as follows:
Input Decision Variables
 n=number of shelves (two shelves in different fixtures are considered different);
 m=number of items;
 L_{j}=length of shelf j;
 S_{i}=set of shelves allowed for placing product i;
 T={T_{1}, T_{2}, . . . } set of item groups to be kept together on the same shelf;
 G={G_{1}, G_{2}, . . . } set or item groups that have the same number of facings;
 B=ordered set of brands (or other attributebased vertically blocked subsets);
 b={i_{1}, i_{2}, . . . } set of items in brand b ε B;
 w_{ik}=total width taken by k facings of item i (normally, w_{ik}=interitem_space+facing_width*k);
 v_{ij}^{k}=sales volume for item i when it is placed on shelf j with k facings (obtained from sales volume calculation procedure);
 K_{ij}=set of allowed number of facings for item i on shelf j;
 k_{s}^{min}, k_{s}^{max}=min/max number of items in “select subset” set s;
 pi and c_{i}=price and cost of item i;
 g_{i}=total revenue gain due to demand transference when item i is dropped from the assortment (assuming demand transference matrix t_{ij }is given, it can be computed as g_{i}=Σ_{j}p_{j}t_{ij});
 W_{b}=desired width for brand b or other attributebased group vertical blocking;
 ε_{b}=tolerance for brand b or other attributebased group vertical blocking;
 l_{p}=item sets to be blocked horizontally (one above the other).
One embodiment provides shelf space product placement optimization by alternating between a Randomized Search (“RS”) heuristic and formulating and solving the problem as MixedInteger Linear Program (“MILP”) using any commercially available third party MILP solver.
At 302, the constraints, input data and input decision variables used to obtain expected sales volume as a function of merchandise item position and number of facings, as disclosed above, is received.
At 304, using the decision variables, the RS algorithm is executed until its solution improvement falls below a predefined threshold. Additional details about the RS algorithm is disclosed below. In one embodiment, the predefined threshold is 0.8.
At 306, the solution of the RS algorithm is used as starting point of a MILP solver to speed up its performance. In other words, the RS algorithm solution is converted to a MILP solution. As disclosed in detail below, this includes transforming the RS algorithm solution into variables of the MILP formulation problem. Once this is done, the MILP problem can be solved by any widely available and known MILP solver.
At 308, the MILP solver is run for a specified time (e.g., run for one minute) or until the solution to the MILP problem is within the prespecified accuracy (e.g., within 1% of the optimal solution).
At 310, it is determined whether the solution to the MILP problem is within predefined accuracy (e.g., within 1%) or exceeds a total running predefined time duration (e.g., 10 minutes). If no at 310, the functionality continues at 304 where the MILP solution is converted to the corresponding equivalent solution to start the RS algorithm by setting its decision variables based on the MILP solution, as disclosed in detail below.
If yes at 310, at 312 the optimized solution in terms of shelf position and number of facings for each product is output.
As discussed above, at 306 the decision variables from the RS algorithm are used to formulate the MILP. The MILP formulation is as follows:
MILP FormulationVariables
Decision variables
Auxiliary variables
Constraints
 Mandatory items: ∀i ε MandatorySet: z_{i}=0
 Limited Selection: ∀s ε SelectSubsetSet:k_{s}^{min}≦Σ_{iεs}(1−z_{i})≦k_{s}^{max }
 Allornothing: ∀A ε AllOrNothing: Σ_{iεA}z_{i}=−A*Z_{A }
 Unique assignment:
 Equal number of facings (all items in each group G_{l }ε G to have the same number of facings):
 Same shelf (keep all products in T_{k }ε T on the same shelf):
 Vertical blocking:
 Horizontal blocking: Suppose two product sets I_{1 }and I_{2 }have to be horizontally blocked one above the other. For example, I_{1 }may contain items of small size and I_{2 }may contain items of large size and small size items have to be placed on upper shelves whereas large size items have to placed on lower shelves. However, it may not be known in advance which shelves are assigned to large items and which shelves are assigned to small items. Assume that shelves are numbered from top to bottom. The following constraints therefore ensure the horizontal blocking:
Objective
The objective below is for revenue maximization. Objectives for margin and volume are obtained similarly by replacing p_{i }with (p_{i}c_{i}) or 1.
The solution to the above MILP problem can be obtained by solving it with any known commercial MILP solver “from scratch”. Alternatively, it can be obtained by solving it with an RS solver and converting to the MILP solution following the procedure disclosed in more detail below.
As disclosed in conjunction with 306 of
Denote RS decision variables defining the RS solution as follows:

 For each item i:
 j_{i}, index of the shelf the item assigned to;
 k_{i}, the number of facings;
 if k_{i}=0, the item is dropped from the assortment and j_{i }is undefined.
 For each item i:
Given these RS decision variables, the MILP variables defining a feasible solution are obtained as follows:
 For each shelf j:
 For each item i:
 If (k_{i}==0) z_{i}=1; else z_{i}=0;
 If (j==j_{i}) y_{ij}=1; else y_{ij}=0;
 For each allowed number of facings k ε K_{ij}:
 If(k==k_{i }and j=j_{i}) x_{ij}^{k}=1; else x_{ij}^{k}=0;
 For each item i:
 For each allornothing item group A:
 For any item i ε A: Z_{A}=z_{i}/* all z_{i }variables are the same in this group */
 For each keeptogether item group T_{k }ε T:
 For any item i ε T_{k}:
 For each shelf j:
 If (j==j_{i}) u_{kj}=1; else u_{kj}=0
 For each shelf j:
 For any item i ε T_{k}:
 For each thesamenumberoffacings group G_{l }ε G:
 For any item i ε G_{l}: number of facings for group G_{l}, k_{l}=k_{i }
 For each brand (or other attributebased group) b ε B:
As disclosed in conjunction with 310 of
If yes at 502, at 504 it is determined if the initial planogram is feasible. If no, functionality continues at 506.
If yes at 504, at 508 the “currentSolution” variable is set as the function “exploitShelfPlacement” with the input of the “initial planogram” variable from 504. The “exploitShelfPlacement” function is disclosed in detail in
At 510, the “exploreSolution” variable is set as a function of “exploreShelfPlacement” with the input of the “currentSolution” of 508. The “exploreShelfPlacement” function is disclosed in detail in
At 512, it is determined if a convergence criteria is reached, which in one embodiment is reached when there is no KPI improvement for the last two iterations. If no at 512, the functionality continues at 510. If yes at 512, the currentSolution is the optimized output of the placement of the items on the shelf or is used at the starting point for the MILP solver as disclosed at 306 of
At 602, S={set of all items}.
At 604, an item i is drawn from S at random without replacement.
At 606, I={item i}; C={set of all constraints that are a function of shelf position of item i}; and N={set of n randomly chosen constraints from C}, n≦C.
At 608, from each constraint c in N, m variables (different from a variable that represents item i) are chosen at random; and m≦number of variables in c.
At 610, the variables are mapped to items and the items are added to the set I.
At 612, M={set of feasible permutations of shelf positions of items in I, limited to some neighborhood around currentSolution}.
At 614, for each permutation p in M, position items to shelves as defined by p; “newSolution”=find optimal number of facings for all items in S, given the current shelf placement of items in S; if revenue(newSolution)>revenue(currentSolution) then currentSolution=newSolution.
At 616, it is determined if all items are checked out. If no, functionality continues at 604.
If yes at 616, at 618 it is determined if a convergence criteria has been reached. If no, functionality continues at 602. If yes at 618, at 620 the new “currentSolution” is returned.
At 702, “exploreSolution”=“currentSolution”.
At 704, S={set of all items}.
At 706, an item i is drawn from S at random without replacement.
At 708, I={item i}; C={set of all constraints that are a function of shelf position of item i}; and N={set of n randomly chosen constraints from C}, n≦C.
At 710, from each constraint c in N, m variables (different from a variable that represents item i) are chosen at random; and m≦number of variables in c.
At 712, the variables are mapped to items and the items are added to the set I.
At 714, M={set of feasible permutations of shelf positions of items in I, limited to some neighborhood around exploreSolution}.
At 716, a permutation p in M is chosen at random, position items to shelves as defined by p; “newSolution”=find optimal number of facings for all items in S, given the current shelf placement of items in S; if revenue(newSolution)>α*revenue(currentSolution) then exploreSolution=newSolution.
At 718, it is determined if all items are checked out. If no, functionality continues at 706.
If yes at 718, at 720 it is determined if a convergence criteria has been reached. If no, functionality continues at 704. If yes at 720, at 722 the new “exploreSolution” is returned.
At 802, it is determined if the initial assignment of the number of facings is feasible. If no, functionality continues at 804. At 804, the initial assignment=find a feasible assignment of number of facings, given the current shelf positioning of items.
If yes at 802, at 806 the “currentSolution” variable is set as the function “exploitFacingAssignment” with the input of the “initial assignment” variable from 802 or 804. The “exploitFacingAssignment” function is disclosed in detail in
At 808, the “exploreSolution” variable is set as a function of “exploreFacingAssignment” with the input of the “currentSolution” of 806. The “exploreFacingAssignment” function is disclosed in detail in
At 810, it is determined if a convergence criteria is reached. which in one embodiment is reached when there is no KPI improvement for the last two iterations. If no at 810, the functionality continues at 808. If yes at 810, the currentSolution is the optimized output of the number of facings for each item given the current shelf placement of the items on the shelf or is used at the starting point for the MILP solver as disclosed at 306 of
At 902, S={set of all items}.
At 904, an item i is drawn from S at random without replacement.
At 906, I={item i}; C={set of all constraints that are a function of number of facings of item i}; and N={set of n randomly chosen constraints from C}, n≦C.
At 908, from each constraint c in N, m variables (different from a variable that represents item i) are chosen at random; and m≦number of variables in c.
At 910, the variables are mapped to items and the items are added to the set I.
At 912, M={set of feasible permutations of number of facings of items in I, limited to some neighborhood around currentSolution}.
At 914, for each permutation p in M, newSolution=assign number of facings to items as defined by p; if revenue(newSolution)>revenue(currentSolution) then currentSolution=newSolution.
At 916, it is determined if all items are checked out. If no, functionality continues at 904.
If yes at 916, at 918 it is determined if a convergence criteria has been reached. If no, functionality continues at 902. If yes at 918, at 920 the new “currentSolution” is returned.
At 1002, “exploreSolution”=“currentSolution”.
At 1004, S={set of all items}.
At 1006, an item i is drawn from S at random without replacement.
At 1008, I={item i}; C={set of all constraints that are a function of the number of facings of item i}; and N={set of n randomly chosen constraints from C}, n≦C.
At 1010, from each constraint c in N, m variables (different from a variable that represents item i) are chosen at random; and m≦number of variables in c.
At 1012, the variables are mapped to items and the items are added to the set I.
At 1014, M={set of feasible permutations of number of facings of items in I, limited to some neighborhood around exploreSolution}.
At 1016, a permutation p in M is chosen at random, “newSolution”=assign number of facings to items as defined by p; if revenue(newSolution)>α*revenue(currentSolution) then exploreSolution=newSolution.
At 1018, it is determined if all items are checked out. If no, functionality continues at 1006.
If yes at 1018, at 1020 it is determined if a convergence criteria has been reached. If no, functionality continues at 1004. If yes at 1020, at 1022 the new “exploreSolution” is returned.
As disclosed, embodiments optimize shelf space placement by alternating between RS and MILP in order to determine, for a retail item, which shelf the item should be assigned and the number of its facings. The determination maximizes at least one of a key performance indicator (“KPI”), such as revenue, profit or sales volume.
Several embodiments are specifically illustrated and/or described herein. However, it will be appreciated that modifications and variations of the disclosed embodiments are covered by the above teachings and within the purview of the appended claims without departing from the spirit and intended scope of the invention.
Claims
1. A computerreadable medium having instructions stored thereon that, when executed by a processor, cause the processor to optimize shelf space placement for a product, the optimization comprising:
 receiving input decision variables and constraints;
 executing a Randomized Search (RS) using the input decision variables and constraints until an RS solution is below a predetermined improvement threshold, wherein the RS solution comprises first RS solution decision variables;
 solving a MixedInteger Linear Program (MILP) problem using the first RS solution decision variables and constraints, wherein the RS solution is a starting point of the solving to generate a MILP solution by transforming the first RS solution decision variables into MILP decision variables;
 when the MILP solution is not within a predetermined accuracy or does not exceed a predetermined time duration, alternating executing a second RS based on the previous MILP solution until a second RS solution comprising second RS solution decision variables is below the predetermined improvement threshold and solving the MILP problem by transforming the second RS solution decision variables into MILP decision variables, until the MILP solution is within the predetermined accuracy or does exceed the predetermined time duration; and
 based on the MILP solution, outputting a shelf position and a number of facings for the product.
2. The computerreadable medium of claim 1, further comprising receiving for a store a set of products in a selected store area, wherein the output shelf position and the number of facings optimizes a key performance indicator for the store.
3. The computerreadable medium of claim 2, wherein the key performance indicator comprises at least one of revenue, profit or sales.
4. The computerreadable medium of claim 1, wherein the product comprises a vertical blocking attribute.
5. The computerreadable medium of claim 1, wherein the product comprises a horizontal boundary attribute.
6. The computerreadable medium of claim 1, wherein the constraints comprise at least one of: usable shelf capacity, attributebased blocking, assortmentbased group constraints, placement constraints or shelf uniqueness.
7. The computerreadable medium of claim 1, further comprising optimizing the shelf space placement for a plurality of products, wherein further outputting based on the MILP solution, for each of the plurality of products, whether to keep the product among a product assortment.
8. A computerimplemented method for optimize shelf space placement for an item in a store, the method comprising:
 receiving input decision variables and constraints;
 executing a Randomized Search (RS) using the input decision variables and the constraints until an RS solution is below a predetermined improvement threshold, wherein the RS solution comprises first RS solution decision variables;
 solving a MixedInteger Linear Program (MILP) problem using the first RS solution decision variables and the constraints, wherein the RS solution is a starting point of the solving to generate a MILP solution by transforming the first RS solution decision variables into MILP decision variables;
 when the MILP solution is not within a predetermined accuracy or does not exceed a predetermined time duration, alternating executing a second RS based on the previous MILP solution until a second RS solution comprising second RS solution decision variables is below the predetermined improvement threshold and solving the MILP problem by transforming the second RS solution decision variables into MILP decision variables, until the MILP solution is within the predetermined accuracy or does exceed the predetermined time duration; and
 based on the MILP solution, outputting a shelf position and a number of facings for the item.
9. The computerimplemented method of claim 8, further comprising receiving for the store a set of items in a selected store area, wherein the output shelf position and the number of facings optimizes a key performance indicator for the store.
10. The computerimplemented method of claim 9, wherein the key performance indicator comprises at least one of revenue, profit or sales.
11. The computerimplemented method of claim 8, wherein the item comprises a vertical blocking attribute.
12. The computerimplemented method of claim 8, wherein the item comprises a horizontal boundary attribute.
13. The computerimplemented method of claim 8, wherein the constraints comprise at least one of: usable shelf capacity, attributebased blocking, assortmentbased group constraints, placement constraints or shelf uniqueness.
14. The computerimplemented method of claim 8, further comprising optimizing the shelf space placement for a plurality of items, wherein further outputting based on the MILP solution, for each of the plurality of items, whether to keep the item among an item assortment.
15. A shelf space product optimizer system that optimizes shelf space placement for a product in a store, the system comprising:
 a processor;
 a storage device coupled to the processor storing instructions that when executed by the processor implements system modules comprising:
 a randomized searcher that receives input decision variables and constraints and executes Randomized Search (RS) using the input decision variables and constraints until an RS solution is below a predetermined improvement threshold, wherein the RS solution comprises first RS solution decision variables;
 a MixedInteger Linear Program (MILP) solver that receives the RS solution when it is below the predetermined improvement threshold and solves a formulated MILP problem using the first RS solution decision variables and constraints, wherein the RS solution is a starting point of the solving to generate a MILP solution by transforming the first RS solution decision variables into MILP decision variables; and
 a solution module that when the MILP solution is not within a predetermined accuracy or does not exceed a predetermined time duration, alternates executing a second RS based on the previous MILP solution until a second RS solution comprising second RS solution decision variables is below the predetermined improvement threshold and solves the MILP problem by transforming the second RS solution decision variables into MILP decision variables, until the MILP solution is within the predetermined accuracy or does exceed the predetermined time duration, and based on a final MILP solution, outputs a shelf position and a number of facings for the product.
16. The system of claim 15, the randomized searcher further receiving for the store a set of products in a selected store area, wherein the output shelf position and the number of facings optimizes a key performance indicator for the store, and the key performance indicator comprises at least one of revenue, profit or sales.
17. The system of claim 15, wherein the product comprises a vertical blocking attribute.
18. The system of claim 15, wherein the product comprises a horizontal boundary attribute.
19. The system of claim 15, wherein the constraints comprise at least one of: usable shelf capacity, attributebased blocking, assortmentbased group constraints, placement constraints or shelf uniqueness.
20. The system of claim 15, wherein the MILP solver further comprises optimizing the shelf space placement for a plurality of products, wherein further outputting based on the MILP solution, for each of the plurality of products, whether to keep the product among a product assortment.
7092896  August 15, 2006  Delurgio et al. 
20030204474  October 30, 2003  Capek et al. 
 NPL_{—}GAMS, General Algebraic Modeling System, Wikipedia, downloaded on Jul. 20, 2014, 4 pages.
 ISO intelligent store optimization; “Galleria's Latest Solution Provides Fast, Seamless Optimization and Management of Store specific Space”; http://www.aldata.com/com/resources/details/spaceplanning; last downloaded on Nov. 9, 2012.
 Aldata Space Optimization; “Optimize Retail Space with Aldata Space Optimization”; http://www.galleriarts.com/images/stories/Downloads/iso.pdf; last downloaded on Nov. 9, 2012.
 M. Corstjens et al.; “A Model for Optimizing Retail space Allocations”; Management Science; vol. 27 No. 7; Jul. 1981; pp. 822833.
 A. Hübner et al.; “Quantitative Models for Retail Category Management: A Review of Assortment and Shelf Space Planning in Practice, Software Applications and Science Working Paper”; Catholic University of EichstättIngolstadt; Feb. 1, 2011; pp. 127.
 C. Murray et al.; “Joint Optimization of Product Price, Display Orientation and shelfspace allocation in Retail Category Management”; Journal of Retailing Manuscript # MS 2008MRP014; Feb. 12, 2010; pp. 136.
Type: Grant
Filed: Nov 9, 2012
Date of Patent: Jan 6, 2015
Patent Publication Number: 20130275277
Assignee: Oracle International Corporation (Redwood Shores, CA)
Inventors: Kresimir Mihic (San Diego, CA), Andrew Vakhutinsky (Norwood, MA), David Vengerov (San Jose, CA)
Primary Examiner: Paul Danneman
Application Number: 13/673,347
International Classification: G06Q 10/00 (20120101); G06Q 10/06 (20120101); G06Q 10/04 (20120101); G06Q 30/06 (20120101);