Supermarket queuing simulation method and supermarket queuing simulation system based on proceeding
A simulation method and technology for supermarkets, applied in the field of service systems, can solve problems such as declining consumer satisfaction, increasing supermarket operating costs, and reducing supermarket competitiveness, so as to improve shopping service satisfaction, control operating costs, and reduce average queuing time. Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0035] A processing-based supermarket queuing simulation method, the specific steps of the method are as follows:
[0036] Create a queuing model through processing, and use the queuing model to pass the idle probability P of the supermarket service desk 0 Obtain the fullness probability P(n=C) of the supermarket service desk with the service intensity ρ, and determine the opening quantity of the supermarket service desk according to the fullness probability P(n=C);
[0037] For a supermarket checkout service system, the arrival interval of customers and the service time of cashiers to customers are random, so the supermarket checkout service system is a typical random service system, if the arrival interval of customers obeys the parameter λ Negative exponential distribution (thus the number of arrivals serves Poisson distribution), the service time of each customer obeys the negative exponential distribution with parameter μ, and the arrival of customers is independent of th...
Embodiment 2
[0058] The same invention provides a system corresponding to a processing-based supermarket queuing simulation method, the system includes a model building module, a data analysis module and a service desk opening module;
[0059] The model building module establishes the queuing model through processing, and the data analysis module uses the queuing model to pass the idle probability P of the supermarket service desk. 0 Obtain the fullness probability P (n=C) of supermarket service desk with service intensity ρ, and service desk opening module determines the opening quantity of supermarket service desk according to fullness probability P (n=C);
[0060] For a supermarket checkout service system, the arrival interval of customers and the service time of cashiers to customers are random, so the supermarket checkout service system is a typical random service system, if the arrival interval of customers obeys the parameter λ Negative exponential distribution (thus the number of a...
Embodiment 3
[0081] On the basis of Embodiment 2, first generate 50 customers with a Poisson distribution whose arrival interval obeys the parameter λ=0.6 through Python, and each customer generates a corresponding required service time that obeys the exponential distribution with the parameter μ=0.4, and Output the corresponding service desk;
[0082] Use the waiting time calculation module to calculate the average waiting time of customers queuing in the system:
[0083]
[0084] Use the stay time calculation module to calculate the average stay time of customers in the system:
[0085]
[0086] Compared with the queuing model of two service desks and two queues under the same situation of unlimited customer capacity, the average waiting time and average stay time of customers in the system will increase by about 4.286 unit time. Obviously, in this case, the single-queue model customers Experience satisfaction is better.
PUM
![No PUM](https://static-eureka-patsnap-com.libproxy1.nus.edu.sg/ssr/23.2.0/_nuxt/noPUMSmall.5c5f49c7.png)
Abstract
Description
Claims
Application Information
![application no application](https://static-eureka-patsnap-com.libproxy1.nus.edu.sg/ssr/23.2.0/_nuxt/application.06fe782c.png)
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap