CN112348601A - Service development route planning method - Google Patents
Service development route planning method Download PDFInfo
- Publication number
- CN112348601A CN112348601A CN202011401328.6A CN202011401328A CN112348601A CN 112348601 A CN112348601 A CN 112348601A CN 202011401328 A CN202011401328 A CN 202011401328A CN 112348601 A CN112348601 A CN 112348601A
- Authority
- CN
- China
- Prior art keywords
- service
- data processing
- processing device
- scheduling module
- planning
- 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
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0201—Market modelling; Market analysis; Collecting market data
- G06Q30/0204—Market segmentation
- G06Q30/0205—Location or geographical consideration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION 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/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06313—Resource planning in a project environment
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Entrepreneurship & Innovation (AREA)
- Development Economics (AREA)
- Economics (AREA)
- Theoretical Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Tourism & Hospitality (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Life Sciences & Earth Sciences (AREA)
- Biodiversity & Conservation Biology (AREA)
- Educational Administration (AREA)
- Data Mining & Analysis (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
本发明提供一种业务开发路线规划方法包括通过数据处理装置执行以下步骤：建立终端网点数据库；输入业务代表数量及服务片区数量；定义对应各业务代表的服务片区初始中心点；依据该服务片区初始中心点，建立对应各该业务代表的第一调度模块，并依该第一调度模块产生服务片区规划分配结果；依据该服务片区初始中心点，输入对应各该业务代表的工作日天数，并依据对应各该业务代表的所述服务片区规划分配结果及所输入的工作日天数产生第二调度模块；以及依据该第二调度模块产生业务开发路线规划信息。
The invention provides a business development route planning method, which includes the following steps: establishing a terminal network database; inputting the number of business representatives and the number of service areas; defining the initial center point of the service area corresponding to each business representative; The center point, establish the first scheduling module corresponding to each of the business representatives, and generate the service area planning and allocation results according to the first scheduling module; according to the initial center point of the service area, enter the number of working days corresponding to each of the business representatives, and according to A second scheduling module is generated corresponding to the service area planning and distribution result of each of the business representatives and the input number of working days; and business development route planning information is generated according to the second scheduling module.
Description
Technical Field
The present invention relates to a method for planning a service development route, and more particularly, to a method for improving or optimizing shop or area allocation and planning a service development route.
Background
At present, in the business marketing field, the visit route planning for shop owners or regional distribution and business representatives is generally self-planned by the business representatives or directly distributed by companies, so that when the shop owners or regions are distributed and the visit route is planned, the divided regional intranet points are often distributed unreasonably in geographic positions, for example: the distance between shops in the service area of the same service representative is too large, the service areas of different service representatives overlap in a large area, the distribution of network points among different service representatives is not reasonable, and the like, which may cause unfair competition among the service representatives and further affect the performance.
In addition, in the specific visiting route planning, the business representatives often determine themselves, so that the business representatives mostly depend on the familiarity of the business representatives with the street road conditions of the service areas, and for the business representatives who are not familiar with the geographic environment, too much time or distance is easily spent in visiting, which also increases the intangible cost of enterprises.
Therefore, how to improve or optimize the shop owner or area allocation and the visit route planning of the business representatives so as to improve the visit efficiency and the business representative value is a technical problem to be solved urgently.
Disclosure of Invention
In order to solve the above drawbacks of the prior art, the present invention provides a method for planning a service development route, comprising: establishing a terminal network point database through a data processing device, wherein the terminal network point database comprises service development data; inputting the number of service representatives and the number of service areas through the data processing device; defining initial central points of service areas corresponding to the service representatives through the data processing device; establishing a first scheduling module corresponding to each service representative according to the initial central point of the service area through the data processing device, and generating a planning and distributing result of the service area according to the first scheduling module; inputting the working day number corresponding to each service representative according to the initial central point of the service area through the data processing device, and generating a second scheduling module according to the service area planning distribution result corresponding to each service representative and the input working day number; and generating service development route planning information according to the second scheduling module through the data processing device.
In an embodiment of the present invention, the method for planning a service development route further includes the following steps: inputting customer data by the data processing device; inputting terminal website data corresponding to each client or sales data corresponding to each terminal website through the data processing device; inputting channel information corresponding to each terminal network point, defining service visit frequency and service visit duration information, terminal network point shelf visit duration information or weight information corresponding to each terminal network point through the data processing device; and generating the terminal website database according to the data and the information through the data processing device.
In one embodiment of the present invention, after the step of inputting the terminal site data corresponding to each client or the sales data corresponding to each terminal site, before inputting the channel information corresponding to each terminal site, defining the service visit frequency and the service visit duration information, the terminal site shelf visit duration information, or the weight information corresponding to each terminal site, the method further comprises the following steps: store data is input by the data processing device.
In an embodiment of the present invention, the step of establishing a first scheduling module corresponding to each service representative according to the initial central point of the service segment and generating a service segment planning and allocating result according to the first scheduling module further includes the following steps: defining the point of each terminal network point corresponding to each service area as a decision variable through the data processing device; defining the shortest distance information among the terminal nodes in each service area as a target function through the data processing device; defining, by the data processing apparatus, a constraint; and establishing the first scheduling module corresponding to each service representative through the data processing device according to the decision variables, the objective function and the limiting conditions.
In an embodiment of the present invention, after the establishing a first scheduling module corresponding to each service representative according to the initial center point of the service segment and generating a service segment planning allocation result according to the first scheduling module, the method further includes the following steps: searching an optimized result according to the initial central point of the service area and a first scheduling module through the data processing device; judging whether the optimization result is smaller than a default threshold value or not through the data processing device, and if so, outputting a mesh point distribution result; if not, repeating the step of searching the optimized result according to the initial central point of the service area and the first scheduling module; and forming grids on a map information picture according to the distribution result of the network points by the data processing device, and marking the information corresponding to each service representative.
In an embodiment of the present invention, the step of inputting the number of days of a working day corresponding to each service representative according to the initial center point of the service area, and generating the second scheduling module according to the distribution result of the service area planning corresponding to each service representative and the input number of days of the working day further includes the following steps: defining each terminal network point corresponding to each working day as a decision variable through the data processing device; defining the information of the shortest connecting distance between the terminal network points in each service area as a target function through the data processing device; defining, by the data processing apparatus, a constraint; and establishing the second scheduling module corresponding to each service representative through the data processing device according to the decision variables, the objective function and the limiting conditions.
In an embodiment of the present invention, after the working days corresponding to each service representative are input according to the initial center point of the service area, and the second scheduling module is generated according to the distribution result of the service area planning corresponding to each service representative and the input working days, the method further includes the following steps: searching an optimized result according to the initial central point of the service area and a second scheduling module through the data processing device; judging whether the optimization result is smaller than a default threshold value or not through the data processing device, and if so, outputting a distribution result of the nodes of the route of the working day; if not, repeating the step of searching the optimized result according to the initial central point of the service area and the second scheduling module; and forming a grid on a map information picture according to the distribution result of the network points through the data processing device, and marking the routes among the network points in the route of the working day and the information of the required hours.
In one embodiment of the present invention, after forming a grid on a map information screen according to the distribution result of the nodes, and labeling the information of the routes and the required hours among the nodes in the route of the working day, the method further includes the following steps: defining a working day visiting sequence as a decision variable through the data processing device; defining the minimum time required for visiting all the network points from the business office as an objective function through the data processing device; defining, by the data processing apparatus, a constraint; and establishing the third scheduling module corresponding to each service representative according to the decision variables, the objective function and the limiting conditions through the data processing device.
In an embodiment of the present invention, after the third scheduling module corresponding to each service representative is established, the method further includes the following steps: searching for an optimized result according to the third scheduling module through the data processing device; and generating service development route planning information according to the optimization results of the second scheduling module and the third scheduling module through the data processing device.
The business development route planning method can establish reasonable visiting routes and service areas, provide optimization suggestions, improve visiting efficiency and improve production value so as to further improve the transaction rate and the sales performance.
Drawings
Fig. 1 is a flowchart of an exemplary embodiment of a method for service development route planning according to the present invention.
Fig. 2 is a flowchart of an exemplary embodiment of a method for service development route planning according to the present invention.
Fig. 3 is a flowchart of an exemplary embodiment of a method for service development route planning according to the present invention.
Fig. 4 is a flowchart of another exemplary embodiment of a service development route planning method according to the present invention.
Fig. 5 is a flowchart of a service development route planning method according to another exemplary embodiment of the present invention.
Fig. 6 is a flowchart of another exemplary embodiment of a method for service development route planning according to the present invention.
Fig. 7 is a flowchart of a service development route planning method according to another exemplary embodiment of the present invention.
Fig. 8 is a flowchart of a service development route planning method according to another exemplary embodiment of the present invention.
Description of the component reference numbers:
S10-S60
S101 to S104
Step S11
S401 to S404 steps
S41-S43
S501-S504 steps
S51-S53
S54-S57
S61-S62
Detailed Description
The following description of the embodiments of the present invention is provided by way of specific examples, and other advantages and effects of the present invention will be readily apparent to those skilled in the art from the disclosure herein.
It should be understood that the structures, ratios, sizes, and the like shown in the drawings and described in the specification are only used for understanding and reading the present disclosure, and are not used for limiting the conditions of the present disclosure, which will not be technically significant, and any structural modifications, ratio changes or size adjustments should fall within the scope of the present disclosure without affecting the function and the achievable purpose of the present disclosure. In addition, the terms "above", "inside", "outside", "bottom" and "one" used in the present specification are for the sake of clarity only, and are not intended to limit the scope of the present invention, and changes or modifications of the relative relationship between the terms are also considered to be the scope of the present invention without substantial technical changes.
Referring to fig. 1, which is a flowchart of a method for planning a service development route according to an embodiment of the present invention, the present invention provides a method for planning a service development route, including: s10, establishing a terminal network point database through a data processing device, wherein the terminal network point database comprises service development data; s20 inputs the number of service representatives and the number of service areas through the data processing device; s30 defining the initial central point of service area corresponding to each service representative through the data processing device; s40, establishing a first scheduling module corresponding to each service representative according to the initial center point of the service area through the data processing device, and generating a planning and distributing result of the service area according to the first scheduling module; s50, inputting the working days corresponding to each service representative according to the initial central point of the service area through the data processing device, and generating a second scheduling module according to the service area planning distribution result corresponding to each service representative and the input working days; and S60 generating, by the data processing apparatus, service development route planning information according to the second scheduling module.
Please refer to fig. 2, which is a flowchart illustrating a method for planning a service development route according to another embodiment of the present invention. In an embodiment of the present invention, the step S10 is to establish, through the data processing device, a terminal web site database, where the terminal web site database includes the service development data, and the method further includes the following steps: s101, inputting customer data through the data processing device; s102, inputting terminal website data corresponding to each client or sales data corresponding to each terminal website through the data processing device; s103, inputting channel information corresponding to each terminal network point, defining service visit frequency and service visit duration information, terminal network point shelf visit duration information or weight information corresponding to each terminal network point through the data processing device; and S104, generating the terminal website database according to the data and the information through the data processing device.
According to the present invention, step S102 inputs terminal website data corresponding to each customer or sales data corresponding to each terminal website through the data processing device, wherein the terminal website data of the customer or the sales data corresponding to each terminal website may include a dealer master file, such as the number of websites under jurisdiction, longitude and latitude data of each website, and the type of pipeline corresponding to each website; receipt data, for example, effective sales volume of each site in the month, effective sales amount (dollar) of each site in the month, and the like; historical visit data, such as the visit duration (minutes) of the service representatives of the monthly websites at the stores, the visit frequency (times/weeks) of the service representatives of the monthly websites, and the like; and organizational architectural data such as type of business representatives under the organization, quantity and their affiliation, etc.
According to the present invention, step S103 may include inputting channel information corresponding to each of the terminal nodes, defining information of a service visit frequency and a service visit duration, information of a shelf visit duration of a terminal node, or weight information corresponding to each of the terminal nodes, through the data processing apparatus.
Wherein the type of the channel can be further defined by the store according to the sales amount, the number of shelf groups, the size of the store, special access and the like.
The service development route planning method can calculate and define service visit frequency and service visit duration information through the data processing device corresponding to different channel types.
In an embodiment of the present invention, the data processing apparatus can calculate and restore the recommended values of the visit duration and the visit frequency in the store by using the following equations 1 and 2 according to the historical actual visit data in a recent period of time, for example, in the last three months.
In other embodiments of the present invention, the visit duration and visit frequency of the store can be defined in other manners.
According to the present invention, step S104 may include generating, by the data processing apparatus, the terminal node database according to the data and the information, wherein the terminal node weights related to the information of the terminal nodes may be imported into the data processing apparatus and calculated by the data processing apparatus to generate the terminal node database.
The information about the terminal node may be, for example, a node yield value (i.e., a node sales volume) may be an average of sales volumes in the effective receipt of the node in approximately three months; the network points can be the number of network points corresponding to service areas or service daily routes of each service representative after the areas are divided or visit routes are established; the store visit duration may be a product of a recommended visit frequency and a recommended store visit duration, and so on.
The data processing device can further calculate and convert the information of the terminal network points into the same dimensionality, can standardize numerical values among different factors, and then calculates the scores of the terminal network points according to the selected terminal network point weight related to the information of the terminal network points.
In an embodiment of the present invention, after the step of inputting the terminal site data corresponding to each client or the sales data corresponding to each terminal site in step S102, before the step S103 of inputting the channel information corresponding to each terminal site, defining the service visit frequency and the service visit duration information, the terminal site shelf visit duration information, or the weight information corresponding to each terminal site, the method further includes step S11: store data is input by the data processing device.
In one embodiment of the present invention, the step S30 is defined by the data processing apparatus using a suitable algorithm to define the initial center point of the service area corresponding to each service representative. In an embodiment, the data processing apparatus may utilize a vector quantization method, such as a K-means clustering algorithm, but not limited thereto, and minimize intra-cluster distances and perform clustering according to inter-data point distances while maximizing inter-cluster distances as much as possible, thereby defining initial center points of service areas of each service representative.
In an embodiment of the invention, the step S40 may establish, by the data processing apparatus, a first scheduling module corresponding to each service representative according to the initial central point of the service segment, and generate a service segment planning allocation result according to the first scheduling module.
Please refer to fig. 3, which is a flowchart illustrating a method for planning a service development route according to another embodiment of the present invention. In an embodiment of the present invention, the step of establishing the first scheduling module corresponding to each service representative according to the initial central point of the service partition in the step S40 and generating the planning and allocating result of the service partition according to the first scheduling module further includes: s401, defining the point corresponding to each service area of each terminal network point as a decision variable through the data processing device; s402, defining the shortest distance information among the terminal nodes in each service area as an objective function through the data processing device; s403 defining, by the data processing apparatus, a constraint condition; and S404, establishing the first scheduling module corresponding to each service representative according to the decision variable, the objective function and the limiting condition through the data processing device.
According to the present invention, step S401 defines, by the data processing apparatus, that each of the service segments corresponds to each of the terminal nodes as a decision variable, which may include how each of the terminal nodes should be allocated to a selected service segment.
According to the present invention, the limitation condition in step S403 may be that, for example, each terminal node can only be allocated to one service segment; the net point weight scores of all service areas are close to each other, for example, the scores of the net point weights are different from each other by plus or minus 5%; the total number of the mesh points allocated to each service area is close, for example, the difference between the total number of the mesh points is plus or minus 5%.
Please refer to fig. 4, which is a flowchart illustrating a method for planning a service development route according to another embodiment of the present invention. In an embodiment of the present invention, after the establishing a first scheduling module corresponding to each service representative according to the initial center point of the service segment and generating a service segment planning allocation result according to the first scheduling module, the method further includes: s41, searching an optimized result according to the initial central point of the service area and the first scheduling module through the data processing device; s42, judging whether the optimization result is smaller than the default threshold value through the data processing device, if yes, outputting the distribution result of the network points; if not, repeating the step of searching the optimized result according to the initial central point of the service area and the first scheduling module; and S43, forming a grid on the map information picture according to the distribution result of the network points through the data processing device, and marking the information corresponding to each service representative on the grid. Therefore, the service development route planning method can plan the optimized service area.
In an embodiment of the invention, step S50 is to input the number of days of a working day corresponding to each service representative according to the initial center point of the service area through the data processing device, and generate the second scheduling module according to the distribution result of the service area plan corresponding to each service representative and the input number of days of the working day.
Please refer to fig. 5, which is a flowchart illustrating a method for planning a service development route according to another embodiment of the present invention. In an embodiment of the present invention, the step S50 is a step of inputting the number of days of a working day corresponding to each service representative according to the initial center point of the service area, and generating a second scheduling module according to the distribution result of the service area planning corresponding to each service representative and the input number of days of the working day, and further includes the following steps: s501, defining each working day corresponding to each terminal network point as a decision variable through the data processing device; s502, defining the shortest distance information of the connection among the terminal network points defined in each selected working day as an objective function through the data processing device; s503 defining a constraint condition by the data processing apparatus; and S504, establishing the second scheduling module corresponding to each service representative according to the decision variable, the objective function and the limiting condition through the data processing device.
According to the present invention, step S501 defines, through the data processing apparatus, that each terminal node corresponds to each workday as a decision variable, which may include how each terminal node should assign to a selected workday route visit. According to one embodiment of the invention, the website may be assigned to a selected one of the weekday itineraries for visiting; according to other embodiments of the present invention, the website may be assigned to a selected plurality of weekday itineraries.
According to the present invention, the limiting condition in step S504 may be, for example, that each site can only be allocated to a working day equivalent to the frequency of its visit (whether it is a monday visit or a more than a week visit); the dot weights on each weekday are close to each other, e.g., the scores differ by between plus or minus 5%; the total number of the net points allocated to each working day is similar, for example, the total number of the net points is different by plus or minus 5%.
Please refer to fig. 6, which is a flowchart illustrating a method for planning a service development route according to another embodiment of the present invention. In an embodiment of the present invention, after the step S50 inputs the number of days of a working day corresponding to each service representative according to the initial center point of the service area, and generates the second scheduling module according to the distribution result of the service area planning corresponding to each service representative and the input number of days of the working day, the method further includes: s51, searching an optimized result according to the initial central point of the service area and the second scheduling module through the data processing device; s52, judging whether the optimization result is smaller than the default threshold value through the data processing device, if so, outputting the distribution result of the nodes of the route of the working day; if not, repeating the step of searching the optimized result according to the initial central point of the service area and the second scheduling module; and S53 forming a grid on the map information picture according to the distribution result of the nodes by the data processing device, and marking the information of the routes and the required hours among the nodes in the route of the working day.
Since the initial center point of the service segment may have errors when the data processing apparatus performs step S50 to obtain the optimization result of the second scheduling module due to the small amount of data during calculation, according to an embodiment of the present invention, the data processing apparatus may operate the second scheduling module, select a plurality of nodes with the farthest distance from each other among nodes in the outermost periphery of the service segment as the starting points, and repeat steps S51-S53 until the distribution average of nodes in the same working day based on the distance from the node to the initial center point, the node number and the node weight score is achieved, that is, the optimization result is considered to be achieved.
In an embodiment of the invention, the step S60 may further generate the service development route planning information according to the second scheduling module and the result obtained in the previous step by the data processing device.
Please refer to fig. 7, which is a flowchart illustrating a method for planning a service development route according to another embodiment of the present invention. In one embodiment of the present invention, the steps S51 to S53 are performed to form a grid on the map information screen according to the distribution result of the nodes, and after labeling the information of the routes and the required hours among the nodes in the route of the working day, the method further includes: s54 defining the working day visit sequence as decision variable through the data processing device; s55 defining the minimum time required for visiting all the network points from the business office as the objective function through the data processing device; s56 defining a constraint condition by the data processing apparatus; and S57, establishing the third scheduling module corresponding to each service representative according to the decision variables, the objective function and the limiting conditions through the data processing device.
According to the present invention, the step S54 defines the workday visit sequence as the decision variable by the data processing device may include the visit sequence of each node allocated in the selected workday road.
According to the present invention, the step S55 defines the minimum time required to visit all the sites from the business office as the objective function by the data processing device, and can include selecting one of the sites, such as the business office, as the starting point to visit all the sites in the selected business office in the least time required.
According to the present invention, the step S56 defines the restriction conditions by the data processing device, and may include confirming the visit sequence of each website through the foregoing steps, and then further defining the visit frequency of each website, for example, each website visits once a day, but is not limited thereto.
Please refer to fig. 8, which is a flowchart illustrating a method for planning a service development route according to another embodiment of the present invention. In an embodiment of the present invention, after the step S51-S57 of establishing the third scheduling module corresponding to each service representative, the method further includes: s61 finding an optimized result according to the third scheduling module by the data processing apparatus; and S62 generating, by the data processing apparatus, service development route planning information according to the optimization results of the second and third scheduling modules.
The business development route planning method can establish reasonable visiting routes and service areas, provide optimization suggestions, improve visiting efficiency and improve production value so as to further improve the transaction rate and the sales performance.
The invention is further illustrated by the following examples.
Example 1-establishing a service area
Let N terminal nodes in a region need to be allocated to M service representatives. Establishing a terminal network point database through a data processing device, wherein the terminal network point database comprises service development data; through the data processing device, the number of service representatives and the number of service areas are input, and a matrix D (with dimension of M multiplied by N) is formed after the terminal network points and the service representatives are respectively marked.
Defining initial central points of service areas corresponding to the service representatives through the data processing device; and establishing a first scheduling module corresponding to each service representative according to the initial central point of the service area through the data processing device, and generating an optimized service area planning and distributing result according to the first scheduling module.
Example 2 establishing service development route planning
Inputting the working day number corresponding to each service representative according to the initial central point of the service area through the data processing device, and generating a second scheduling module according to the service area planning distribution result corresponding to each service representative and the input working day number; searching an optimized result according to the initial central point of the service area and a second scheduling module through the data processing device; judging whether the optimization result is smaller than a default threshold value or not through the data processing device, and if so, outputting a distribution result of the nodes of the route of the working day; if not, repeating the step of searching the optimized result according to the initial central point of the service area and the second scheduling module; forming a grid on a map information picture according to the distribution result of the network points by the data processing device, and marking the routes among the network points in the route of the working day and the information of the required hours; defining a working day visiting sequence as a decision variable through the data processing device; defining the minimum time required for visiting all the network points starting from the business office as an objective function through the data processing device, as shown in the following formula 3; defining, by the data processing apparatus, a constraint; establishing a third scheduling module corresponding to each service representative through the data processing device according to the decision variables, the objective function and the limiting conditions; searching an optimized result according to the third scheduling module through the data processing device; and generating service development route planning information according to the optimization results of the second scheduling module and the third scheduling module through the data processing device.
An objective function:
wherein, the generation number (i) is the number of the sections.
j is 1, …, n (n represents the number of terminal nodes in the service area)
Dij·Dist: for calculating the distance from the single terminal screen point to the central point of the patch.
And summing the terminal nodes of the single service area to obtain the average value from each terminal node to the center point of the service area in the single service area. And finally, summing the service areas to obtain the sum of the average distances of the service areas.
Wherein the limiting conditions are as follows:
1. each net point can be allocated to only one generation, and all net points are allocated with sigmajDij＝1。
2. The dot output values distributed to each generation are similar, a dot score S (matrix) is calculated in advance, and the average value S (constant) of the dot score S is calculated.
In this embodiment, the default threshold is set to ± 5%.
Example 3 route planning
Firstly, step S10 is executed, and a terminal web site database is established through the data processing apparatus, where the terminal web site database includes service development data, and includes: s101, inputting customer data through the data processing device; s102, inputting terminal website data corresponding to each client or sales data corresponding to each terminal website through the data processing device; s103, inputting channel information corresponding to each terminal network point, defining service visit frequency and service visit duration information, terminal network point shelf visit duration information or weight information corresponding to each terminal network point through the data processing device; and S104, generating the terminal website database according to the data and the information through the data processing device.
In the present embodiment, there are 1345 dots in total.
Step S20 is executed, and the data processing apparatus inputs the number of service representatives and the number of service segments, wherein the data processing apparatus has 5 service representatives, A, B, C, D, E and 5 corresponding service segments.
Step S30 is executed to define the initial center point of the service area corresponding to each service representative by the data processing apparatus.
Executing step S40, establishing a first scheduling module corresponding to each service representative according to the initial center point of the service parcel through the data processing apparatus, and generating a service parcel planning allocation result according to the first scheduling module, including: s401, defining the point corresponding to each service area of each terminal network point as a decision variable through the data processing device; s402, defining the shortest distance information among the terminal nodes in each service area as an objective function through the data processing device; s403 defining, by the data processing apparatus, a constraint condition; and S404, establishing the first scheduling module corresponding to each service representative according to the decision variable, the objective function and the limiting condition through the data processing device.
In the present embodiment, there are 1345 dots in total; according to this embodiment, the 1345 dots can be clustered into 5 groups by using, for example, a K-means clustering algorithm, or other algorithms, and the clustering results are 277, 213, 329, 275, and 251 dots.
The limitation conditions can be set as follows, each net point of A and A can be only distributed to one film area; b, the sum of the dot weight scores of each patch is similar.
Wherein the weight score may include a sales weight, a net point weight, a visit duration weight, and the like. The sales weight is the average value of the effective sales of the net point in nearly three months; the mesh point number weight is the mesh point number corresponding to each service area of the business generation after the zoning; the visit duration weight is the average visit frequency of the last three months and the average visit duration of the last three months store. The data above are converted to percentiles.
Finally, the more evenly distributed tile distribution is found as the following table.
| Number of net points | Time length score | Sales score | Total score | |
| Tablet region 1 | 271 | 133 | 53 | 118 |
| Slice area 2 | 253 | 141 | 63 | 118 |
| Slice area 3 | 275 | 134 | 48 | 119 |
| Slice region 4 | 273 | 133 | 52 | 119 |
| Slice region 5 | 273 | 131 | 59 | 119 |
Executing step S50, inputting the working days corresponding to each service representative according to the initial center point of the service area through the data processing device, and generating a second scheduling module according to the distribution result of the service area plan corresponding to each service representative and the input working days, including: s501, defining each working day corresponding to each terminal network point as a decision variable through the data processing device; s502, defining the shortest distance information of the connection among the terminal network points defined in each selected working day as an objective function through the data processing device; s503 defining a constraint condition by the data processing apparatus; and S504, establishing the second scheduling module corresponding to each service representative according to the decision variable, the objective function and the limiting condition through the data processing device.
For example, in this embodiment, the segment 1 is assigned to the service representative a, and according to the work day assignment, the network node should assign to which work day route visit.
The sum of the distances from the central point to the mesh points finally allocated to the same working day is the shortest, and the limiting conditions of S504 may include: each site can only be assigned to a weekday equivalent to the frequency of its visits (more than one week of visits); the sum of the dot weight scores for each weekday is similar (plus or minus 5%); the total number of dots allocated per weekday is similar (plus or minus 5%).
According to the business development route planning method, the distribution result of the working days is as follows:
| working day | Sum of fractions | Number of net points | Length of visit | Amount of sales |
| 0 | 27.63 | 54 | 812 | 134 |
| 1 | 27.67 | 55 | 791 | 127 |
| 2 | 29.22 | 54 | 820 | 182 |
| 3 | 28.57 | 55 | 819 | 116 |
| 4 | 28.62 | 53 | 817 | 153 |
Step S60 is executed to generate service development route planning information according to the second scheduling module via the data processing apparatus. The line-building plan may adopt, for example, tsp (tracking Salesman publishing), but is not limited thereto, and may use the minimum time required for visiting all the sites as an objective function, and each site can only visit once as a limiting condition.
The foregoing embodiments are merely illustrative of the principles and utilities of the present invention and are not intended to limit the invention. Any person skilled in the art can modify the above-described embodiments without departing from the spirit and scope of the present invention. Therefore, the scope of the invention should be determined from the following claims.
Claims (9)
1. A method for planning a service development route, the method comprising:
establishing a terminal network point database through a data processing device, wherein the terminal network point database comprises service development data;
inputting the number of service representatives and the number of service areas through the data processing device;
defining initial central points of service areas corresponding to the service representatives through the data processing device;
establishing a first scheduling module corresponding to each service representative according to the initial central point of the service area through the data processing device, and generating a planning and distributing result of the service area according to the first scheduling module;
inputting the working day number corresponding to each service representative according to the initial central point of the service area through the data processing device, and generating a second scheduling module according to the service area planning distribution result corresponding to each service representative and the input working day number; and
and generating service development route planning information according to the second scheduling module through the data processing device.
2. The business development route planning method of claim 1, further comprising the steps of:
inputting customer data by the data processing device;
inputting terminal website data corresponding to each client or sales data corresponding to each terminal website through the data processing device;
inputting channel information corresponding to each terminal network point, defining service visit frequency and service visit duration information, terminal network point shelf visit duration information or weight information corresponding to each terminal network point through the data processing device; and
and generating the terminal website database according to the data and the information through the data processing device.
3. The method for planning a service development route according to claim 2, wherein after the step of inputting terminal site data corresponding to each customer or sales data corresponding to each terminal site, before inputting channel information corresponding to each terminal site, defining service visit frequency and service visit duration information, terminal site shelf visit duration information, or weight information corresponding to each terminal site, the method further comprises the steps of:
store data is input by the data processing device.
4. The method according to claim 2, wherein the step of establishing a first scheduling module corresponding to each service representative according to the initial center point of the service area and generating a service area planning distribution result according to the first scheduling module further comprises the steps of:
defining the point of each terminal network point corresponding to each service area as a decision variable through the data processing device;
defining the shortest distance information among the terminal nodes in each service area as a target function through the data processing device;
defining, by the data processing apparatus, a constraint; and
and establishing the first scheduling module corresponding to each service representative through the data processing device according to the decision variables, the objective function and the limiting conditions.
5. The method as claimed in claim 4, wherein after establishing a first scheduling module corresponding to each service representative according to the initial center point of the service parcel and generating a service parcel planning allocation result according to the first scheduling module, the method further comprises the following steps:
searching an optimized result according to the initial central point of the service area and a first scheduling module through the data processing device;
judging whether the optimization result is smaller than a default threshold value or not through the data processing device, and if so, outputting a mesh point distribution result; if not, repeating the step of searching the optimized result according to the initial central point of the service area and the first scheduling module; and
forming grids on the map information picture according to the distribution result of the network points by the data processing device, and marking the information corresponding to each service representative on the grids.
6. The method for planning a service development route according to claim 1, wherein the step of inputting the number of days of a working day corresponding to each service representative according to the initial center point of the service area, and generating the second scheduling module according to the distribution result of the service area planning corresponding to each service representative and the input number of days of the working day further comprises the steps of:
defining each terminal network point corresponding to each working day as a decision variable through the data processing device;
defining the shortest distance information of the online among the terminal network points defined in each selected working day as an objective function through the data processing device;
defining, by the data processing apparatus, a constraint; and
and establishing the second scheduling module corresponding to each service representative through the data processing device according to the decision variables, the objective function and the limiting conditions.
7. The method of claim 6, wherein after the working days corresponding to each service representative are inputted according to the initial center point of the service area, and the second scheduling module is generated according to the distribution result of the service area planning corresponding to each service representative and the inputted working days, the method further comprises the following steps:
searching an optimized result according to the initial central point of the service area and a second scheduling module through the data processing device;
judging whether the optimization result is smaller than a default threshold value or not through the data processing device, and if so, outputting a distribution result of the nodes of the route of the working day; if not, repeating the step of searching the optimized result according to the initial central point of the service area and the second scheduling module; and
forming a grid on a map information picture by the data processing device according to the distribution result of the network points, and marking the information of routes and required hours among the network points in the route of the working day.
8. The method for planning a business development route according to claim 7, wherein a grid is formed on a map information screen according to the distribution result of the nodes, and after labeling information of routes and required hours among nodes in a route of a working day, the method further comprises the following steps:
defining a working day visiting sequence as a decision variable through the data processing device;
defining the minimum time required for visiting all the network points from the business office as an objective function through the data processing device;
defining, by the data processing apparatus, a constraint; and
and establishing the third scheduling module corresponding to each service representative through the data processing device according to the decision variables, the objective function and the limiting conditions.
9. The method for planning a service development route according to claim 8, further comprising the following steps after the third scheduling module corresponding to each service representative is established:
searching for an optimized result according to the third scheduling module through the data processing device; and
and generating service development route planning information according to the optimization results of the second scheduling module and the third scheduling module by the data processing device.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011401328.6A CN112348601B (en) | 2020-12-04 | 2020-12-04 | Business Development Roadmap Planning Method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011401328.6A CN112348601B (en) | 2020-12-04 | 2020-12-04 | Business Development Roadmap Planning Method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112348601A true CN112348601A (en) | 2021-02-09 |
| CN112348601B CN112348601B (en) | 2024-11-08 |
Family
ID=74428054
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011401328.6A Active CN112348601B (en) | 2020-12-04 | 2020-12-04 | Business Development Roadmap Planning Method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112348601B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116432886A (en) * | 2023-06-13 | 2023-07-14 | 北京纷扬科技有限责任公司 | Intelligent route planning method |
| CN118657273A (en) * | 2024-08-16 | 2024-09-17 | 北京纷扬科技有限责任公司 | A store route clustering planning method, system, electronic device and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105528649A (en) * | 2015-11-30 | 2016-04-27 | 山东烟草研究院有限公司 | Route optimization recommendation method based on clustering and saving algorithms |
| CN107871232A (en) * | 2017-10-19 | 2018-04-03 | 中国平安人寿保险股份有限公司 | A kind of generation method and its terminal of customer visit plan |
| CN108491964A (en) * | 2018-03-13 | 2018-09-04 | 上海靖盈物联网科技有限公司 | A method of visiting route according to GPS location Automatic Optimal |
| CN109978292A (en) * | 2017-12-27 | 2019-07-05 | 阿里巴巴集团控股有限公司 | The intelligent management and device of shops |
-
2020
- 2020-12-04 CN CN202011401328.6A patent/CN112348601B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105528649A (en) * | 2015-11-30 | 2016-04-27 | 山东烟草研究院有限公司 | Route optimization recommendation method based on clustering and saving algorithms |
| CN107871232A (en) * | 2017-10-19 | 2018-04-03 | 中国平安人寿保险股份有限公司 | A kind of generation method and its terminal of customer visit plan |
| CN109978292A (en) * | 2017-12-27 | 2019-07-05 | 阿里巴巴集团控股有限公司 | The intelligent management and device of shops |
| CN108491964A (en) * | 2018-03-13 | 2018-09-04 | 上海靖盈物联网科技有限公司 | A method of visiting route according to GPS location Automatic Optimal |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116432886A (en) * | 2023-06-13 | 2023-07-14 | 北京纷扬科技有限责任公司 | Intelligent route planning method |
| CN116432886B (en) * | 2023-06-13 | 2023-08-29 | 北京纷扬科技有限责任公司 | Intelligent route planning method |
| CN118657273A (en) * | 2024-08-16 | 2024-09-17 | 北京纷扬科技有限责任公司 | A store route clustering planning method, system, electronic device and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112348601B (en) | 2024-11-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Bekhor et al. | GEV-based destination choice models that account for unobserved similarities among alternatives | |
| Snyder et al. | The stochastic location model with risk pooling | |
| Lu | Robust weighted vertex p-center model considering uncertain data: An application to emergency management | |
| US9460053B2 (en) | Depth-first search for target value problems | |
| US7840319B2 (en) | Core area territory planning for optimizing driver familiarity and route flexibility | |
| US11669910B2 (en) | Multi-platform data processing system | |
| CN111045907B (en) | System capacity prediction method based on traffic | |
| Michel et al. | A column-generation based tactical planning method for inventory routing | |
| CN112348601A (en) | Service development route planning method | |
| US8024205B2 (en) | System and method for calculating damage as a result of natural catastrophes | |
| US20150120370A1 (en) | Advanced planning in a rapidly changing high technology electronics and computer industry through massively parallel processing of data using a distributed computing environment | |
| CN112215444B (en) | Prediction method, device and equipment based on distribution curve and storage medium | |
| JP2002304501A (en) | Tour planning method and device | |
| Fu et al. | Applying DEA–BPN to enhance the explanatory power of performance measurement | |
| CN116975626B (en) | A method and device for automatically updating supply chain data model | |
| CN113203427B (en) | Path planning method and device and server | |
| CN116911717A (en) | Method and system for distributing capacity in urban trade | |
| Cromley et al. | Scale-independent land-use allocation modeling in raster GIS | |
| JP7436697B2 (en) | Power market trading support platform | |
| CN116090589A (en) | An online scheduling method for online car-hailing driven by platform benefits under location noise disturbance | |
| CN113743994A (en) | Provider's season-busy prediction method, system, equipment and storage medium | |
| AU2005250615B2 (en) | Automated system and method for planning and creating optimised circuits for outdoor advertising media | |
| CN111882457A (en) | Transformer substation site selection method and device | |
| Ruvalcaba et al. | Multiobjective evolutionary algorithm for redesigning sales territories | |
| Patil et al. | Mobile Facility Location Problem: Practical Examples and Solution modeling |
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 |