CN117726328A - Meal drinking POS management platform based on cloud platform - Google Patents

Meal drinking POS management platform based on cloud platform Download PDF

Info

Publication number
CN117726328A
CN117726328A CN202311772484.7A CN202311772484A CN117726328A CN 117726328 A CN117726328 A CN 117726328A CN 202311772484 A CN202311772484 A CN 202311772484A CN 117726328 A CN117726328 A CN 117726328A
Authority
CN
China
Prior art keywords
order
amount
orders
closing
customer
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN202311772484.7A
Other languages
Chinese (zh)
Other versions
CN117726328B (en
Inventor
付丹伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Big Head Guangzhou Software Technology Co ltd
Original Assignee
Big Head Guangzhou Software Technology Co ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Big Head Guangzhou Software Technology Co ltd filed Critical Big Head Guangzhou Software Technology Co ltd
Priority to CN202311772484.7A priority Critical patent/CN117726328B/en
Publication of CN117726328A publication Critical patent/CN117726328A/en
Application granted granted Critical
Publication of CN117726328B publication Critical patent/CN117726328B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention relates to the technical field of Internet, and particularly discloses a POS management platform for catering based on a cloud platform, which comprises a data acquisition module, a data acquisition module and a processing module, wherein the data acquisition module acquires orders of all branch shops in a monitoring area on a current time node and acquires the amount of the orders through POS; and a classification module: acquiring whether an order has an intention of closing the order or not; and a settlement module: screening orders with the intention of closing the order, marking the orders as the order-closing orders, and combining n order-closing orders into the order-closing order; grouping the spelling orders in the spelling orders, and calculating the amount to be paid for each group; the amount to be paid for each of the order pieces in each group is calculated. The invention can automatically help customers to splice the bill so as to provide the customers with the greatest preferential, thereby attracting the customers and improving the sales.

Description

Meal drinking POS management platform based on cloud platform
Technical Field
The invention relates to the technical field of Internet, in particular to a meal and drink POS management platform based on a cloud platform.
Background
In a broad and decentralized restaurant market, catering enterprises face a double challenge: the cost is continuously increased, and the profit is gradually reduced. The digital system service of marketing, operation and management can be provided for catering merchants through the Internet, the mobile Internet and the manner of catering informatization management. The operation management efficiency of the catering enterprises can be improved, and convenience and personalized catering experience can be provided for consumers. The POS cashing system is a short-term of Point of sales, also called Point of Sale system, and is an informatization system widely applied to the fields of retail industry, catering industry and the like for carrying out transactions and checkout.
In the conventional catering industry, in order to attract customers and increase sales, a method of giving preference to customers is generally adopted, and the following are some common preference methods: full deactivation: promotion of full-load vertical reduction is carried out, such as 'full 100 yuan minus 10 yuan', 'full 200 yuan minus 30 yuan', etc.; buying and promoting: the consumption reaches a certain amount, and certain goods or services are given, such as 'buy one send one', 'consume 100 yuan send one cup of beverage', and the like.
However, the precondition of both methods is that the amount consumed by the customer reaches a certain value to obtain the corresponding preference, in this case, a customer often cannot enjoy some preference measures of the restaurant because the amount consumed by the customer does not reach a certain amount, and at this time, the customer may enjoy the preference in the merchant by searching for other customers to share the bill, however, it is difficult for the customer to search for other customers with the intention of sharing the bill by himself, and it is difficult to share the bill with other customers between different stores, which may have a series of effects, such as customer may feel difficult to obtain the preference, and thus cause loss of the customer source.
Disclosure of Invention
The invention aims to provide a meal and drink POS management platform based on a cloud platform, which solves the technical problems.
The aim of the invention can be achieved by the following technical scheme:
a cloud platform-based POS management platform for catering, comprising:
the data acquisition module is used for setting a monitoring area, acquiring orders of all branch shops in the monitoring area on a current time node, and acquiring the amount of the orders through POS;
and a classification module: acquiring whether an order has an intention of closing the order, wherein the intention of closing the order is an intention of settling together with other orders;
and a settlement module: screening orders with the intention of closing the order, marking the orders as the order-closing orders, combining n order-closing orders into the order-closing orders, wherein n E [ a, b ], n is a positive integer, a and b are preset values, and executing the following steps:
step one: for any one combined order, ordering the combined order in the combined order according to the amount of the order, wherein the larger the amount of the order is, the higher the ranking is;
step two: calculating the total amount F of the first to the j-th order in the order, wherein j is E [1, b), and when the total amount F is larger than or equal to the maximum preferential condition in the branch store and the total amount F' of the first to the j-1-th orders in the order is smaller than the maximum preferential condition in the branch store, j-1 represents the previous order adjacent to j in the order, and the first to the j-th orders in the order are used as the same group;
step three: removing the first to j-th order of the spelling list, generating new ordering, repeating the step two, and grouping the rest order of the spelling list;
step four: obtaining the total sum Q of each group And obtaining the consumption amount Q in the branch And full reduction amount Q at time Reduction of Calculating the amount Q to be paid by the closing order Total (S) =Q And -Q reduction of
Step five: the amount to be paid by the spelling order is calculated by the following formula: q (Q) i '=(Q i /Q And )*Q total (S) Wherein Q is i ' represents the amount that the ith order is required to pay, Q i Representing the amount of the ith order.
As a further scheme of the invention: when the customer does not have a intent to agree, a non-agree step is performed:
acquiring whether a customer has a deposit demand, wherein the deposit demand is that the current order does not enjoy full-reduction offers, and calculating the offers together with the next order to be consumed;
when the customer has a stock order requirement, the following steps are executed:
the customer does not enjoy the full-down offer and pays the amount P of the order When (when)
The amount P of the customer for the next consumption Support frame =P When (when) +P Lower part(s) Said P Lower part(s) The actual amount for the customer's next consumption;
when the customer does not have the inventory requirement, the following steps are executed:
acquiring full reduction amount P of order enjoyment Reduction of The amount P 'to be paid is calculated, and the calculation formula is P' =P-P Reduction of Wherein P represents the amount of the order;
acquiring the full reduction amount as P Reduction of The amount of consumption P required at the time Eliminating medicine Calculating an amount difference Δp=p-P Eliminating medicine Let the customer consume in any branch next time, the amount of the order a=a '+Δp, where a' represents the actual amount of the customer at the next time.
As a further scheme of the invention: in the sorting process, when two or more spelling orders have the same amount, the following steps are executed:
the customers corresponding to the closing orders with the same amount are obtained, and the total amount B consumed by the customers in the past m days is obtained, wherein m is a preset value;
and ordering the order closing orders with the same amount according to the total amount B, wherein the larger the total amount B is, the higher the ranking is.
As a further scheme of the invention: and when the total amount H of the residual spelling order is smaller than the maximum preferential condition in the merchant after a certain group is divided, merging the residual spelling order into a spelling order and executing the steps four to five.
As a further scheme of the invention: when two or more combined order forms exist, after a certain group is divided, when the total amount H of the residual combined order forms is smaller than the maximum preferential condition in the merchant, executing the following steps:
in the third step, when the total amount H of the residual spelling order is smaller than the maximum preferential condition in the commercial tenant after a certain group is divided, marking the residual spelling order as a pending order;
and obtaining the pending order of each closing order, merging the pending orders into a new closing order, and executing the steps one to four.
As a further scheme of the invention: in the data acquisition module, when the amount of the order is larger than the maximum preferential condition in the merchant, the order is settled independently.
As a further scheme of the invention: in the single-combination calculation module, when the amount of a certain combined order is smaller than the minimum preferential condition in the branch, the combined order cancels the combined order, and the non-combined single steps are respectively executed.
As a further scheme of the invention: in the non-step, when the amount of the order is smaller than the minimum preferential condition in the branch, the amount difference Δp=p.
The invention has the beneficial effects that: in the invention, orders of all branch shops in a target area at the current time are firstly acquired, and the amount of each order is acquired through POS (point of sale), which is the basis of subsequent processing; then, acquiring whether the order has the intention of closing the order; for orders with the intention of closing the order, taking a plurality of orders with the intention of closing the order as a closing order, sorting the closing order according to the amount of the order in the closing order, screening the closing order meeting the maximum preferential condition in the branch store from the sorting, and settling the same group, thereby maximizing the utilization of the full-reduced preferential condition in the branch store and providing more preferential to customers so as to achieve the purpose of attracting the customers; the amount each order in each group of the table needs to pay is then calculated and the order is completed. The invention can automatically help customers to splice the bill so as to provide the customers with the greatest preferential, thereby attracting the customers and improving the sales.
Drawings
The invention is further described below with reference to the accompanying drawings.
Fig. 1 is a schematic flow chart of a meal and drink POS management platform based on a cloud platform.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Referring to fig. 1, the present invention is a POS management platform for catering based on a cloud platform, including:
the data acquisition module is used for setting a monitoring area, acquiring orders of all branch shops in the monitoring area on a current time node, and acquiring the amount of the orders through POS;
and a classification module: acquiring whether an order has an intention of closing the order, wherein the intention of closing the order is an intention of settling together with other orders;
and a settlement module: screening orders with the intention of closing the order, marking the orders as the order-closing orders, combining n order-closing orders into the order-closing orders, wherein n E [ a, b ], n is a positive integer, a and b are preset values, and executing the following steps:
step one: for any one combined order, ordering the combined order in the combined order according to the amount of the order, wherein the larger the amount of the order is, the higher the ranking is;
step two: calculating the total amount F of the first to the j-th order in the order, wherein j is E [1, b), and when the total amount F is larger than or equal to the maximum preferential condition in the branch store and the total amount F' of the first to the j-1-th orders in the order is smaller than the maximum preferential condition in the branch store, j-1 represents the previous order adjacent to j in the order, and the first to the j-th orders in the order are used as the same group;
step three: removing the first to j-th order of the spelling list, generating new ordering, repeating the step two, and grouping the rest order of the spelling list;
step four: obtaining the total sum Q of each group And acquiring the consumption amount in the branch asQ And full reduction amount Q at time Reduction of Calculating the amount Q to be paid by the closing order Total (S) =Q And -Q reduction of
Step five: the amount to be paid by the spelling order is calculated by the following formula: q (Q) i '=(Q i /Q And )*Q total (S) Wherein Q is i ' represents the amount that the ith order is required to pay, Q i Representing the amount of the ith order.
It should be noted that, firstly, orders of all the branch shops in the target area at the current time are acquired, and the amount of each order is acquired through the POS, which is the basis of the subsequent processing; then, acquiring whether the order has the intention of closing the order; for orders with the intention of closing the order, taking a plurality of orders with the intention of closing the order as a closing order, sorting the closing order according to the amount of the order in the closing order, screening the closing order meeting the maximum preferential condition in the branch store from the sorting, and settling the same group, thereby maximizing the utilization of the full-reduced preferential condition in the branch store and providing more preferential to customers so as to achieve the purpose of attracting the customers; the amount each order in each group of the table needs to pay is then calculated and the order is completed.
In another preferred implementation of the invention, when there is no intent to close the customer, a non-close single step is performed:
acquiring whether a customer has a deposit demand, wherein the deposit demand is that the current order does not enjoy full-reduction offers, and calculating the offers together with the next order to be consumed;
when the customer has a stock order requirement, the following steps are executed:
the customer does not enjoy the full-down offer and pays the amount P of the order When (when)
The amount P of the customer for the next consumption Support frame =P When (when) +P Lower part(s) Said P Lower part(s) The actual amount for the customer's next consumption;
when the customer does not have the inventory requirement, the following steps are executed:
full reduction for acquiring order complianceForehead P Reduction of The amount P 'to be paid is calculated, and the calculation formula is P' =P-P Reduction of Wherein P represents the amount of the order;
acquiring the full reduction amount as P Reduction of The amount of consumption P required at the time Eliminating medicine Calculating an amount difference Δp=p-P Eliminating medicine Let the customer consume in any branch next time, the amount of the order a=a '+Δp, where a' represents the actual amount of the customer at the next time.
It is worth noting that this is done to maximize the utilization of the full-reduced offers in the store, and to provide more offers to the customer, thereby achieving the goal of attracting the customer.
In another preferred embodiment of the present invention, when there are two or more spelling orders with the same amount, the following steps are performed when there are two or more spelling orders with the same amount:
the customers corresponding to the closing orders with the same amount are obtained, and the total amount B consumed by the customers in the past m days is obtained, wherein m is a preset value;
and ordering the order closing orders with the same amount according to the total amount B, wherein the larger the total amount B is, the higher the ranking is.
In another preferred implementation of the present invention, when there is a certain group, the total amount H of the remaining spelling orders is smaller than the maximum preferential condition in the merchant, the remaining spelling orders are combined into one spelling order and the steps four to five are executed.
In another preferred implementation of the present invention, when there are two or more combined orders, after a certain group is divided, the total amount H of the remaining combined orders is smaller than the maximum preferential condition in the merchant, the following steps are performed:
in the third step, when the total amount H of the residual spelling order is smaller than the maximum preferential condition in the commercial tenant after a certain group is divided, marking the residual spelling order as a pending order;
and obtaining the pending order of each closing order, merging the pending orders into a new closing order, and executing the steps one to four.
It should be noted that this is done to maximize the utilization of the full-reduced offers in the branch, and provide more offers to the customer, thereby achieving the purpose of attracting the customer.
In another preferred implementation of the present invention, the data acquisition module is configured to perform settlement alone when the amount of the order is greater than a maximum preferential condition in the merchant.
It will be appreciated that the order may already enjoy the greatest benefit at this point, and be settled along with other orders, but rather the benefit to which the order is subjected may be reduced.
In another preferred implementation of the present invention, in the single-combination calculation module, when the amount of a certain combined order is smaller than the minimum preferential condition in the branch, the combined order cancels the combined order, and the non-combined single steps are executed respectively.
In another preferred implementation of the present invention, in the non-step, when the amount of the order is smaller than the minimum preference condition in the branch, the amount difference Δp=p is set.
The foregoing describes one embodiment of the present invention in detail, but the description is only a preferred embodiment of the present invention and should not be construed as limiting the scope of the invention. All equivalent changes and modifications within the scope of the present invention are intended to be covered by the present invention.

Claims (8)

1. A cloud platform-based POS management platform for catering, comprising:
the data acquisition module is used for setting a monitoring area, acquiring orders of all branch shops in the monitoring area on a current time node, and acquiring the amount of the orders through POS;
and a classification module: acquiring whether an order has an intention of closing the order, wherein the intention of closing the order is an intention of settling together with other orders;
and a settlement module: screening orders with the intention of closing the order, marking the orders as the order-closing orders, combining n order-closing orders into the order-closing orders, wherein n E [ a, b ], n is a positive integer, a and b are preset values, and executing the following steps:
step one: for any one combined order, ordering the combined order in the combined order according to the amount of the order, wherein the larger the amount of the order is, the higher the ranking is;
step two: calculating the total amount F of the first to the j-th order in the order, wherein j is E [1, b), and when the total amount F is larger than or equal to the maximum preferential condition in the branch store and the total amount F' of the first to the j-1-th orders in the order is smaller than the maximum preferential condition in the branch store, j-1 represents the previous order adjacent to j in the order, and the first to the j-th orders in the order are used as the same group;
step three: removing the first to j-th order of the spelling list, generating new ordering, repeating the step two, and grouping the rest order of the spelling list;
step four: obtaining the total sum Q of each group And obtaining the consumption amount Q in the branch And full reduction amount Q at time Reduction of Calculating the amount Q to be paid by the closing order Total (S) =Q And -Q reduction of
Step five: the amount to be paid by the spelling order is calculated by the following formula: q (Q) i '=(Q i /Q And )*Q total (S) Wherein Q is i ' represents the amount that the ith order is required to pay, Q i Representing the amount of the ith order.
2. The cloud platform based POS management platform for food and beverage of claim 1, wherein when no intention to close is present for the customer, performing a non-close single step:
acquiring whether a customer has a deposit demand, wherein the deposit demand is that the current order does not enjoy full-reduction offers, and calculating the offers together with the next order to be consumed;
when the customer has a stock order requirement, the following steps are executed:
the customer does not enjoy the full-down offer and pays the amount P of the order When (when)
The amount P of the customer for the next consumption Support frame =P When (when) +P Lower part(s) Said P Lower part(s) The actual amount for the customer's next consumption;
when the customer does not have the inventory requirement, the following steps are executed:
acquiring full reduction amount P of order enjoyment Reduction of The amount P 'to be paid is calculated, and the calculation formula is P' =P-P Reduction of Wherein P represents the amount of the order;
acquiring the full reduction amount as P Reduction of The amount of consumption P required at the time Eliminating medicine Calculating an amount difference Δp=p-P Eliminating medicine Let the customer consume in any branch next time, the amount of the order a=a '+Δp, where a' represents the actual amount of the customer at the next time.
3. The POS management platform for catering based on a cloud platform of claim 1, wherein the ordering process, when there are two or more orders with the same amount, comprises the steps of:
the customers corresponding to the closing orders with the same amount are obtained, and the total amount B consumed by the customers in the past m days is obtained, wherein m is a preset value;
and ordering the order closing orders with the same amount according to the total amount B, wherein the larger the total amount B is, the higher the ranking is.
4. The POS management platform for catering of claim 1, wherein when there is a maximum preference condition in the merchant, combining the remaining split orders into one combined order and performing steps four to five.
5. The cloud platform based POS management platform of claim 4, wherein when there are two or more combined orders, after a certain group is divided, the total amount of remaining combined orders H is less than the maximum preferential condition in the merchant, the following steps are performed:
in the third step, when the total amount H of the residual spelling order is smaller than the maximum preferential condition in the commercial tenant after a certain group is divided, marking the residual spelling order as a pending order;
and obtaining the pending order of each closing order, merging the pending orders into a new closing order, and executing the steps one to four.
6. The POS management platform for food and beverage based on a cloud platform as defined in claim 1, wherein said data acquisition module is configured to settle said order alone when said order is greater than a maximum preferential condition at a merchant.
7. The cloud platform-based POS management platform of claim 1, wherein in the single-combination calculation module, when a certain combination order has a less amount than a minimum preferential condition in a branch, the combination order cancels the combination, and the single-step is executed.
8. The POS management platform for catering of claim 1, wherein in the non-step, the difference Δp=p is set when the amount of the order is less than a minimum preference in the branch.
CN202311772484.7A 2023-12-21 2023-12-21 Meal drinking POS management platform based on cloud platform Active CN117726328B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311772484.7A CN117726328B (en) 2023-12-21 2023-12-21 Meal drinking POS management platform based on cloud platform

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311772484.7A CN117726328B (en) 2023-12-21 2023-12-21 Meal drinking POS management platform based on cloud platform

Publications (2)

Publication Number Publication Date
CN117726328A true CN117726328A (en) 2024-03-19
CN117726328B CN117726328B (en) 2024-05-07

Family

ID=90199607

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311772484.7A Active CN117726328B (en) 2023-12-21 2023-12-21 Meal drinking POS management platform based on cloud platform

Country Status (1)

Country Link
CN (1) CN117726328B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017012428A1 (en) * 2015-04-03 2017-01-26 深圳市淘淘谷信息技术有限公司 Offline diversified cashier clearing method, payment management method, and payment management system
CN106920084A (en) * 2017-02-27 2017-07-04 广州云移信息科技有限公司 Take out and spell single payment and settlement method and system
CN108460586A (en) * 2018-02-10 2018-08-28 深圳壹账通智能科技有限公司 A kind of amount of money preferential measure, device, terminal device and the storage medium of polymerization payment
CN116205641A (en) * 2023-01-11 2023-06-02 中国银联股份有限公司 Payment method, device, equipment, medium and product

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017012428A1 (en) * 2015-04-03 2017-01-26 深圳市淘淘谷信息技术有限公司 Offline diversified cashier clearing method, payment management method, and payment management system
CN106920084A (en) * 2017-02-27 2017-07-04 广州云移信息科技有限公司 Take out and spell single payment and settlement method and system
CN108460586A (en) * 2018-02-10 2018-08-28 深圳壹账通智能科技有限公司 A kind of amount of money preferential measure, device, terminal device and the storage medium of polymerization payment
CN116205641A (en) * 2023-01-11 2023-06-02 中国银联股份有限公司 Payment method, device, equipment, medium and product

Also Published As

Publication number Publication date
CN117726328B (en) 2024-05-07

Similar Documents

Publication Publication Date Title
Campbell et al. From self-service to super-service: a resource mapping framework for co-creating value by shifting the boundary between provider and customer
Reardon et al. The rapid rise of supermarkets in Latin America: challenges and opportunities for development
Reardon et al. Supermarket revolution in Asia and emerging development strategies to include small farmers
Das Nair et al. The expansion of regional supermarket chains and implications for local suppliers: A comparison of findings from South Africa, Botswana, Zambia, and Zimbabwe
Johnston et al. Productivity in Australia's wholesale and retail trade
Martin Market structure and market performance
Brenes et al. Super Selectos: Winning the war against multinational retail chains
Jin et al. Procurement auctions and supply chain performance
Braholli An investigation of consumer behavior in online trade during the Covid-19 pandemic: A case study
Digal Modern retail food sector in the Philippines: dominance of large domestic retailers and their effects on the supply chain
CN117726328B (en) Meal drinking POS management platform based on cloud platform
Hamilton Slotting allowances as a facilitating practice by food processors in wholesale grocery markets: profitability and welfare effects
Chikweche Independent retail and grocery shops in Zimbabwe: survival and demise in a crisis and post-crisis era
Tuoi et al. Review of agricultural value chain analysis
CN111626765B (en) Resource allocation method and device, storage medium and computer equipment
Gallo The food marketing system in 1996
Seidel Comparing distribution channels and their impact on supply chains: a case study on online groceries in France and Germany
Savina Marketing support of competitiveness management of agricultural enterprises
Forsman et al. Customer value creation in the short food supply chain: theoretical aspects and explorative findings
Hariguna et al. Sales Transaction Data Analysis using Apriori Algorithm to Determine the Layout of the Goods
Dharmasena et al. Demand interrelationships of at-home nonalcoholic beverage consumption in the United States
Yokoi Network Building in Online Retailing and Relational Model by Marketing Concept
Holcomb et al. Factors Impacting Participation In and Purchases Made by Members of the Oklahoma Food Cooperative
Holcomb et al. Factors impacting participation in and purchases made by members of the oklahoma food cooperative
Segu et al. Towards Assimilating and Reconciling Customer Pain Points of Food Delivery and Logistics Industry: A Design Science Approach

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant