A method, apparatus, device, and readable storage medium for ordering assigned services.

Abstract

This invention provides a method, apparatus, device, and readable storage medium for sorting assigned services. The method includes: acquiring service location information within a preset time period; establishing a service scatter map based on the service location information; generating a first sub-path on the service scatter map based on preset start and end points; changing the start and end points, and generating a second sub-path on the service scatter map based on the changed start and end points; acquiring fault tolerance information of the second sub-path, and generating an optimal sub-path on the service scatter map based on the fault tolerance information. This solves the problem of low assignment efficiency caused by existing service assignment methods that do not consider the global context.

Description

Technical Field

[0001] This invention relates to the field of global optimization, and in particular to a method, apparatus, device, and readable storage medium for sorting assigned services. Background Technology

[0002] In the nursing industry, when nurses provide home care services (or other industries involving home care), they need to travel to the patient's home to provide specific services. When a nurse visits multiple patients a day, optimizing the travel routes and service order to maximize service efficiency within the same timeframe becomes crucial. Blindly relying on subjective human judgment to determine service locations and order can lead to repetitive travel to and from different service locations, wasting time and transportation costs. Traditional thinking often only considers whether the outcome is optimal for nearby locations, but this can lead to a "blind spot," meaning the result is only locally optimal and lacks a holistic perspective, ultimately reducing service efficiency.

[0003] In view of the above, this application is hereby submitted. Summary of the Invention

[0004] This invention discloses a sorting method, apparatus, device, and readable storage medium for assigned services, aiming to solve the problem of low efficiency in existing assigned services.

[0005] The first embodiment of the present invention provides a method for sorting assigned services, including:

[0006] Obtain service location information within a preset time period, and create a service scatter map based on the service location information;

[0007] Based on the preset start and end points, a first sub-path is generated on the service scatter map;

[0008] Change the starting point and ending point, and generate a second sub-path on the service scatter map based on the changed starting point and ending point;

[0009] Obtain the fault tolerance information of the second sub-trajectory, and generate the optimal sub-trajectory on the service scatter map based on the fault tolerance information.

[0010] Preferably, obtaining the fault tolerance information of the second sub-path and generating the optimal sub-path on the service scatter map based on the fault tolerance information specifically involves:

[0011] Obtain the length values ​​of the first sub-path and the second sub-path;

[0012] When it is determined that the length of the second sub-travel line is greater than the length of the first sub-travel line, the error tolerance rate of the second sub-travel line is obtained; and it is determined whether the error tolerance rate of the second sub-travel line is greater than a preset value.

[0013] If so, define the second sub-path as the optimal path and maintain the second sub-path for path search;

[0014] If not, define the first sub-path as the optimal path and maintain the first sub-path for path searching. Preferably, the fault tolerance model for the second sub-path is:

[0015] P = e -[E(n+1)-E(n)] / T(n) ;

[0016] Where P is the fault tolerance rate, E(n+1) is the length of the second sub-path, E(n) is the length of the first sub-path, and T(n) is the descent rate.

[0017] Preferably, the service scatter map includes: a grid map, and obstacles and target locations generated on the grid map.

[0018] A second embodiment of the present invention provides a sorting device for assigning services, comprising:

[0019] A service scatter map building unit is used to acquire service location information within a preset time period and build a service scatter map based on the service location information.

[0020] The first sub-path generation unit is used to generate a first sub-path on the service scatter map according to a preset start point and end point.

[0021] The second sub-path generation unit is used to change the starting point and the ending point, and generate a second sub-path on the service scatter map according to the changed starting point and the ending point;

[0022] The optimal sub-trajectory generation unit is used to obtain the fault tolerance information of the second sub-trajectory and generate the optimal sub-trajectory on the service scatter map according to the fault tolerance information.

[0023] Preferably, the optimal sub-path generation unit is specifically used for:

[0024] Obtain the length values ​​of the first sub-path and the second sub-path;

[0025] When it is determined that the length of the second sub-travel line is greater than the length of the first sub-travel line, the error tolerance rate of the second sub-travel line is obtained; and it is determined whether the error tolerance rate of the second sub-travel line is greater than a preset value.

[0026] If so, define the second sub-path as the optimal path and maintain the second sub-path for path search;

[0027] If not, define the first sub-path as the optimal path and maintain the first sub-path for path searching. Preferably, the fault tolerance model for the second sub-path is:

[0028] P = e -[E(n+1)-E(n)] / T(n) ;

[0029] Where P is the fault tolerance rate, E(n+1) is the length of the second sub-path, E(n) is the length of the first sub-path, and T(n) is the descent rate.

[0030] Preferably, the service scatter map includes: a grid map, and obstacles and target locations generated on the grid map.

[0031] A third embodiment of the present invention provides a sorting device for assigned services, including a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor. The processor executes the computer program to implement a sorting method for assigned services as described in any of the above embodiments.

[0032] The fourth embodiment of the present invention provides a readable storage medium storing a computer program, the computer program being executable by a processor of the device in which the computer-readable storage medium is located, to implement the sorting of an assignment service as described in any of the above embodiments.

[0033] Based on the sorting method, apparatus, device, and readable storage medium for dispatch services provided by this invention, the method obtains location information that needs to be served within a certain time period, establishes a service scatter map based on the location information, generates a corresponding first sub-path based on a preset start point and end point, changes the start point and end point multiple times, and generates a corresponding second sub-path based on each change, then obtains the fault tolerance information of each second sub-path, and generates an optimal sub-path based on the fault tolerance information. This solves the problem of low dispatch efficiency caused by the lack of global consideration in existing dispatch services. Attached Figure Description

[0034] Figure 1 This is a flowchart illustrating a sorting method for assigning services provided in the first embodiment of the present invention;

[0035] Figure 2 This is a schematic diagram of the service scatter map provided by the present invention;

[0036] Figure 3 This is a schematic diagram of the optimal sub-movement path provided by the present invention;

[0037] Figure 4 This is a schematic diagram of a sorting device for assigning services provided in the second embodiment of the present invention. Detailed Implementation

[0038] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0039] To better understand the technical solution of the present invention, the embodiments of the present invention will be described in detail below with reference to the accompanying drawings.

[0040] It should be understood that the described embodiments are merely some, not all, of the embodiments of the present invention. All other embodiments obtained by those skilled in the art based on the embodiments of the present invention without inventive effort are within the scope of protection of the present invention.

[0041] The terminology used in the embodiments of this invention is for the purpose of describing particular embodiments only and is not intended to limit the invention. The singular forms “a,” “the,” and “the” as used in the embodiments of this invention and the appended claims are also intended to include the plural forms unless the context clearly indicates otherwise.

[0042] It should be understood that the term "and / or" used in this article is merely a description of the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A existing alone, A and B existing simultaneously, and B existing alone. Additionally, the character " / " in this article generally indicates that the preceding and following related objects have an "or" relationship.

[0043] Depending on the context, the word "if" as used here can be interpreted as "when," "when," "in response to determination," or "in response to detection." Similarly, depending on the context, the phrase "if determination" or "if detection (of the stated condition or event)" can be interpreted as "when determination," "in response to determination," "when detection (of the stated condition or event)," or "in response to detection (of the stated condition or event)."

[0044] The terms "first" and "second" used in the embodiments are merely to distinguish similar objects and do not represent a specific ordering of objects. It is understood that "first" and "second" can be interchanged in a specific order or sequence where permissible. It should be understood that the objects distinguished by "first" and "second" can be interchanged where appropriate so that the embodiments described herein can be implemented in orders other than those illustrated or described herein.

[0045] The specific embodiments of the present invention will be described in detail below with reference to the accompanying drawings.

[0046] This invention discloses a sorting method, apparatus, device, and readable storage medium for assigned services, aiming to solve the problem of low efficiency in existing assigned services.

[0047] The first embodiment of the present invention provides a sorting method for assigned services, which can be executed by a sorting device for assigned services (hereinafter referred to as the sorting device), and in particular by one or more processors within the sorting device, to achieve the following steps:

[0048] S101, Obtain service location information within a preset time period, and establish a service scatter map based on the service location information;

[0049] In this embodiment, the sorting device can be located on a terminal device (such as a smartphone, smartwatch, or other smart device). The sorting device can communicate with a server and access the server to obtain location information that needs to be served within a certain time period.

[0050] It should be noted that the server can store service location information for multiple time periods. The sorting device can communicate with the server and query the server to find multiple locations requiring on-site service within a certain area and time period. Based on the above information, a service scatter map is created. In this embodiment, for example... Figure 2 As shown, the service scatter map may include: a grid map. Figure 1 And obstacles 2 and target locations 3 generated on the grid map;

[0051] S102, Generate a first sub-path on the service scatter map according to the preset start and end points;

