CN108830403A - The tobacco retail customer calculated based on commercial value visits path visual analysis method - Google Patents

The tobacco retail customer calculated based on commercial value visits path visual analysis method Download PDF

Info

Publication number
CN108830403A
CN108830403A CN201810500314.6A CN201810500314A CN108830403A CN 108830403 A CN108830403 A CN 108830403A CN 201810500314 A CN201810500314 A CN 201810500314A CN 108830403 A CN108830403 A CN 108830403A
Authority
CN
China
Prior art keywords
path
retail customer
commercial value
grid
tobacco
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
CN201810500314.6A
Other languages
Chinese (zh)
Other versions
CN108830403B (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.)
China Tobacco Guangxi Industrial Co Ltd
Original Assignee
China Tobacco Guangxi Industrial 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 China Tobacco Guangxi Industrial Co Ltd filed Critical China Tobacco Guangxi Industrial Co Ltd
Priority to CN201810500314.6A priority Critical patent/CN108830403B/en
Publication of CN108830403A publication Critical patent/CN108830403A/en
Application granted granted Critical
Publication of CN108830403B publication Critical patent/CN108830403B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047Optimisation of routes or paths, e.g. travelling salesman problem
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/01Customer relationship services
    • G06Q30/015Providing customer assistance, e.g. assisting a customer within a business location or via helpdesk
    • G06Q30/016After-sales

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Human Resources & Organizations (AREA)
  • Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Marketing (AREA)
  • General Physics & Mathematics (AREA)
  • Development Economics (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The present invention relates to visit path visual analysis method based on the tobacco retail customer that commercial value calculates.The latitude and longitude information that retail customer is concentrated according to tobacco market sales data, retail customer data object is divided into two-dimensional space grid;The path planning quantity N for being ranked up to the sales volume of non-empty grid all in grid, and being selected according to user, selects the highest space lattice of commercial value in N number of grid;According to commercial value optimization path planning algorithm, path planning calculating is carried out respectively for the retail customer object set in N number of grid for selecting, N retail customer is obtained and visits path;Path is visited according to calculated N retail customer and is visualized and visited on the electronic map trade company's analysis, and user is artificially adjusted based on the analysis results and recalculates optimal path.According to the technical solution of the present invention, the optimal path of a plurality of commercial value can be automatically generated by tobacco market sales data, visit planning visual analysis for tobacco retail customer.

Description

The tobacco retail customer calculated based on commercial value visits path visual analysis method
Technical field
The present invention relates to path planning algorithm and data visualization analysis method fields, and in particular to is calculated based on commercial value Tobacco retail customer visit path visual analysis method.
Background technique
Following realistic problem is related generally to for the tobacco retail customer task of visiting:1, the retail terminal sum on tobacco market Mesh is very huge, and quantity is more than 5,000,000 families;2, the walking distance that each market sale personnel work daily is limited;3, every The amount that a sales force is able to access that daily is limited.Therefore limited sales force cannot be to whole retail customer terminals It is visited, and increasing marketing efforts personnel amount can bring higher cost price excessively high, so most in reality Enterprise can only visit part core retail customer.Therefore, how for shopping mall team planning it is daily visit Path Tasks, make it Higher commercial value can be created in limited human cost, be tobacco manufacturing enterprise question of common concern.
Traditional paths planning method can preferably solve the path between path planning and multiple spot between two o'clock Planning problem.But it visits in actual task demand and has the following problems in market:1, in legacy paths planning between points Value it is equal, but the commercial value difference problem between retail customer;2, the principal measure of traditional planning according to be path away from From most short or time-consuming minimum, rather than visit the commercial value summation highest of retail customer;3, in traditional planning generally be directed to The planning of individual task, individual paths, rather than the path planning of more people, multi-thread task, thus it is more using conventional method execution The multi-thread task of people is to will appear the problem of repeatability is visited, and can not achieve commercial value maximization;4, for sea in traditional planning The problems such as path planning of amount data point is low there are computational efficiency.
It implies the information such as a large amount of sales situation, space-time in market sale data and is visited for enterprise's progress retail customer and appointed The analysis and decision of business.Therefore, studying one kind can be realized more according to the parameter setting of user with unsupervised, Ad hoc mode The intelligent planning in path, and the tobacco retail customer for enabling to cover higher commercial value visit paths planning method be have it is existing Sincere justice.
Summary of the invention
Present invention employs grid dividings and commercial value to optimize thought, devises the tobacco calculated based on commercial value Retail customer visits path visual analysis method, can cook up a plurality of zero according to market sale data combination user demand intelligence Sell the path that family is visited.
The present invention provides the following technical solutions:
The tobacco retail customer calculated based on commercial value visits path visual analysis method, including:
The latitude and longitude information that retail customer is concentrated according to the tobacco market sales data, retail customer data object is divided Into two-dimensional space grid;
Preferably, the sales volume of non-empty grid all in the grid is ranked up, and selected according to the user Path planning quantity N, select the highest space lattice of commercial value in N number of grid;
According to commercial value optimization path planning algorithm, for the retail customer object set difference in N number of grid for selecting Path planning calculating is carried out, N retail customer is obtained and visits path;
According to the commercial value optimization path planning algorithm, for the retail customer object set in N number of grid for selecting It closes and carries out path planning calculating respectively, obtain N retail customer and visit path;
Path, which is visited, according to the calculated N retail customer is visualized and visited on the electronic map trade company point Analysis.
Preferably, the above-mentioned tobacco retail customer calculated based on commercial value is visited in the visual analysis method of path, described Two-dimensional space grid, the data that can be concentrated according to grid side length parameter L set by user to tobacco market sales data are empty Between carry out impartial divide and obtain.
Preferably, in above-mentioned commercial value optimization path planning algorithm, the commercial value definition is for unit Manage the total amount of the sales volume (or sales volume or profit or tax revenue) in range;
Preferably, above-mentioned commercial value optimization path planning algorithm is:
In the grid chosen first described in each, retail customer is visited according to the daily maximum set by user Number parameter Num, selects highest Num candidate retail customer of commercial value in grid, and with longitude in the grid and The maximum data point of the sum of dimension values is starting point, is found out in the remaining candidate retail customer apart from nearest retail customer Carry out path connection, and it is successively recursive all Num retail customers are attached, obtain a retail customer and visit road Diameter;
Secondly visiting in path described in each, visits distance parameter according to the daily maximum set by user Whether S judges path length more than S, and algorithm terminates if being less than;Otherwise by the retail at the path head and tail both ends Family rejecting is less than S until path length, then finds the R nearest with it zero respectively in the remaining R retail customer It sells family, and wherein the maximum retail customer of commercial value will be inserted into and be visited in path in such a way that path is most short;
Whether the path length after the finally judgement planning again does not surpass more than S more than previous step is then returned to Then algorithm suspension is crossed, the higher retail customer of N commercial value is obtained and visits path.
The sequencing visited according to retail customer visits path in electronic map to the calculated N retail customer On visualized, and the sales situation for the retail customer for planning to visit in path planning is analyzed and is shown;
Optionally, the analysis content of above-mentioned sales situation include visit retail customer quantity, apart from total length, visit distance Total time-consuming visits retail customer total sales volume and retail customer sales volume information;
Optionally, user visits the visualization result of path planning according to the tobacco retail customer, the retail to visiting Family is adjusted, and is recalculated shortest path and is visualized;
Optionally, when user to the plane-generating again visit path analysis result it is dissatisfied when, repeat upper one Step carries out artificial adjustment and recalculates;Visual analysis terminates when being satisfied with.
Above-mentioned technical proposal provided by the invention at least has the advantages that compared with prior art:The present invention mentions The tobacco retail customer calculated based on commercial value is gone out and has visited path visual analysis method, this method can be set according to user demand It sets, intelligence computation goes out a plurality of retail customer and visits path from market sale data, its main feature is that:1, it is visited between mulitpath Retail customer will not repeat;2, in planning the commercial value total amount of retail customer included in individual paths (and mulitpath) be by Preferably result after global calculation;3, user can voluntarily be adjusted according to the visual analysis result of the planning path, and Shortest path is recalculated, makes full use of knowledge and the experience of people to make up the deficiency of system-computed.
Detailed description of the invention
Fig. 1 is that visit path visual for the tobacco retail customer calculated based on commercial value of a preferred embodiment of the present invention one The method flow diagram of analysis method;
Fig. 2 is that visit path visual for the tobacco retail customer calculated based on commercial value of a preferred embodiment of the present invention two The method detailed flow chart of analysis method;
Fig. 3 is that retail customer of the invention visits path planning visualization legend.
Specific embodiment
It, below will be to specific in order to illustrate more clearly of the specific embodiment of the invention or technical solution in the prior art Embodiment or attached drawing needed to be used in the description of the prior art be briefly described, it should be apparent that, it is described below Attached drawing is some embodiments of the present invention, for those of ordinary skill in the art, before not making the creative labor It puts, is also possible to obtain other drawings based on these drawings.
Embodiment 1
The present embodiment provides path visual analysis method is visited based on the tobacco retail customer that commercial value calculates, such as Fig. 1 institute Show, including:
S1:The latitude and longitude information that retail customer is concentrated according to tobacco market sales data, retail customer data object is divided into In two-dimensional space grid.
S2:The path planning quantity N that the sales volume of non-empty grid all in grid is ranked up, and is selected according to user, Select the highest space lattice of commercial value in N number of grid.
S3:According to commercial value optimization path planning algorithm, for the retail customer object set point in N number of grid for selecting Not carry out path planning calculating, obtain N retail customer and visit path.
S4:Path, which is visited, according to calculated N retail customer is visualized and visited on the electronic map trade company's analysis, User is artificially adjusted based on the analysis results and recalculates optimal path.
In above scheme, the highest N number of area of commercial value is found by grid dividing technology first, secondly described According to optimizing thought, the optimal path visited by iterating to calculate out tobacco retail customer, then to being calculated in N number of area Result carry out visualization and trade company's situation analysis, the result that finally system-computed is gone out according to personal knowledge and experience by user It is modified, recalculates shortest path and is visualized, repeat the above interactive visual analysis until user is satisfied with Route programming result.Such benefit mainly has at 3 points:1, grid dividing is carried out to magnanimity market sale data, accelerates meter Calculate efficiency;2, obtained route programming result is the global optimization as a result, therefore than people according to warp calculated by precision The result tested is more accurate, and the coverage area of commercial value is bigger;3, allow people to system meter by visual analysis The defect of calculation is artificially corrected, and is excluded and is not met actual planning point and path in real world, so that people's knows Knowledge is fully utilized with experience.
Embodiment 2
In above-mentioned steps S1, the method can be decomposed into two steps.A kind of implementation is provided in the present embodiment, Including:
Specifically, as shown in Fig. 2, including the following steps:
S11:The data space that tobacco market sales data is concentrated is carried out according to grid side length parameter L set by user equal Deng division, a two-dimensional space grid is obtained;
S12:The latitude and longitude information that retail customer is concentrated according to tobacco market sales data, retail customer data object is divided into In two-dimensional space grid.
In above-mentioned steps S3, the method can be decomposed into two steps.A kind of implementation is provided in the present embodiment, Including:
Specifically, as shown in Fig. 2, including the following steps:
S31:In the grid that each is chosen, retail customer number parameter Num is visited according to daily maximum set by user, Commercial value highest Num candidate retail customer in grid is selected, and with the maximum number of the sum of longitude and dimension values in grid Strong point is starting point, finds out in remaining candidate retail customer and carries out path connection, and successively recurrence apart from nearest retail customer All Num retail customers are attached, obtain a retail customer and visit path;
S32:It is visited in path in each, distance parameter S is visited according to daily maximum set by user and judges path length Whether degree is more than S, and algorithm terminates if being less than;Otherwise the retail customer at path head and tail both ends is rejected until path length Less than S, then find R nearest therewith retail customer respectively in remaining R retail customer, and will wherein commercial value it is maximum Retail customer be inserted into and visited in path in such a way that path is most short;
S33:Judgement plan again after path length whether more than S, more than then jumping to step S32;No more than then algorithm Stop, obtains the higher retail customer of N commercial value and visit path.
In above-mentioned steps S4, the method can be decomposed into three steps.A kind of implementation is provided in the present embodiment, Including:
Specifically, as shown in Fig. 2, including the following steps:
S41:The sequencing visited according to retail customer visits path on the electronic map to calculated N retail customer It is visualized, and the sales situation for the retail customer for planning to visit in path planning is analyzed and shown;
S42:User visits the visualization result of path planning according to tobacco retail customer, adjusts to the retail customer visited It is whole, it recalculates shortest path and visualizes;
S43:When user to the plane-generating again visit path analysis result it is dissatisfied when, jump to step S42; Step S44 is jumped to when being satisfied with.
S44:Tobacco retail customer, which visits path planning analysis, to be terminated.
Although preferred embodiments of the present invention have been described, it is created once a person skilled in the art knows basic Property concept, then can make change and modification to these embodiments.So it includes being preferably implemented that the following claims are intended to be interpreted as Example and all change and modification for falling into the scope of the invention.

Claims (5)

1. visiting path visual analysis method based on the tobacco retail customer that commercial value calculates, which is characterized in that including:
The latitude and longitude information that retail customer is concentrated according to tobacco market sales data, is divided into two-dimensional space for retail customer data object In grid;
The path planning quantity N for being ranked up to the commercial value of non-empty grid all in grid, and being selected according to user, is selected The highest space lattice of commercial value in N number of grid;
According to commercial value optimization path planning algorithm, carried out respectively for the retail customer object set in N number of grid for selecting Path planning calculates, and obtains N retail customer and visits path;
Path, which is visited, according to calculated N retail customer is visualized and visited on the electronic map trade company's analysis, Yong Hugen It is artificially adjusted according to analysis result and recalculates optimal path.
2. the tobacco retail customer according to claim 1 calculated based on commercial value visits path visual analysis method, It is characterized in that:The number that the grid side length parameter L that the two-dimensional space grid is set by the user concentrates tobacco market sales data Impartial divide is carried out according to space to obtain.
3. the tobacco retail customer according to claim 1 calculated based on commercial value visits path visual analysis method, It is characterized in that, the commercial value is the total amount of the sales volume or sales volume or profit or tax revenue in unit geographic range.
4. the tobacco retail customer according to claim 1 calculated based on commercial value visits path visual analysis method, It is characterized in that, the commercial value optimization path planning algorithm is set first in the grid that each is chosen according to user Daily maximum visit retail customer number parameter Num, select the highest Num candidate retail customer of commercial value in grid, and with The maximum data point of the sum of longitude and dimension values is starting point in grid, finds out distance recently in remaining candidate retail customer Retail customer carry out path connection, and it is successively recursive all Num retail customers are attached, obtain a retail customer and visit Path;
Secondly it is visited in path in each, distance parameter S is visited according to daily maximum set by user and judges that path length is It is no more than S, algorithm terminates if being less than;Otherwise the retail customer at path head and tail both ends is rejected until path length is less than S, then finds the R retail customer nearest with it respectively in remaining R retail customer, and will wherein commercial value maximum zero It sells family and is inserted into such a way that path is most short and visited in path;
Finally judge whether the path length after planning again is no more than in then algorithm more than S more than previous step is then returned to Only, it obtains the higher retail customer of N commercial value and visits path.
5. the tobacco retail customer according to claim 1 calculated based on commercial value visits path visual analysis method, Be characterized in that, it is described visit trade company's analysis include visit retail customer quantity, apart from total length, visit distance total time-consuming, visit zero Sell family total sales volume and retail customer sales volume information;The sequencing visited according to retail customer walks calculated N retail customer It visits path to be visualized on the electronic map, and the sales situation for the retail customer for planning to visit in path planning is analyzed With displaying;User visits the visualization result of path planning according to tobacco retail customer, is adjusted to the retail customer visited, again It calculates shortest path and visualizes;When user to plane-generating again visit path analysis result it is dissatisfied when, repeat upper one Step carries out artificial adjustment and recalculates;Visual analysis terminates when being satisfied with.
CN201810500314.6A 2018-05-23 2018-05-23 Visual analysis method for tobacco retail customer visiting path based on commercial value calculation Active CN108830403B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810500314.6A CN108830403B (en) 2018-05-23 2018-05-23 Visual analysis method for tobacco retail customer visiting path based on commercial value calculation

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810500314.6A CN108830403B (en) 2018-05-23 2018-05-23 Visual analysis method for tobacco retail customer visiting path based on commercial value calculation

Publications (2)

Publication Number Publication Date
CN108830403A true CN108830403A (en) 2018-11-16
CN108830403B CN108830403B (en) 2022-03-22

Family

ID=64147169

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810500314.6A Active CN108830403B (en) 2018-05-23 2018-05-23 Visual analysis method for tobacco retail customer visiting path based on commercial value calculation

Country Status (1)

Country Link
CN (1) CN108830403B (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112308315A (en) * 2020-10-29 2021-02-02 广西中烟工业有限责任公司 Multi-point intelligent path planning method and system
CN112734200A (en) * 2020-12-31 2021-04-30 贵州省烟草公司六盘水市公司 Tobacco product retail point planning grid query system and method based on electronic map
CN117094743A (en) * 2023-08-25 2023-11-21 中国烟草总公司广东省公司 Automatic cigarette retail market data statistical analysis system and method

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6529821B2 (en) * 2001-06-05 2003-03-04 The United States Of America As Represented By The Secretary Of The Navy Route planner with area avoidance capability
US20070022061A1 (en) * 2005-07-20 2007-01-25 Bbnt Solutions Llc Optimizing solutions using local virtual forces
CN103837154A (en) * 2014-03-14 2014-06-04 北京工商大学 Path planning method and system
CN104700203A (en) * 2015-01-15 2015-06-10 北京农业信息技术研究中心 Method and device for planning logistics distribution nodes
CN104951918A (en) * 2015-06-11 2015-09-30 上海德马物流技术有限公司 Time window path planning method
CN105188131A (en) * 2015-07-30 2015-12-23 张欣 Grid-based indoor area location and navigation method
CN105203097A (en) * 2015-10-14 2015-12-30 中国矿业大学 Multi-robot multi-target point rescue route planning method fit for after-calamity environment
CN105528649A (en) * 2015-11-30 2016-04-27 山东烟草研究院有限公司 Route optimization recommendation method based on clustering and saving algorithms
CN105868843A (en) * 2016-03-22 2016-08-17 南京邮电大学 Route planning method oriented to goods delivery
CN106803136A (en) * 2017-01-24 2017-06-06 苏州工业职业技术学院 A kind of fresh dispatching real-time optimization method based on genetic algorithm

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6529821B2 (en) * 2001-06-05 2003-03-04 The United States Of America As Represented By The Secretary Of The Navy Route planner with area avoidance capability
US20070022061A1 (en) * 2005-07-20 2007-01-25 Bbnt Solutions Llc Optimizing solutions using local virtual forces
CN103837154A (en) * 2014-03-14 2014-06-04 北京工商大学 Path planning method and system
CN104700203A (en) * 2015-01-15 2015-06-10 北京农业信息技术研究中心 Method and device for planning logistics distribution nodes
CN104951918A (en) * 2015-06-11 2015-09-30 上海德马物流技术有限公司 Time window path planning method
CN105188131A (en) * 2015-07-30 2015-12-23 张欣 Grid-based indoor area location and navigation method
CN105203097A (en) * 2015-10-14 2015-12-30 中国矿业大学 Multi-robot multi-target point rescue route planning method fit for after-calamity environment
CN105528649A (en) * 2015-11-30 2016-04-27 山东烟草研究院有限公司 Route optimization recommendation method based on clustering and saving algorithms
CN105868843A (en) * 2016-03-22 2016-08-17 南京邮电大学 Route planning method oriented to goods delivery
CN106803136A (en) * 2017-01-24 2017-06-06 苏州工业职业技术学院 A kind of fresh dispatching real-time optimization method based on genetic algorithm

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
周慧 等: "多目标动态车辆路径问题建模及优化", 《计算机科学》 *
邓超 等: "基于热力图的卷烟市场数据可视分析系统", 《烟草科技》 *

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112308315A (en) * 2020-10-29 2021-02-02 广西中烟工业有限责任公司 Multi-point intelligent path planning method and system
CN112734200A (en) * 2020-12-31 2021-04-30 贵州省烟草公司六盘水市公司 Tobacco product retail point planning grid query system and method based on electronic map
CN117094743A (en) * 2023-08-25 2023-11-21 中国烟草总公司广东省公司 Automatic cigarette retail market data statistical analysis system and method
CN117094743B (en) * 2023-08-25 2024-01-26 中国烟草总公司广东省公司 Automatic cigarette retail market data statistical analysis system and method

Also Published As

Publication number Publication date
CN108830403B (en) 2022-03-22

Similar Documents

Publication Publication Date Title
Zolfani et al. Decision making on business issues with foresight perspective; an application of new hybrid MCDM model in shopping mall locating
Chou et al. A fuzzy multi-criteria decision model for international tourist hotels location selection
US8639541B2 (en) Sports and concert event ticket pricing and visualization system
Önüt et al. A combined fuzzy MCDM approach for selecting shopping center site: An example from Istanbul, Turkey
Luo et al. New product development under channel acceptance
US7412398B1 (en) Method for analyzing net demand for a market area utilizing weighted bands
US9760840B1 (en) Geospatial data analysis
CN108830403A (en) The tobacco retail customer calculated based on commercial value visits path visual analysis method
CN109784979A (en) A kind of supply chain needing forecasting method of big data driving
CN106779808A (en) Consumer space's behavior analysis system and method in a kind of commercial circle
US10142187B2 (en) Predicting an effect of performing an action on a node of a geographical network
JP2003281348A (en) Market area analyzing system, method, program and recording medium
CN109360022A (en) A kind of market Sales Volume of Commodity prediction technique, device and equipment based on data mining
CN108985808A (en) A kind of method and apparatus carrying out commodity selection
CN113239316A (en) City business facility layout rationality evaluation method and system considering crowd consumption characteristics
Orhun Spatial differentiation in the supermarket industry
CN109029475A (en) Tobacco retail customer based on cloud computing visits path planning visual analysis system
KR101200872B1 (en) Method and system for trade area analysis by using travel time and o-d matrix
US20210110420A1 (en) Device for evaluating energy-saving promotion achievement
CN108304872A (en) Local life service information processing method and processing device
Foti A behavioral framework for measuring walkability and its impact on home values and residential location choices
CN107578293A (en) A kind of solution formulation method and device in electric business transaction business
Sui et al. Sales associations between brand stores based on spatial interaction effects
Van Lin et al. “Hello Jumbo!” The Spatio-Temporal Rollout and Traffic to a New Grocery Chain After Acquisition
Huang Customer choice between electronic and traditional markets: An economic analysis

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
GR01 Patent grant