JP2019160224A - Menu planning system, method and program - Google Patents

Abstract

To provide a menu planning system, a program and method capable of planning collectively, menu of meal for multi times, based on kinds and amounts of foods which are designated.SOLUTION: A menu planning system comprises: a food amount acquisition part for acquiring consumption object food amount data including amounts of a plurality of foods which are consumption objects; an optimal condition acquisition part for acquiring an optimal condition being a condition related to each consumption object food and/or a condition related to a menu which can be cooked based on each consumption object food; a menu example data acquisition part for acquiring menu example data including a plurality of prescribed menu examples and foods and food amounts required for cooking of the menu; a menu number acquisition part for acquiring a menu number to be identified; and an optimal menu identification part for, based on the consumption object food amount data acquired by the food amount acquisition part, the optimal condition acquired by the optimal condition acquisition part, and the menu number acquired by the menu number acquisition part, identifying optimal menu capable of satisfying the optimal condition for the menu number, based on the menu example data.SELECTED DRAWING: Figure 5

Description

  The present invention relates to a system for planning a menu based on a plurality of food ingredients.

  In recent years, due to the increase in double-income households, it has become difficult for ordinary households to purchase foods every day, and cases of bulk purchases on home delivery or holidays are increasing. In the case of such a bulk purchase mode, the amount of ingredients at hand is relatively easy to grasp and manage, but the necessity of systematically consuming the ingredients becomes higher.

  On the other hand, in recent years, websites and software that can search for cooking recipes created by cooking experts and general users have become widespread. In these websites and software, when a user designates an ingredient, a recipe using the ingredient is proposed. For example, Patent Document 1 discloses a technique for performing a recipe search based on surplus ingredients.

Japanese Patent No. 5651273

  However, in the conventional cooking recipe search technology based on these ingredients, when the ingredients or the amount of ingredients are specified by the user or the like, only a meal recipe for a single meal satisfying the condition is retrieved and proposed. There wasn't. Therefore, if the user intends to create a menu plan for multiple meals, for example, three meals in the morning, noon, and evening, in order to systematically consume the ingredients at hand, the types of ingredients at hand and Recipe search had to be performed multiple times while considering the amount. The difficulty of planning this menu plan was high and inconvenient.

  The present invention has been made under the above-mentioned technical background, and the purpose of the present invention is to plan a menu of a plurality of meals at once based on the type and amount of designated ingredients. The purpose is to provide a menu planning system and the like.

  Other objects and operational effects of the present invention will be easily understood by those skilled in the art by referring to the following description of the specification.

  The above technical problem can be solved by an information processing apparatus having the following configuration.

  That is, the menu planning system according to the present disclosure includes a food amount acquisition unit that acquires consumption target food amount data including amounts of a plurality of consumption target foods, conditions for each of the consumption target foods, and / or each of the consumption target foods. Menu condition data for obtaining menu example data, including an optimum condition acquisition unit that acquires the optimum condition, which is a condition related to a menu that can be cooked based on, a plurality of predetermined menu examples, and ingredients and amounts of ingredients necessary for cooking An acquisition unit, a menu number acquisition unit for acquiring the number of menu items to be specified, the consumption target food amount data acquired by the food amount acquisition unit, the optimal condition acquired by the optimal condition acquisition unit, and And an optimal menu specifying unit that specifies an optimal menu that satisfies the optimal condition for the number of menus based on the menu example data based on the menu number acquired by the menu number acquiring unit.

  According to such a configuration, a menu of a plurality of meals can be collectively planned based on the type and amount of the designated food material.

  The menu planning system may further include a number condition acquisition unit that is information on the number of people who consume the menu, and the optimal menu specifying unit specifies the optimal menu in consideration of the number of people. .

  The consumption target food amount data may be food amount data in which a consumption upper limit amount and a consumption lower limit amount of each consumption target food material are defined.

  The specification of the optimal menu data may be performed by solving a mixed integer programming problem based on the amount of food to be consumed, the optimal conditions, and the menu example data with a solver program.

  The optimum condition may be a condition for maximizing a consumption amount of the specific consumption target food.

  The optimum condition may be a condition of maximizing a numerical value corresponding to the popularity of the menu.

  The optimum condition may be a condition of maximizing a numerical value corresponding to the economic efficiency of the menu.

  The optimum condition may be a condition of minimizing a total sum of each difference amount between each food amount required for the optimum menu and each consumption target food amount.

  The optimum condition is a condition of minimizing the sum of the corresponding amount of each ingredient required for the optimum menu and the amount corresponding to the difference between the quantities of the consumption target ingredients multiplied by a predetermined coefficient set for each ingredient. It may be.

  The predetermined coefficient may be a coefficient set according to the weight of each food material.

  The menu planning system may further include a display unit, and the display unit may display the optimal menu and related information on the optimal menu.

  The present invention can also be considered as a menu planning network system. That is, the menu planning network system according to the present invention is a menu planning network system including an information processing device and a server device connected to the information processing device via a network. Optimal conditions, which are a food amount acquisition unit for acquiring consumption target food amount data including the amount of consumption target food, conditions regarding each of the consumption target ingredients and / or conditions regarding a menu that can be cooked based on each of the consumption target ingredients An optimal condition acquisition unit for acquiring menu items, a menu example data acquisition unit for acquiring menu example data including a plurality of predetermined menu examples and ingredients and ingredients necessary for cooking, and a menu for acquiring the number of menu items to be specified A number acquisition unit, the consumption target food amount data acquired by the food amount acquisition unit, the optimal condition acquired by the optimal condition acquisition unit, and the menu number acquisition An optimal menu specifying unit that specifies an optimal menu that satisfies the optimal condition for the number of menus based on the menu example data based on the number of menus acquired in step (b), and the consumption amount data and The input of the optimum condition is performed via the information processing apparatus.

  The present invention can also be considered as a menu planning method. That is, the menu planning method according to the present invention includes a food amount acquisition step of acquiring consumption target food amount data including a plurality of consumption target food amounts, conditions for each of the consumption target foods, and / or each of the consumption target foods. Menu condition data for obtaining menu example data including an optimum condition obtaining step for obtaining an optimum condition, which is a condition related to a menu that can be cooked based on, a plurality of predetermined menu examples, and ingredients and amounts of ingredients necessary for the cooking. An acquisition step, a menu number acquisition step for acquiring the number of menu items to be specified, the consumption target food amount data acquired in the food amount acquisition step, the optimal condition acquired in the optimal condition acquisition step, and Based on the menu number acquired in the menu number acquisition step, the optimal menu satisfying the optimal condition for the menu number is specified from the menu example data. And optimum menu specifying step, those with a.

  The present invention can also be considered as a computer program. That is, the menu planning computer program according to the present invention includes a computer, a food amount acquisition unit that acquires consumption target food amount data including amounts of a plurality of consumption target foods, and conditions and / or each of the consumption target foods Menu condition data including the optimum condition acquisition unit that acquires the optimum conditions, which are conditions related to the menu that can be cooked based on the consumption target ingredients, and a plurality of predetermined menu examples and the ingredients and amounts of ingredients necessary for cooking Menu item data acquisition unit to perform, menu number acquisition unit to acquire the number of menu items to be specified, the consumption target food amount data acquired by the food amount acquisition unit, and the optimum acquired by the optimum condition acquisition unit Based on the conditions and the number of menus acquired by the menu number acquisition unit, the optimal menu for identifying the optimal menu satisfying the optimal condition for the number of menus from the menu example data It is intended to function as a menu planning device and a specific part.

  According to this indication, the menu of a plurality of meals can be collectively planned based on the kind and amount of the specified foodstuff.

FIG. 1 is an overall configuration diagram of the system. FIG. 2 is a configuration diagram of the menu planning server. FIG. 3 is a general flowchart regarding the operation of the system. FIG. 4 is a flowchart regarding the menu planning process. FIG. 5 is a screen diagram when various information is input. FIG. 6 is an explanatory diagram regarding the menu list. FIG. 7 is an explanatory diagram (part 1) relating to an image of taking out the usage amount array for each ingredient. FIG. 8 is an explanatory diagram (part 2) relating to an image of taking out the use amount array by foodstuff. FIG. 9 is an explanatory diagram relating to an image of the usage amount arrangement for each ingredient developed in the work area. FIG. 10 is an explanatory diagram regarding variables. FIG. 11 is an explanatory diagram regarding the contents of the mixed integer programming problem. FIG. 12 is an image diagram regarding application of the solver program. FIG. 13 is a flowchart related to the menu related information addition process. FIG. 14 is an explanatory diagram regarding an application image of the output variable string. FIG. 15 is a screen diagram when displaying the result.

  Hereinafter, an embodiment of a menu planning system, method, and program according to the present invention will be described in detail with reference to the accompanying drawings.

<1. First Embodiment>
A first embodiment of the present invention will be described with reference to FIGS.

<1.1 System configuration>
First, the configuration of the menu planning system 10 according to the present embodiment will be described with reference to FIGS. 1 and 2.

  FIG. 1 shows the overall configuration of the system. As is clear from the figure, the information processing terminal 1 is connected to the menu planning server 3 via the network 2 by wire or wirelessly. The menu planning server 3 is connected to a menu database 4 that stores a large number of menu data. In the present embodiment, the information processing terminal 1 is a terminal device such as a personal computer, a smartphone, a tablet terminal, or a digital television owned by the user, and the menu planning server 3 via the network 2 such as the Internet. It is configured to be able to communicate with both.

  FIG. 2 is a hardware configuration diagram of the menu planning server 3. As is clear from the figure, inside the menu planning server 3, a control unit 33, a storage unit 34, a communication unit 35, a display unit 36, and an input unit 37 are connected via a bus 32.

  The bus 12 is a path that mediates transmission / reception of control signals, data signals, and the like. The control unit 33 is configured by a CPU (Central Processing Unit). The storage unit 34 is a storage medium such as a ROM (Read Only Memory), a RAM (Random Access Memory), a flash memory, and a hard disk, and stores programs and data for executing various processes described below. The control unit 33 calls and executes a program stored in the storage unit 34 in a work memory area on a RAM constituting the storage unit 34. The communication unit 35 is a communication interface that mediates communication using the network 2, and communicates with other devices via the network 2. The display unit 36 includes a liquid crystal display and a logic circuit or the like (video adapter or the like) for realizing a video function in cooperation with the liquid crystal display. The input unit 37 is for inputting data. In the present embodiment, the input unit 37 is an input device such as a touch panel, a keyboard, and a microphone. The user can give a predetermined operation instruction, data input, and the like to the menu planning server 3 via the input unit 17.

  The storage unit 14 of the menu planning server 3 stores a solver program that can solve a predetermined problem corresponding to the mixed integer programming. Examples of the solver program include Cplex, SCIP, Gurobi, and lpsolve. There are two types of solver programs, one for finding one optimal solution and one for finding a plurality of optimum solutions. When using a solver program that requires a plurality of optimum solutions, a plurality of optimization conditions can be set.

  Further, the hardware configuration is not limited to the configuration according to the present embodiment. Accordingly, for example, distributed processing is performed using a plurality of server devices or the like, or a part of the device such as the storage unit 34 is separately arranged outside and connected via a network. It is possible to take a configuration.

  Since the hardware configuration of the information processing apparatus 1 is substantially the same as the hardware configuration shown in FIG. 2, the description thereof is omitted here.

<1.2 System operation>
Next, the operation of the menu planning system 10 according to the present embodiment will be described with reference to FIGS.

  FIG. 3 is a general flowchart for explaining the operation of the menu planning system 10. In the figure, when the processing starts, the information processing apparatus 1 allows the user to input the number of family members, the upper limit amount and the lower limit amount for each food item to be consumed, the food item to be used up, and the number of meals representing the number of meals. Is performed (S1). Note that these input processes may be performed by starting a predetermined application program. When the user performs a predetermined determination process after inputting such information, the information is transmitted from the information processing apparatus 1 to the menu planning server 3 via the network 2.

  FIG. 4 is an input screen diagram 50 displayed on the display unit of the information processing apparatus 1 when various types of information are input (S1). On the input screen diagram 50, an optimization condition input area 51 is provided at the upper left of the screen. Specifically, the optimization condition is set by using a radio button and a “food use up” condition for designating a food to be used up. You can choose between “popular” conditions that prioritize high popularity menus. In the example shown in the figure, a “food used up” condition for designating a food to be used up is selected.

  Immediately below the optimization condition input area 51, there is provided a used food selection area 52 that becomes active when the "food use up" condition is selected as the optimization condition. The food selection area 52 is configured such that a single used food can be selected by switching a display food by operating a vertical slide bar. In the example shown in the figure, “cabbage”, “Chinese cabbage”, “carrot”, “radish” are displayed in order from the top, and “cabbage” is selected.

  At the top of the right column of the screen 50 at the time of input, a number setting area 53 for setting the number of consumers of the menu is provided, including a display of “the number of family members”, and the menu is set using a slide bar. You can set the number of consumers. In the example of the figure, “4 people” is selected. Below the number setting area 53, a number of meal selection area 54 for selecting the number of meals is displayed together with the display of “number of meals”, and the number of meals can be set using a slide bar. In the example of FIG. 4, “3 meals” is set.

  Below the food selection area 52 is provided an upper limit setting area 55 provided with a plurality of slide bars for determining the upper limit of each food. From the top, cabbage, Chinese cabbage, carrot, cucumber, eggplant, onion, and bell pepper The upper limit amount can be set. In the example of FIG. 4, the upper limit amount of cabbage is 1, the upper limit amount of Chinese cabbage is 10, the upper limit amount of carrot is 10, the upper limit amount of cucumber is 3, the upper limit amount of eggplant is 0, the onion 3 is set as the upper limit amount and 20 is set as the upper limit amount of peppers.

  A lower limit amount setting area 56 provided with a plurality of slide bars for determining the lower limit amount of each food is provided at the lower part of the meal number selection area 54. From the top, cabbage, Chinese cabbage, carrot, cucumber, eggplant, onion, and The lower limit amount of peppers is settable. In the example of FIG. 4, the lower limit amount of cabbage is 0.3, the lower limit amount of Chinese cabbage is 0, the lower limit amount of carrot is 5, the lower limit amount of cucumber is 2, the lower limit amount of eggplant is 0. 1 is set as the lower limit amount of onions, and 0 is set as the lower limit amount of peppers.

  That is, in the example of FIG. 4, the content of the upper limit amount setting area 55 and the content of the lower limit amount setting area 56 are combined, the amount of cabbage used is 0.3 or more and 1 or less, and Chinese cabbage is not used. This means that 5 to 10 carrots, cucumbers are not used, eggplants are not used, onions are 1 to 3 and green peppers are not used.

  A determination button 57 is provided below the lower limit amount setting area 56. By selecting the determination button 57, each input is confirmed and input information is transmitted to the menu planning server 3 (S1). .

  Returning to FIG. 3, when the menu planning server 3 that has been in a standby state (S2NO) until information is input acquires the above information from the information processing apparatus 1 (S2 YES), the menu planning process is performed (S3).

  FIG. 4 is a flowchart showing details of the menu planning process. As is apparent from the figure, when the menu planning process starts, the menu planning server 3 receives from the information processing apparatus 1 and stores it in the storage unit 34, the number of family members, the upper limit amount information for each ingredient, and A process of reading the lower limit amount information, the food material information to be used up, and the number of meals information is performed and developed in the work area on the RAM of the storage unit 34 (S31). Thereafter, the menu planning server 3 reads a menu list including a number of menu examples (recipe information) from the menu DB (S32).

  FIG. 6 is an explanatory diagram showing an image related to the structure of the menu list 70. As is clear from the figure, the menu list 70 includes main dish data 71, such as “beef suki-ni”, “daikon radish bacon roll”, “meat of green pepper”, “spinned pepper”, etc. Side dish data 72, which is data on other side dishes, and soup data 73 which is data on soup such as “potato and onion miso soup”, “carrot potage” and the like. In addition, evaluation information 74 is set for each menu, and evaluation information 74 includes a popularity index that is a numerical value indicating the popularity of each menu, and an economy that is a numerical value indicating the economics (low price) of each menu. Sex index etc. are included. Furthermore, necessary ingredient amount data 75 which is the amount of ingredients necessary for cooking the main dish data 71, side dish data 72 and soup data 73 is included. In the table, as ingredients, cabbage, Chinese cabbage, Carrots, cucumbers, eggplants, onions, green onions,... That is, in the menu list 70, evaluation information 74 and necessary food amount data 75 for each menu are set.

  In addition, after the menu list 70 is read, the menu list 70 is expanded to the work area on the RAM of the storage unit 34 for each food row. 7 and 8 are image diagrams showing that the necessary cabbage amount column 751 and the necessary Chinese cabbage amount column 752 of the menu list 70 are read out to obtain the cabbage array 901 and the Chinese cabbage array 902. FIG. Each array read out in this way is collectively expanded into a work area 900 on the RAM of the storage unit 34. FIG. 9 is an image diagram when each array (cabbage array 901, Chinese cabbage array 902,..., Pepper array 903) is expanded into a work area 900 on the RAM of the storage unit 34.

  Returning to FIG. 4, after the menu list is read, the mixed integer programming problem 90 is created (S33).

  FIG. 11 is an explanatory diagram regarding the contents of the mixed integer programming problem 90. As is clear from the figure, the mixed integer programming problem 90 is composed of a problem 91 and a plurality of constraint conditions (for example, the constraint condition 92 to the constraint condition 102) for solving the problem 91. In the present embodiment, the problem 91 is the content “find the combination of variables that maximizes the total amount of cabbage used under the following conditions”. This is a problem set when cabbage is selected as a single-use food.

  Here, the variables will be described. FIG. 10 is an explanatory diagram relating to the contents of variables, and more specifically, is an explanatory table 80 showing the relationship between each menu consisting of a combination of main dishes, side dishes, and soup and variables. For the sake of convenience, in the figure, the three columns from the left of the table are displayed as the menu column 81 and the rightmost column is displayed as the variable column 86. As is clear from the figure, each menu consisting of a combination of main dishes, side dishes and soups described in the menu column 81 is associated with each variable 1 to variable N in the variable column 86, and variable 1 to variable. N takes one of two values, “0” indicating that the corresponding menu is not to be created and “1” indicating that the corresponding menu is to be created. As will be described later, a menu plan is finally made depending on whether this variable takes a value of “0” or “1”. Note that the constraint conditions related to such variables are a precondition constraint 92 corresponding to the constraint condition 0-2 and a precondition constraint 93 corresponding to the constraint condition 0-1 shown in FIG.

  Returning to FIG. 11, the constraint condition regarding each food will be described. The central upper part of FIG. 11 shows a constraint 94 definition 1 that is a precondition (definition) related to constraint 1, and the content is “the total usage amount of cabbage per person is based on the usage amount array for each ingredient. , “Determined in the following”, and below that, “0 * variable 1 + 0 * variable 2+... + 0.12 * variable N”. This is a condition that defines the total amount of cabbage used by one person. Further, under the definition 94 for the constraint condition 1, there is a lower limit amount constraint which is the constraint condition 1-1, which is “total amount of cabbage used by one person * the number of family members is equal to or greater than the input cabbage lower limit”. A condition 95 and an upper limit amount constraint condition 96 corresponding to the constraint condition 1-2 and corresponding to “the total amount of cabbage used by one person * the number of family members is equal to or less than the input cabbage upper limit” are displayed. That is, this defines a restriction condition regarding the upper limit amount and the lower limit amount of cabbage that is one food material.

  Such a constraint condition is provided for each food. Similarly, for “Chinese cabbage”, a constraint 97 definition 97, a lower limit amount constraint condition 98, and an upper limit amount constraint condition 99 are set, and for “green pepper”, A definition 100 for a constraint condition M, an upper limit amount constraint condition 101, and a lower limit amount constraint condition 102 are set. In addition, you may utilize the information already expand | deployed to the work area 900 on RAM of the memory | storage part 34 as the information regarding the quantity of each foodstuff.

  Returning to FIG. 4, after the mixed integer programming problem 90 is created, the created mixed integer programming problem 90 is solved by using a solver program (S34).

  FIG. 12 is an image diagram when the solver program is applied to the mixed integer programming problem 90. As is clear from the figure, by applying a solver program to the mixed integer programming problem 90, an output variable string 861 consisting of 0 and 1 is generated. As this solver program, various known programs can be used. For example, as described above, Cplex, SCIP, Gurobi, lpsolve, and the like can be used.

  FIG. 14 is an explanatory diagram regarding an application image of the output variable string 861 to the explanatory table 80 showing the relationship between each menu and variables. As is clear from the figure, the output variable string generated by the solver program is “0100101... 0”, which indicates that the menu is to be created in the second, fifth, and seventh. It is included. Therefore, the second menu is “main dish: radish bacon roll, side dish: boiled spinach, soup: carrot potage”, the fifth menu “main dish: ginger grilled, side dish: Three menus: Daikon radish pickled, soup: cabbage and wakame miso soup, 7th menu, “main dish: cabbage grilled, side dish: radish namul, soup: root vegetables miso soup” Identified as

  Returning to FIG. 4, after the solving process using the solver program for the mixed integer programming problem 90 is performed, the output variable variable string 861 and various data including the optimum menu data specified by the output variable string 861 are stored in the storage unit. The process of storing to 34 is performed (S35). After this process, the menu planning process (S3) ends.

  Returning to FIG. 3, when the menu planning process is performed, a process for adding menu-related information regarding the above-described three optimum menus is performed (S <b> 4). In this embodiment, this menu-related information is URL information, link information, and the like of recipe pages on the Internet corresponding to each menu. However, the menu-related information is not limited to such information, and thus may be, for example, a link to a sales site for foods related to the menu, information on the nutritional components of each menu, and the like.

  After the menu related information is added, a process of transmitting the planning result, that is, at least the optimal menu information and the menu related information added to the optimal menu information to the information processing apparatus 1 is performed (S5).

  When the information processing apparatus 1 in the information reception standby state (S6 NO) receives the planning result (S6 YES), the information processing apparatus 1 performs display processing of the planning result, that is, the planned menu (S7).

  FIG. 15 is a screen diagram showing the result displayed on the display unit of the information processing apparatus 1, that is, a screen diagram showing the displayed optimal menu table 130. In the figure, the leftmost column is a number column 134, the right side is a main dish display column 131, the right side is a side dish display column 132, and the right side is a soup display column 133. As is apparent from the figure, the set menu for three meals is displayed in each column. For example, on the top row, “radish bacon roll” is displayed as the main dish, “spinach no simmered” as the side dish, and “carrot potage” as the soup. Note that menu-related information is added to each of the three optimum menus described above, so that each menu name can be selected by a hyperlink or the like. Therefore, when an area corresponding to each menu name is selected via, for example, a touch panel, the menu can be moved to the recipe page for the menu.

  After this display process (S7) is performed, the process ends.

<2. Other>
In the above-mentioned embodiment, although the example which selected the food use up as an optimization condition was demonstrated, this indication is not limited to such a structure. Therefore, for example, a menu having a high degree of popularity may be specified using the degree of popularity or economy of the menu as an optimization condition, or a menu having a high economic efficiency (inexpensive) may be specified.

  In the above description, as the optimization conditions, the conditions related to the ingredients, for example, the condition that the specific ingredients are used up, and the conditions related to the menu, such as the popularity of the menu and the good economic efficiency are set as the optimization conditions. The present invention is not limited to such a configuration. Therefore, for example, a condition that takes into consideration both the condition relating to the ingredients and the condition relating to the menu may be adopted. As an example of such conditions, for example, in order to plan a menu that can use up all the ingredients at hand without waste, for example, the amount of each input food to be consumed and the optimal menu that is finally proposed The conditions etc. which minimize the sum total of the quantity (for example, the absolute value of each difference) equivalent to each difference with each foodstuff quantity required for (1) are mentioned.

  At this time, the sum may be calculated after multiplying each difference equivalent amount by a predetermined coefficient set for each food. Although this coefficient can be determined variously, as an example, a coefficient considering the influence of the weight of the food can be employed. For example, when one cabbage and cucumber are not used one by one, the number is the same one. However, if the general weight of cabbage is 1000 g and the weight of cucumber is 100 g, there is a difference of about 10 times when the weight is taken as a reference. In consideration of this influence, for example, by setting the cabbage coefficient to about 10 times the cucumber coefficient, a process that encourages the use of heavy ingredients may be performed.

  Furthermore, in the above-mentioned embodiment, it was set as the structure which inputs a minimum amount and an upper limit amount using a slide bar as a foodstuff quantity, However, The form of input is not limited to such a structure. Therefore, for example, a predetermined numerical value may be input and an appropriate upper and lower range may be determined as the lower limit amount and the upper limit amount.

  In addition, in the above-described embodiment, the menu planning system 10 is configured via a network, particularly the Internet, but is not limited to such a configuration. For example, the menu planning system 10 is activated in one apparatus or a local computer. And may be configured as a program that operates.

  It can be used in industries that produce menu planning systems, methods, and programs.

DESCRIPTION OF SYMBOLS 1 Information processing apparatus 2 Network 3 Menu planning server 4 Menu database 10 Menu planning system

Claims (14)

A food amount acquisition unit for acquiring consumption target food amount data including a plurality of consumption target food amounts;
An optimal condition acquisition unit for acquiring an optimal condition, which is a condition regarding each of the consumption target ingredients and / or a condition regarding a menu that can be cooked based on each of the consumption target ingredients;
A menu example data acquisition unit that acquires menu example data including a plurality of predetermined menu examples and ingredients and the amount of ingredients necessary for cooking,
A menu number acquisition unit for acquiring the number of menus to be specified;
Based on the consumption amount data acquired by the food amount acquisition unit, the optimal condition acquired by the optimal condition acquisition unit, and the menu number acquired by the menu number acquisition unit, A menu planning system comprising: an optimal menu specifying unit that specifies an optimal menu that satisfies the optimal condition for the number of menus from the menu example data. The menu planning system further includes:
Including a number of people condition acquisition section that is information about the number of people consuming the menu,
The menu planning system according to claim 1, wherein the optimal menu specifying unit specifies the optimal menu in consideration of the number of people.   3. The menu planning system according to claim 1, wherein the consumption target food amount data is food amount data in which a consumption upper limit amount and a consumption lower limit amount of each consumption target food are defined.   The identification of the optimal menu data is performed by solving a mixed integer programming problem based on the amount of food to be consumed, the optimal conditions, and the menu example data with a solver program. Menu planning system described in one.   The menu planning system according to any one of claims 1 to 4, wherein the optimum condition is a condition for maximizing a consumption amount of the specific consumption target food.   5. The menu planning system according to claim 1, wherein the optimum condition is a condition of maximizing a numerical value corresponding to the popularity of the menu.   5. The menu planning system according to claim 1, wherein the optimum condition is a condition of maximizing a numerical value corresponding to the economic efficiency of the menu.   The optimal condition is any one of claims 1 to 4, wherein the total sum of the amount of each ingredient required for the optimal menu and the amount of each difference corresponding to the amount of the consumption target food is minimized. The menu planning system described.   The optimum condition is a condition of minimizing the sum of the corresponding amount of each ingredient required for the optimum menu and the amount corresponding to the difference between the quantities of the consumption target ingredients multiplied by a predetermined coefficient set for each ingredient. The menu planning system according to any one of claims 1 to 4, wherein:   The menu planning system according to claim 9, wherein the predetermined coefficient is a coefficient set according to a weight of each food material. The menu planning system further includes a display unit,
The menu planning system according to any one of claims 1 to 10, wherein the display unit displays the optimal menu and related information of the optimal menu. An information processing device;
A menu planning network system including the information processing device and a server device connected via a network,
The server device
A food amount acquisition unit for acquiring consumption target food amount data including a plurality of consumption target food amounts;
An optimal condition acquisition unit for acquiring an optimal condition, which is a condition regarding each of the consumption target ingredients and / or a condition regarding a menu that can be cooked based on each of the consumption target ingredients;
A menu example data acquisition unit that acquires menu example data including a plurality of predetermined menu examples and ingredients and the amount of ingredients necessary for cooking,
A menu number acquisition unit for acquiring the number of menus to be specified;
Based on the consumption amount data acquired by the food amount acquisition unit, the optimal condition acquired by the optimal condition acquisition unit, and the menu number acquired by the menu number acquisition unit, An optimal menu specifying unit that specifies an optimal menu that satisfies the optimal condition for the number of menus from the menu example data, and
The menu planning network system, wherein the consumption amount data and the optimum condition are input via the information processing apparatus. Ingredient amount acquisition step for acquiring consumption target ingredient amount data including amounts of a plurality of consumption target ingredients;
An optimum condition obtaining step for obtaining an optimum condition, which is a condition relating to each of the consumption target ingredients and / or a condition relating to a menu capable of cooking based on each of the consumption subject ingredients;
Menu example data acquisition step for acquiring menu example data including a plurality of predetermined menu examples and ingredients and amount of ingredients necessary for cooking,
Menu number acquisition step for acquiring the number of menu items to be identified;
Based on the consumption target food amount data acquired in the food amount acquisition step, the optimal condition acquired in the optimal condition acquisition step, and the menu number acquired in the menu number acquisition step, A menu planning method comprising: an optimal menu specifying step for specifying an optimal menu satisfying the optimal condition for the number of menus from the menu example data. Computer
A food amount acquisition unit for acquiring consumption target food amount data including a plurality of consumption target food amounts;
An optimal condition acquisition unit for acquiring an optimal condition, which is a condition regarding each of the consumption target ingredients and / or a condition regarding a menu that can be cooked based on each of the consumption target ingredients;
A menu example data acquisition unit that acquires menu example data including a plurality of predetermined menu examples and ingredients and the amount of ingredients necessary for cooking,
A menu number acquisition unit for acquiring the number of menus to be specified;
Based on the consumption amount data acquired by the food amount acquisition unit, the optimal condition acquired by the optimal condition acquisition unit, and the menu number acquired by the menu number acquisition unit, The computer program for functioning as a menu planning device provided with the optimal menu specific | specification part which specifies the optimal menu which satisfy | fills the said optimal condition for the said menu number from the said menu example data.

Images