CN112686475B - Path planning system and method in field service business - Google Patents
Path planning system and method in field service business Download PDFInfo
- Publication number
- CN112686475B CN112686475B CN202110099943.4A CN202110099943A CN112686475B CN 112686475 B CN112686475 B CN 112686475B CN 202110099943 A CN202110099943 A CN 202110099943A CN 112686475 B CN112686475 B CN 112686475B
- Authority
- CN
- China
- Prior art keywords
- service
- path planning
- historical
- scheduling
- paths
- 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.)
- Active
Links
- 238000013439 planning Methods 0.000 title claims abstract description 86
- 238000000034 method Methods 0.000 title claims abstract description 26
- 239000011159 matrix material Substances 0.000 claims abstract description 22
- 230000026676 system process Effects 0.000 claims description 6
- 230000007774 longterm Effects 0.000 abstract 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000007689 inspection Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000007619 statistical method Methods 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 238000012384 transportation and delivery Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Abstract
The invention provides a path planning system and a method in field service business, comprising the following steps: the first acquisition module is used for processing the acquired historical service data of each service node to obtain the historical service frequency ratio of all the service nodes; the second acquisition module is used for respectively acquiring a first distance between the service network point and the service center and a second distance between the service network point and all other service network points except the second acquisition module so as to form a distance matrix; the path planning module is used for processing according to the historical service frequency ratio and the distance matrix to obtain a plurality of service paths and corresponding scheduling frequencies; and the scheduling module is used for processing an upper limit value and a lower limit value of the preset adjacent twice service interval time of each service network point according to the plurality of service paths, the scheduling frequency and the scheduling interval time of the adjacent two service paths to obtain the service sequence combination of each service path. The method has the advantages of being suitable for operation scenes with indefinite or indefinite duration, and reducing long-term operation cost.
Description
Technical Field
The present invention relates to the field of field service management, and in particular, to a path planning system and method.
Background
On-site services, typically services to be delivered on site by a service team, are in demand for on-site services in many industries around us, and most often in some scenarios where repeated services are required, since business personnel need to go to the same place periodically, while there is some flexibility in scheduling and path planning of the services, and more importantly, such repeated operation activities will last until the day when their business is completed, and possibly indefinitely. Taking a vending machine replenishment scene as an example, a certain company is responsible for a limited number of vending machines, needs to serve the setting places of the vending machines multiple times or infinitely many times, but cannot serve the setting places of the same vending machine multiple times, in the prior art, a delivery scheme of the current day or the next day is generally dynamically determined based on goods inventory, theoretically, the best solution of the problem is a model of inventory path problems (Inventory Routing Problem, IRP) and a corresponding algorithm, the method firstly needs to monitor the goods inventory in real time, the inventory path problem model is too complex, almost no existing operation algorithm can solve, if manual scheduling is relied, the result of relatively close optimization is difficult to achieve, and the difference of the capabilities of schedulers also causes the waste of operation cost to a great extent; moreover, constantly changing routes can also increase the difficulty of the operation of the dispenser.
Conventional route planning methods typically calculate a shortest service route, i.e., a trip problem, containing all facility locations, or consider a plurality of service routes, i.e., a plurality of trip problems, for a limited number of days, and then repeatedly execute the service routes. However, the single access distance of the two service paths is high in cost, and the service requirements of an indefinite operation scene cannot be met.
Disclosure of Invention
Aiming at the problems existing in the prior art, the invention provides a path planning system in field service business, which is applied to a scene of repeatedly providing service, wherein the scene of repeatedly providing service comprises a service center and a plurality of service network points which are related to the service center and need to repeatedly provide service;
The path planning system includes:
the first acquisition module is used for acquiring historical service data of each service network point, and processing according to the historical service data to obtain historical service frequency ratios of all the service network points;
a second obtaining module, configured to obtain, for each service node, a first distance between the service node and the service center and a second distance between the service node and all other service nodes except for the service node, so as to form a distance matrix;
the path planning module is respectively connected with the first acquisition module and the second acquisition module and is used for processing according to the historical service frequency ratio and the distance matrix to obtain a plurality of service paths and scheduling frequencies corresponding to each service path;
And the scheduling module is connected with the path planning module and is used for processing an upper limit value and a lower limit value of the preset adjacent twice service interval time of each service network point according to the service paths, the corresponding scheduling frequency and the preset adjacent twice service interval time of each service network point to obtain service sequence combinations of the service paths and the scheduling interval time of the adjacent two service paths.
Preferably, the first obtaining module includes:
The data acquisition unit is used for acquiring historical service data of each service website to form a data set;
the first processing unit is connected with the data acquisition unit and is used for processing each service network point according to the corresponding historical service data to obtain a historical service period;
And the second processing unit is connected with the first processing unit and is used for processing and obtaining the historical service frequency ratios of all the service network points according to each historical service period.
Preferably, the system further includes a path updating module connected to the first obtaining module, where the path updating module includes:
the first updating unit is used for counting the current service data of each service network point in real time and adding the current service data into the data set so as to update the data set;
The second updating unit is connected with the first updating unit and is used for acquiring a current service period obtained by the first processing unit according to the updated historical service data processing aiming at each service network point, and when the variation of the current service period relative to the historical service period is larger than a threshold value, the current service period is used as the historical service period and is output.
Preferably, the path planning module includes:
A first establishing unit, configured to establish a path planning model that considers both the service frequency and the service sequence of the service network point with the shortest service distance of each service period as a target;
and the first solving unit is connected with the first establishing unit and is used for solving the path planning model by taking the historical service frequency ratio and the distance matrix as constraints to obtain a plurality of service paths and scheduling frequencies corresponding to each service path.
Preferably, the scheduling module includes:
A second establishing unit, configured to establish a scheduling model with a minimum degree of violation of the limit of the service interval time between two consecutive services of all the service nodes as a target;
And the second solving unit is connected with the second establishing unit and is used for solving the scheduling model by taking a plurality of service paths, the corresponding scheduling frequency, the upper limit value and the lower limit value as constraints to obtain service sequence combinations of the service paths and scheduling interval time of two adjacent service paths.
The invention also provides a path planning method in the field service business, which is applied to the path planning system and comprises the following steps:
Step S1, the path planning system obtains historical service data of all service nodes, obtains historical service frequency ratios of all the service nodes according to the historical service data, and obtains a first distance between the service node and the service center and a second distance between the service node and all other service nodes except the service node according to each service node so as to form a distance matrix;
Step S2, the path planning system obtains a plurality of service paths and scheduling frequencies corresponding to each service path according to the historical service frequency ratio and the distance matrix;
and S3, the path planning system processes an upper limit value and a lower limit value of preset adjacent twice service interval time of each service network point according to the service paths, the corresponding scheduling frequency and the preset adjacent twice service interval time of each service network point to obtain service sequence combinations of the service paths and the scheduling interval time of the adjacent two service paths.
Preferably, in the step S1, an acquisition process of a historical service frequency ratio is included, including:
Step S11, the path planning system obtains the historical service data of each service network point to form a data set;
step S12, the path planning system processes and obtains a history service period according to the corresponding history service data aiming at each service network point;
Step S13, the path planning system obtains the historical service frequency ratios of all the service network points according to each historical service period.
Preferably, the method further comprises a path updating process, including:
Step A1, the path planning system counts the current service data of each service network point in real time, and adds the current service data into the data set so as to update the data set;
And step A2, the path planning system acquires a current service period obtained by the first processing unit according to the updated historical service data processing for each service network point, and outputs the current service period as the historical service period when the variation of the current service period relative to the historical service period is greater than a threshold value, and then the step S13 is performed.
Preferably, the step S2 includes:
Step S21, the path planning system takes the shortest service distance of each service period as a target, and establishes a path planning model which simultaneously considers the service frequency and the service sequence of the service network points;
And S22, the path planning system solves the path planning model by taking the historical service frequency ratio and the distance matrix as constraints to obtain a plurality of service paths and scheduling frequencies corresponding to each service path.
Preferably, the step S3 includes:
step S31, the path planning system establishes a scheduling model with the minimum degree of violation of the limit of the service interval time between two continuous services of all the service network points as a target;
And S32, the path planning system solves the scheduling model by taking a plurality of service paths, the corresponding scheduling frequency, the upper limit value and the lower limit value as constraints to obtain service sequence combinations of the service paths and scheduling interval time of two adjacent service paths.
The technical scheme has the following advantages or beneficial effects:
1) The service sequence combination and the scheduling interval time between two adjacent service paths in the service sequence combination are used as the result of path planning, so that the method is applicable to an operation scene with indefinite or indefinite duration, and the problems of difficult scheduling operation caused by frequent path replacement are avoided;
2) The inventory of each service network point is not required to be monitored, so that the difficulty of data acquisition and data processing is reduced;
3) The service operation cost is effectively reduced, and the optimal service period of each service network point is ensured to the greatest extent.
Drawings
FIG. 1 is a schematic diagram of a path planning system according to a preferred embodiment of the present invention;
FIG. 2 is a flow chart of a path planning method according to a preferred embodiment of the invention;
FIG. 3 is a flow chart illustrating the process of obtaining the historical service frequency ratio according to the preferred embodiment of the present invention;
FIG. 4 is a flow chart illustrating a path update procedure according to a preferred embodiment of the present invention;
FIG. 5 is a flow chart illustrating a process for solving the service paths and the corresponding scheduling frequency according to the preferred embodiment of the present invention;
fig. 6 is a flowchart illustrating service sequence combination and scheduling interval according to a preferred embodiment of the present invention.
Detailed Description
The invention will now be described in detail with reference to the drawings and specific examples. The present invention is not limited to the embodiment, and other embodiments may fall within the scope of the present invention as long as they conform to the gist of the present invention.
In a preferred embodiment of the present invention, based on the above-mentioned problems existing in the prior art, a path planning system in a field service is provided, which is applied to a scenario of repeatedly providing services, where the scenario of repeatedly providing services includes a service center and a plurality of service sites associated with the service center that need to repeatedly provide services;
as shown in fig. 1, the path planning system includes:
the first acquisition module 1 is used for acquiring historical service data of each service network point, and processing according to the historical service data to obtain the historical service frequency ratio of all the service network points;
A second obtaining module 2, configured to obtain, for each service node, a first distance between the service node and the service center and a second distance between the service node and all other service nodes except for the service node, so as to form a distance matrix;
The path planning module 3 is respectively connected with the first acquisition module 1 and the second acquisition module 2 and is used for processing according to the historical service frequency ratio and the distance matrix to obtain a plurality of service paths and the scheduling frequency corresponding to each service path;
The scheduling module 4 is connected with the path planning module 3, and is used for processing an upper limit value and a lower limit value of the preset adjacent twice service interval time of each service node according to the plurality of service paths, the corresponding scheduling frequency and the preset adjacent twice service interval time of each service node to obtain the service sequence combination of each service path and the scheduling interval time of the adjacent two service paths.
Specifically, in the present embodiment, the above-mentioned repeated service providing scenarios include, but are not limited to, vending machine restocking scenarios, garbage collection scenarios, equipment inspection scenarios, and home care scenarios. The above-described scenario of repeatedly providing services has in common that business personnel need to repeatedly visit the same place. Taking the vending machine replenishment scene as an example for explanation, the service center is a cargo distribution center, and each service website is a vending machine arranged at a fixed position.
According to the technical scheme, the original data to be acquired comprise historical sales data of each vending machine as the historical service data, and the replenishment frequency ratios of all vending machines are obtained based on the historical sales data, if three vending machines exist, according to the historical sales data, the first vending machine needs daily replenishment, the second vending machine needs daily replenishment, the third vending machine needs three-day replenishment, and the replenishment frequency ratios of the three vending machines are the first vending machine: a second vending machine: third vending machine=6:3:2.
The original data to be acquired in the technical scheme further comprises position coordinates of a goods distribution center and position coordinates of all vending machines for distributing goods by the goods distribution center, and further, for each vending machine, the distance between the vending machine and the goods distribution center, namely the first distance, and the distance between the vending machine and other vending machines, namely the second distance, can be acquired based on the position coordinates, and the first distance and the second distances form a distance matrix related to the vending machine.
After the historical service frequency ratio and the distance matrix are obtained, a plurality of service paths and scheduling frequencies corresponding to each service path can be further processed, and also, taking a vending machine as an example, each service path is a single-access service path. For example, a cargo distribution center with the number 0 is associated with six vending machines, the numbers of which are 1-6 in sequence, the service paths obtained by processing can include three service paths which are respectively <0,4,1,2,5,0>, <0,5,2,3,6,0> and <0,6,3,1,4,0>, the scheduling frequency corresponding to each service path can be once, and it can be seen that the sequential execution of the three service paths is equivalent to the complete access of the vending machines with the numbers 1-6 for two times, namely, each vending machine is accessed for two times.
Further, after the multiple service paths and the corresponding scheduling frequency are obtained, further scheduling of the multiple service paths is required to be performed, so that the service distance cost is minimized while the replenishment requirement of each vending machine is met, and the result of scheduling may include the service sequence combination of each service path and the scheduling interval time of two adjacent service paths. Taking ase:Sub>A plurality of service paths as an example, wherein the scheduling frequency of A is 2, the scheduling frequency of B is 1, the scheduling frequency of C is 1, the service sequence combination obtained by final treatment can be A-B-A-C, the scheduling interval time can be 1 day, the service sequence combination is started to be executed at 1 month and 1 day, the vending machine contained in the service path A is supplemented according to the service path A for 1 month and 1 day, the vending machine is not supplemented for 1 month and 2 days, the vending machine contained in the service path B is supplemented according to the service path B for 1 month and 3 days, the vending machine contained in the service path A is not supplemented for 1 month and 5 days, the vending machine contained in the service path A is not supplemented for 1 month and 6 days, the vending machine contained in the service path C is supplemented for 1 month and 7 days, one cycle is completed, and the problems of difficult scheduling caused by frequent replacement of the vending machine after the service path is planned in an infinite period according to the mode in an infinite period can be avoided; the inventory of each service network point is not required to be monitored, so that the difficulty of data acquisition and data processing is reduced; and effectively reduce service operation cost, and guaranteed the best replenishment cycle of each vending machine to the greatest extent.
In a preferred embodiment of the present invention, the first acquisition module 1 comprises:
a data acquisition unit 11, configured to acquire historical service data of each service website to form a data set;
A first processing unit 12, connected to the data obtaining unit 11, configured to obtain, for each service node, a history service period according to the corresponding history service data processing;
The second processing unit 13 is connected to the first processing unit 12, and is configured to obtain the historical service frequency ratios of all service sites according to the processing of each historical service period.
Specifically, in this embodiment, taking the above historical service data as the historical sales data of the vending machine as an example, the above historical service period is the optimal replenishment period of the corresponding vending machine obtained by analysis according to the historical sales data, and the obtaining manner of the optimal replenishment period may be obtained by processing based on the existing statistical method, which is not an invention point of the present technical solution, and a specific processing process is not repeated here. After the optimal replenishment cycle of each vending machine is obtained, the optimal replenishment frequency ratio of all vending machines can be further processed and obtained, and the above-mentioned historical service frequency ratio is given as a specific example, and is not repeated here.
In the preferred embodiment of the present invention, the apparatus further comprises a path update module 5 connected to the first acquisition module 1, and the path update module 5 includes:
a first updating unit 51, configured to count current service data of each service node in real time, and add the current service data into the data set to update the data set;
The second updating unit 52 is connected to the first updating unit 51, and is configured to obtain, for each service node, a current service period obtained by the first processing unit according to the updated historical service data, and when a variation of the current service period relative to the historical service period is greater than a threshold, take the current service period as the historical service period and output the historical service period.
In particular, in this embodiment, although the positions of the service sites are generally unchanged, taking the vending machine as an example, under normal conditions, sales data of each vending machine tends to be stable, but there may be a significant trend of increasing or decreasing sales data of one or more service sites due to external factors, that is, the variation of the current service period relative to the historical service period is greater than a threshold, which may be set manually according to requirements, and at this time, in order not to affect normal use of the vending machine, the replenishment frequency needs to be adjusted accordingly.
In a preferred embodiment of the present invention, the path planning module 3 comprises:
A first establishing unit 31, configured to establish a path planning model that considers both the service frequency and the service sequence of the service network point with the shortest service distance of each service period as a target;
The first solving unit 32 is connected to the first establishing unit 31, and is configured to solve the path planning model with the historical service frequency ratio and the distance matrix as constraints to obtain a plurality of service paths and a scheduling frequency corresponding to each service path.
Specifically, in this embodiment, the first solving unit 32 may use a column generation algorithm to solve the path planning model.
In a preferred embodiment of the present invention, the scheduling module 4 includes:
a second establishing unit 41 for establishing a scheduling model with a minimum degree of violation of a limit of a service interval time between two consecutive services of all service nodes as a target;
The second solving unit 42 is connected to the second establishing unit 41, and is configured to solve the scheduling model with the plurality of service paths, the corresponding scheduling frequency, the upper limit value and the lower limit value as constraints to obtain a service sequence combination of each service path and a scheduling interval time of two adjacent service paths.
The invention also provides a path planning method in the field service business, which is applied to the path planning system, as shown in fig. 2, and comprises the following steps:
Step S1, a path planning system acquires historical service data of all service nodes, and obtains the historical service frequency ratio of all the service nodes according to the historical service data, and each service node respectively acquires a first distance between the service node and a service center and a second distance between the service node and all other service nodes except the service node so as to form a distance matrix;
Step S2, the path planning system obtains a plurality of service paths and scheduling frequencies corresponding to each service path according to the historical service frequency ratio and the distance matrix;
And step S3, the path planning system processes an upper limit value and a lower limit value of preset adjacent twice service interval time of each service network point according to the plurality of service paths, the corresponding scheduling frequency and the scheduling interval time of the adjacent two service paths to obtain service sequence combinations of the service paths.
In a preferred embodiment of the present invention, step S1 includes a process of obtaining a historical service frequency ratio, as shown in fig. 3, including:
Step S11, a path planning system acquires historical service data of each service network point to form a data set;
Step S12, the path planning system processes and obtains a history service period according to the corresponding history service data aiming at each service network point;
and step S13, the path planning system obtains the historical service frequency ratios of all service network points according to the processing of each historical service period.
In a preferred embodiment of the present invention, a path update procedure is further included, as shown in fig. 4, including:
step A1, a path planning system counts current service data of each service network point in real time, and adds the current service data into a data set so as to update the data set;
And step A2, the path planning system acquires the current service period obtained by the first processing unit according to the updated historical service data for each service network point, and outputs the current service period as a historical service period when the variation of the current service period relative to the historical service period is greater than a threshold value, and then the step S13 is performed.
In a preferred embodiment of the present invention, as shown in fig. 5, step S2 includes:
step S21, the path planning system takes the shortest service distance of each service period as a target, and establishes a path planning model which simultaneously considers the service frequency and the service sequence of the service network points;
and S22, solving the path planning model by using the historical service frequency ratio and the distance matrix as constraints by the path planning system to obtain a plurality of service paths and scheduling frequencies corresponding to each service path.
In a preferred embodiment of the present invention, as shown in fig. 6, step S3 includes:
Step S31, the path planning system establishes a scheduling model by taking the minimum degree of violation of the limit of service interval time between two continuous services of all service network points as a target;
And S32, the path planning system solves the scheduling model by taking a plurality of service paths, corresponding scheduling frequencies, an upper limit value and a lower limit value as constraints to obtain service sequence combinations of each service path and scheduling interval time of two adjacent service paths.
The foregoing description is only illustrative of the preferred embodiments of the present invention and is not to be construed as limiting the scope of the invention, and it will be appreciated by those skilled in the art that equivalent substitutions and obvious variations may be made using the description and drawings, and are intended to be included within the scope of the present invention.
Claims (8)
1. The path planning system in the field service business is characterized by being applied to a scene for repeatedly providing services, wherein the scene for repeatedly providing the services comprises a service center and a plurality of service network points which are related to the service center and need to repeatedly provide the services;
The path planning system includes:
the first acquisition module is used for acquiring historical service data of each service network point, and processing according to the historical service data to obtain historical service frequency ratios of all the service network points;
a second obtaining module, configured to obtain, for each service node, a first distance between the service node and the service center and a second distance between the service node and all other service nodes except for the service node, so as to form a distance matrix;
the path planning module is respectively connected with the first acquisition module and the second acquisition module and is used for processing according to the historical service frequency ratio and the distance matrix to obtain a plurality of service paths and scheduling frequencies corresponding to each service path;
The scheduling module is connected with the path planning module and is used for processing an upper limit value and a lower limit value of preset adjacent twice service interval time of each service network point according to a plurality of service paths, the corresponding scheduling frequency and the preset adjacent twice service interval time of each service network point to obtain service sequence combinations of the service paths and the scheduling interval time of the adjacent two service paths;
The scheduling module comprises:
A second establishing unit, configured to establish a scheduling model with a minimum degree of violation of the limit of the service interval time between two consecutive services of all the service nodes as a target;
And the second solving unit is connected with the second establishing unit and is used for solving the scheduling model by taking a plurality of service paths, the corresponding scheduling frequency, the upper limit value and the lower limit value as constraints to obtain service sequence combinations of the service paths and scheduling interval time of two adjacent service paths.
2. The path planning system of claim 1, wherein the first acquisition module comprises:
The data acquisition unit is used for acquiring historical service data of each service website to form a data set;
the first processing unit is connected with the data acquisition unit and is used for processing each service network point according to the corresponding historical service data to obtain a historical service period;
And the second processing unit is connected with the first processing unit and is used for processing and obtaining the historical service frequency ratios of all the service network points according to each historical service period.
3. The path planning system of claim 2, further comprising a path update module coupled to the first acquisition module, the path update module comprising:
the first updating unit is used for counting the current service data of each service network point in real time and adding the current service data into the data set so as to update the data set;
The second updating unit is connected with the first updating unit and is used for acquiring a current service period obtained by the first processing unit according to the updated historical service data processing aiming at each service network point, and when the variation of the current service period relative to the historical service period is larger than a threshold value, the current service period is used as the historical service period and is output.
4. The path planning system of claim 1, wherein the path planning module comprises:
the first establishing unit is used for establishing a path planning model which simultaneously considers the service frequency and the service sequence of the service network points by taking the shortest service distance of each service period as a target;
and the first solving unit is connected with the first establishing unit and is used for solving the path planning model by taking the historical service frequency ratio and the distance matrix as constraints to obtain a plurality of service paths and scheduling frequencies corresponding to each service path.
5. A path planning method in field service business, characterized by being applied to a path planning system according to any one of claims 1-4, comprising:
Step S1, the path planning system obtains historical service data of all service nodes, obtains historical service frequency ratios of all the service nodes according to the historical service data, and obtains a first distance between the service node and the service center and a second distance between the service node and all other service nodes except the service node according to each service node so as to form a distance matrix;
Step S2, the path planning system obtains a plurality of service paths and scheduling frequencies corresponding to each service path according to the historical service frequency ratio and the distance matrix;
Step S3, the path planning system processes an upper limit value and a lower limit value of preset adjacent twice service interval time of each service network point according to a plurality of service paths, the corresponding scheduling frequency and the scheduling interval time of the adjacent two service paths to obtain service sequence combinations of the service paths;
the step S3 includes:
step S31, the path planning system establishes a scheduling model with the minimum degree of violation of the limit of the service interval time between two continuous services of all the service network points as a target;
And S32, the path planning system solves the scheduling model by taking a plurality of service paths, the corresponding scheduling frequency, the upper limit value and the lower limit value as constraints to obtain service sequence combinations of the service paths and scheduling interval time of two adjacent service paths.
6. The path planning method according to claim 5, wherein in the step S1, a process of obtaining a historical service frequency ratio is included, including:
Step S11, the path planning system obtains the historical service data of each service network point to form a data set;
step S12, the path planning system processes and obtains a history service period according to the corresponding history service data aiming at each service network point;
Step S13, the path planning system obtains the historical service frequency ratios of all the service network points according to each historical service period.
7. The path planning method of claim 6, further comprising a path update process comprising:
Step A1, the path planning system counts the current service data of each service network point in real time, and adds the current service data into the data set so as to update the data set;
And step A2, the path planning system acquires a current service period obtained by the first processing unit according to the updated historical service data processing for each service network point, and outputs the current service period as the historical service period when the variation of the current service period relative to the historical service period is greater than a threshold value, and then the step S13 is performed.
8. The path planning method according to claim 5, wherein the step S2 includes:
Step S21, the path planning system takes the shortest service distance of each service period as a target, and establishes a path planning model which simultaneously considers the service frequency and the service sequence of the service network points;
And S22, the path planning system solves the path planning model by taking the historical service frequency ratio and the distance matrix as constraints to obtain a plurality of service paths and scheduling frequencies corresponding to each service path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110099943.4A CN112686475B (en) | 2021-01-25 | 2021-01-25 | Path planning system and method in field service business |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110099943.4A CN112686475B (en) | 2021-01-25 | 2021-01-25 | Path planning system and method in field service business |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112686475A CN112686475A (en) | 2021-04-20 |
| CN112686475B true CN112686475B (en) | 2024-04-26 |
Family
ID=75459178
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110099943.4A Active CN112686475B (en) | 2021-01-25 | 2021-01-25 | Path planning system and method in field service business |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112686475B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103745021A (en) * | 2013-11-05 | 2014-04-23 | 陕西科技大学 | Comprehensive planning method for paths of vehicles for picking up goods |
| CN104700203A (en) * | 2015-01-15 | 2015-06-10 | 北京农业信息技术研究中心 | Method and device for planning logistics distribution nodes |
| CN105043400A (en) * | 2015-06-30 | 2015-11-11 | 百度在线网络技术（北京）有限公司 | Route planning method and device |
| CN111780776A (en) * | 2020-06-19 | 2020-10-16 | 上海东普信息科技有限公司 | Multi-frequency vehicle path planning method, device, equipment and storage medium |
-
2021
- 2021-01-25 CN CN202110099943.4A patent/CN112686475B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103745021A (en) * | 2013-11-05 | 2014-04-23 | 陕西科技大学 | Comprehensive planning method for paths of vehicles for picking up goods |
| CN104700203A (en) * | 2015-01-15 | 2015-06-10 | 北京农业信息技术研究中心 | Method and device for planning logistics distribution nodes |
| CN105043400A (en) * | 2015-06-30 | 2015-11-11 | 百度在线网络技术（北京）有限公司 | Route planning method and device |
| CN111780776A (en) * | 2020-06-19 | 2020-10-16 | 上海东普信息科技有限公司 | Multi-frequency vehicle path planning method, device, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112686475A (en) | 2021-04-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104580284B (en) | Traffic assignments device and method for distributing business | |
| US20170116522A1 (en) | Method For Task Scheduling And Resources Allocation And System Thereof | |
| US20100153157A1 (en) | Method and system for providing network resource growth management | |
| CN101639687B (en) | Integrated technology quality control system and realization method thereof | |
| Si et al. | Triple-level opportunistic maintenance policy for leasehold service network of multi-location production lines | |
| Alkaabneh et al. | A multi-objective home healthcare delivery model and its solution using a branch-and-price algorithm and a two-stage meta-heuristic algorithm | |
| US20180082266A1 (en) | Combined aircraft maintenance routing and maintenance task scheduling | |
| CN109067670A (en) | A kind of CDN dispatching method and CDN controlling equipment | |
| US11334598B2 (en) | Computer-implemented management of bookings for transportation services | |
| CN105719221A (en) | Path cooperation programming method and device aiming at multitask | |
| Yang et al. | Coordinating inventory control and pricing strategies under batch ordering | |
| CN110471746A (en) | A kind of distributed transaction callback method, apparatus and system | |
| CN109697637A (en) | Object type determines method, apparatus, electronic equipment and computer storage medium | |
| CN110377416A (en) | Distributed subregion method for scheduling task and device | |
| CN112861494A (en) | Road network data-based visual report generation method, equipment and storage medium | |
| CN116631593A (en) | Optimized hospital scheduling method, system and storage medium | |
| CN112686475B (en) | Path planning system and method in field service business | |
| CN113076186B (en) | Task processing method, device, electronic equipment and storage medium | |
| CN107769954B (en) | Method and device for shielding equipment alarm | |
| CN105260401A (en) | Method and device for querying and storing electric data | |
| CN105262702B (en) | TDMA communication network slot uniform distribution method based on minimal time delay shake | |
| US11137258B2 (en) | Systems and methods for comprehensive routing | |
| Upasani et al. | Integrating a decomposition procedure with problem reduction for factory scheduling with disruptions: a simulation study | |
| CN104994182B (en) | Adjust the method and device of address pool | |
| CN114091797A (en) | Intelligent dispatching method and device |
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 |