[0052] In this embodiment, a free-flowing location element can be randomly selected from each row of the grid map, so that an element is selected from each row. Since these elements are free grids, the selected element is a discontinuous movement line. The discontinuous movement line is then processed to become continuous until the first sub-movement line is generated. The length of the first sub-movement line is then calculated.

[0053] S103, change the starting point and ending point, and generate a second sub-path on the service scatter map based on the changed starting point and ending point;

[0054] In this embodiment, the user can change the starting point and the ending point multiple times. Each change will generate a corresponding second sub-path. The second sub-path can also be generated by first obtaining an intermittent path and then making the intermittent path continuous until the second sub-path is generated.

[0055] S104, obtain the fault tolerance information of the second sub-path, and generate the optimal sub-path 4 on the service scatter map based on the fault tolerance information, such as... Figure 3 As shown.

[0056] In this embodiment, the specific processing method is as follows:

[0057] Obtain the length values ​​of the first sub-path and the second sub-path;

[0058] When it is determined that the length of the second sub-travel line is greater than the length of the first sub-travel line, the error tolerance rate of the second sub-travel line is obtained; and it is determined whether the error tolerance rate of the second sub-travel line is greater than a preset value.

[0059] If so, define the second sub-path as the optimal path and maintain the second sub-path for path search;

[0060] If not, define the first sub-path as the optimal path and maintain the first sub-path for path searching.

[0061] It should be noted that in the existing technology, when it is determined that the length of the second sub-route is greater than the length of the first sub-route, the second sub-route will be directly discarded. This will result in the door-to-door route achieving local optimization in a certain area within a certain time period. However, local optimization does not mean global optimization. Sub-routes generated in this way may lead to low efficiency of nurses' door-to-door services.

[0062] In this embodiment, when it is determined that the length of the second sub-movement line is greater than the length of the first sub-movement line, a fault tolerance threshold can be randomly generated first. The fault tolerance threshold is a random number between [0,1]. If the fault tolerance rate is greater than the fault tolerance threshold, the information of the first sub-movement line is updated with the information of the second sub-movement line; otherwise, the second sub-movement line is abandoned, and the first sub-movement line is kept for searching.

[0063] Repeatedly iterate and compare each sub-path. Shorter paths are retained first, but for relatively long sub-paths, the fault tolerance probability is calculated. If the fault tolerance allows, appropriate replacements are retained. Then, the speed is reduced and the comparison of paths continues until the optimal complete path is output.

[0064] In this embodiment, the fault tolerance model for the second sub-path is as follows:

[0065] P = e -[E(n+1)-E(n)] / T(n) ;

[0066] Where P is the fault tolerance rate, E(n+1) is the length of the second sub-path, E(n) is the length of the first sub-path, and T(n) is the descent rate.

[0067] It should be noted that when E(n+1) < E(n), P = 1, and this transition is accepted (probability is 1), meaning the length of the second sub-path is less than the length of the first sub-path, and the path search continues along the second sub-path. When E(n+1) > E(n), P = e -[E(n+1)-E(n)] / T(n) If the length of the second sub-path is greater than the length of the first sub-path, it indicates that the system has deviated further from the global optimum. In this case, the fault tolerance model will not immediately discard it, but will perform a probabilistic operation. First, a uniformly distributed random number, i.e., the fault tolerance threshold, is generated in the interval [0,1]. If P is greater than the fault tolerance threshold, the transition is accepted; otherwise, the transition is rejected, and the process continues in a loop. The probability P is determined by the change in the length of the sub-path and T, so this value is dynamic.

[0068] To ensure convergence within a finite time, convergence parameters for the fault-tolerant model must be set. In the fault-tolerant model, the adjustable parameter is T. If T is too large, the energy will decrease too quickly, and the iteration will end when a local optimum is reached. If the value is too small, the computation time will increase. Therefore, controlling a suitable adjustment parameter T is crucial. Specifically, in this embodiment, a larger T value is used initially, and then gradually reduced as the energy decreases.

[0069] (1) Initially, the initial T(0) should be chosen high enough so that all transition states are accepted. The higher the initial sub-path, the greater the probability of obtaining a high-quality solution, but the longer it takes. Therefore, it is necessary to consider introducing an appropriate descent rate.

[0070] (2) Rate of descent. The descent pattern is exponential (because it is a probability problem, it needs to be between 0 and 1, hence the introduction of an exponential function):

[0071] T(n)=λT(n), n=1, 2, 3,....

[0072] Where T(n) is a positive number less than 1, typically ranging from 0.8 to 0.99. This ensures sufficient transition attempts for each descent, although exponential descent converges relatively slowly.

[0073] Please see Figure 4 The second embodiment of the present invention provides a sorting device for assigning services, comprising:

[0074] The service scatter map building unit 201 is used to obtain service location information within a preset time period and build a service scatter map based on the service location information.

[0075] The first sub-path generation unit 202 is used to generate a first sub-path on the service scatter map according to a preset starting point and ending point.

[0076] The second sub-path generation unit 203 is used to change the starting point and the ending point, and generate a second sub-path on the service scatter map according to the changed starting point and the ending point;

[0077] The optimal sub-trajectory generation unit 204 is used to obtain the fault tolerance information of the second sub-trajectory and generate the optimal sub-trajectory on the service scatter map according to the fault tolerance information.

[0078] Preferably, the optimal sub-path generation unit is specifically used for:

[0079] Obtain the length values ​​of the first sub-path and the second sub-path;

[0080] When it is determined that the length of the second sub-travel line is greater than the length of the first sub-travel line, the error tolerance rate of the second sub-travel line is obtained; and it is determined whether the error tolerance rate of the second sub-travel line is greater than a preset value.

[0081] If so, define the second sub-path as the optimal path and maintain the second sub-path for path search;

[0082] If not, define the first sub-path as the optimal path and maintain the first sub-path for path searching. Preferably, the fault tolerance model for the second sub-path is:

[0083] P = e -[E(n+1)-E(n)] / T(n) ;

[0084] Where P is the fault tolerance rate, E(n+1) is the length of the second sub-path, E(n) is the length of the first sub-path, and T(n) is the descent rate.

[0085] Preferably, the service scatter map includes: a grid map, and obstacles and target locations generated on the grid map.

[0086] A third embodiment of the present invention provides a sorting device for assigned services, including a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor. The processor executes the computer program to implement a sorting method for assigned services as described in any of the above embodiments.

[0087] The fourth embodiment of the present invention provides a readable storage medium storing a computer program, the computer program being executable by a processor of the device in which the computer-readable storage medium is located, to implement the sorting of an assignment service as described in any of the above embodiments.

[0088] Based on the sorting method, apparatus, device, and readable storage medium for dispatch services provided by this invention, the method obtains location information that needs to be served within a certain time period, establishes a service scatter map based on the location information, generates a corresponding first sub-path based on a preset start point and end point, changes the start point and end point multiple times, and generates a corresponding second sub-path based on each change, then obtains the fault tolerance information of each second sub-path, and generates an optimal sub-path based on the fault tolerance information. This solves the problem of low dispatch efficiency caused by the lack of global consideration in existing dispatch services.

[0089] Exemplary examples show that the computer program described in the third and fourth embodiments of the present invention can be divided into one or more modules, which are stored in the memory and executed by the processor to complete the present invention. The one or more modules can be a series of computer program instruction segments capable of performing specific functions, which describe the execution process of the computer program in the sorting device implementing an assignment service. For example, the apparatus described in the second embodiment of the present invention.

[0090] The processor referred to can be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. A general-purpose processor can be a microprocessor or any conventional processor. This processor is the control center of a service assignment sequencing method, connecting various parts of the implementation of the service assignment sequencing method using various interfaces and lines.

[0091] The memory can be used to store the computer programs and / or modules. The processor implements various functions of a service assignment sorting method by running or executing the computer programs and / or modules stored in the memory and calling data stored in the memory. The memory may mainly include a program storage area and a data storage area. The program storage area may store the operating system, at least one application program required for a function (such as sound playback function, text conversion function, etc.), etc.; the data storage area may store data created according to the use of the mobile phone (such as audio data, text message data, etc.). In addition, the memory may include high-speed random access memory, and may also include non-volatile memory, such as hard disk, memory, plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, at least one disk storage device, flash memory device, or other volatile solid-state storage device.

[0092] If the implemented module is implemented as a software functional unit and sold or used as an independent product, it can be stored in a computer-readable storage medium. Based on this understanding, all or part of the processes in the above embodiments of the present invention can also be implemented by a computer program instructing related hardware. The computer program can be stored in a computer-readable storage medium, and when executed by a processor, it can implement the steps of the various method embodiments described above. The computer program includes computer program code, which can be in the form of source code, object code, executable files, or certain intermediate forms. The computer-readable medium can include: any entity or device capable of carrying the computer program code, recording media, USB flash drives, portable hard drives, magnetic disks, optical disks, computer memory, read-only memory (ROM), random access memory (RAM), electrical carrier signals, telecommunication signals, and software distribution media, etc. It should be noted that the content included in the computer-readable medium can be appropriately added or removed according to the requirements of legislation and patent practice in the jurisdiction. For example, in some jurisdictions, according to legislation and patent practice, computer-readable media do not include electrical carrier signals and telecommunication signals.

[0093] It should be noted that the device embodiments described above are merely illustrative. The units described as separate components may or may not be physically separate, and the components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the modules can be selected to achieve the purpose of this embodiment according to actual needs. Furthermore, in the accompanying drawings of the device embodiments provided by this invention, the connection relationships between modules indicate that they have communication connections, which can be specifically implemented as one or more communication buses or signal lines. Those skilled in the art can understand and implement this without any creative effort.

[0094] The above description is merely a preferred embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in the present invention should be included within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

1. A method for sorting assigned services, characterized in that, include: Obtain service location information within a preset time period, and create a service scatter map based on the service location information; Based on the preset start and end points, a first sub-movement line is generated on the service scatter map; wherein, a smooth location element is randomly selected from each row of the grid map, so that an element is selected from each row. Since these elements are free grids, the selected element is a discontinuous movement line. Then, the discontinuous movement line is processed to be made continuous until the first sub-movement line is generated. Change the starting point and ending point, and generate a second sub-path on the service scatter map based on the changed starting point and ending point; Obtain the fault tolerance information of the second sub-travel, and generate the optimal sub-travel on the service scatter map based on the fault tolerance information; wherein, obtaining the fault tolerance information of the second sub-travel and generating the optimal sub-travel on the service scatter map based on the fault tolerance information specifically involves: Obtain the length values ​​of the first sub-path and the second sub-path; When it is determined that the length of the second sub-movement line is greater than the length of the first sub-movement line, the fault tolerance rate of the second sub-movement line is obtained; and it is determined whether the fault tolerance rate of the second sub-movement line is greater than a preset value. If so, define the second sub-path as the optimal path and maintain the second sub-path for path search; If not, define the first sub-path as the optimal path and maintain the first sub-path for path search; the fault tolerance model for the second sub-path is as follows: P=e -[E(n+1)-E(n)] / T(n) ; Where P is the fault tolerance rate, E(n+1) is the length of the second sub-path, E(n) is the length of the first sub-path, and T(n) is the descent rate; initially, a larger T(n) value is used, and as the energy decreases, the T(n) value is gradually reduced.

2. The sorting method for assigned services according to claim 1, characterized in that, The service scatter map includes: a grid map, and the locations of obstacles and targets generated on the grid map.

3. A sorting device for assigning services, characterized in that, include: A service scatter map building unit is used to acquire service location information within a preset time period and build a service scatter map based on the service location information. The first sub-path generation unit is used to generate a first sub-path on the service scatter map according to a preset start point and end point. The second sub-travel generation unit is used to change the starting point and the ending point, and generate a second sub-travel on the service scatter map according to the changed starting point and the ending point; An optimal sub-trajectory generation unit is used to obtain the fault tolerance information of the second sub-trajectory and generate an optimal sub-trajectory on the service scatter map based on the fault tolerance information; wherein, the optimal sub-trajectory generation unit is specifically used for: Obtain the length values ​​of the first sub-path and the second sub-path; When it is determined that the length of the second sub-movement line is greater than the length of the first sub-movement line, the fault tolerance rate of the second sub-movement line is obtained; and it is determined whether the fault tolerance rate of the second sub-movement line is greater than a preset value. If so, define the second sub-path as the optimal path and maintain the second sub-path for path search; If not, define the first sub-path as the optimal path and maintain the first sub-path for path search; the fault tolerance model for the second sub-path is as follows: P=e -[E(n+1)-E(n)] / T(n) ; Where P is the fault tolerance rate, E(n+1) is the length of the second sub-path, E(n) is the length of the first sub-path, and T(n) is the descent rate; initially, a larger T(n) value is used, and as the energy decreases, the T(n) value is gradually reduced.

4. The sorting device for assigning services according to claim 3, characterized in that, The service scatter map includes: a grid map, and the locations of obstacles and targets generated on the grid map.

5. A sorting device for assigning services, characterized in that, It includes a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, the processor executing the computer program to implement a sorting method for assigning services as described in any one of claims 1 to 2.

6. A readable storage medium, characterized in that, The device contains a computer program that can be executed by a processor of the device in which the computer-readable storage medium is located, to implement the sorting of an assignment service as described in any one of claims 1 to 2.

Images