CN113947242A

CN113947242A - Method, device and equipment for sequencing assignment services and readable storage medium

Info

Publication number: CN113947242A
Application number: CN202111190202.3A
Authority: CN
Inventors: 皇甫潇潇; 施建安; 庄一波; 洪梅; 林家彬
Original assignee: Xiamen Yilianzhong Yihui Technology Co ltd
Current assignee: Xiamen Yilianzhong Yihui Technology Co ltd
Priority date: 2021-10-13
Filing date: 2021-10-13
Publication date: 2022-01-18

Abstract

The invention provides a sequencing method, a sequencing device, equipment and a readable storage medium of assignment service, wherein the method comprises the following steps: acquiring service location information in a preset time period, and establishing a service scatter map according to the service location information; generating a first sub-action line on the service scatter map according to a preset starting point and a preset end point; changing the starting point and the end point, and generating a second sub-action line on the service scatter point map according to the changed starting point and end point; and acquiring fault-tolerant information of the second sub-action line, and generating an optimal sub-action line in the service scatter map according to the fault-tolerant information. The problem of current assignment service not carry out global consideration, lead to assigning inefficiency is solved.

Description

Method, device and equipment for sequencing assignment services and readable storage medium

Technical Field

The present invention relates to the field of global optimization, and in particular, to a method, an apparatus, a device, and a readable storage medium for ordering assignment services.

Background

In the care industry, when a nurse attends to a visiting service (or other industries involve the visiting service), the nurse needs to go to the home of a patient to perform a specific visiting service. When a nurse serves a plurality of patients on a day, it is important to optimize the traveling line of the nurse's service site and the design of the service visiting sequence so that the nurse maximizes the service efficiency in the same time. If the service locations and sequence are determined blindly by human subjectively, the round-trip routes of different service locations are repeated, and the waste of time and traffic cost is caused. The traditional thinking mode only considers whether the result is optimal before and after the adjacent action line, but the result can cause the 'current situation to be neglected', namely the result is only locally optimal and lacks global thinking, and the service efficiency is reduced.

In view of this, the present application is presented.

Disclosure of Invention

The invention discloses a sorting method, a sorting device, equipment and a readable storage medium of assignment services, and aims to solve the problem of low efficiency of the existing assignment services.

A first embodiment of the present invention provides a method for ordering assignment services, including:

acquiring service location information in a preset time period, and establishing a service scatter map according to the service location information;

generating a first sub-action line on the service scatter map according to a preset starting point and a preset end point;

changing the starting point and the end point, and generating a second sub-action line on the service scatter point map according to the changed starting point and end point;

and acquiring fault-tolerant information of the second sub-action line, and generating an optimal sub-action line in the service scatter map according to the fault-tolerant information.

Preferably, the step of obtaining the fault-tolerant information of the second sub-action line and generating the optimal sub-action line in the service scatter plot map according to the fault-tolerant information specifically comprises:

acquiring the length value of the first sub-moving line and the length value of the second sub-moving line;

when the length value of a second sub-moving line is judged to be larger than the length value of the first sub-moving line, acquiring the fault tolerance rate of the second sub-moving line; judging whether the fault tolerance of the second sub-moving line is larger than a preset value or not;

if so, defining the second sub-moving line as the optimal moving line, and keeping the second sub-moving line to perform path search;

if not, defining the first sub-moving line as the optimal moving line, and keeping the first sub-moving line to perform path search. Preferably, the fault tolerance of the second sub-action line is modeled as:

P＝e^{-[E(n+1)-E(n)]/T(n)}；

wherein, P is the fault tolerance, E (n +1) is the length of the second sub-active line, E (n) is the length of the first sub-active line, and T (n) is the descent rate.

Preferably, the service scatter map comprises: the system comprises a grid map and obstacles and target positions generated on the grid map.

A second embodiment of the present invention provides a sorting apparatus for assigning services, including:

the service scatter map establishing unit is used for acquiring service place information in a preset time period and establishing a service scatter map according to the service place information;

the first sub-action line generating unit is used for generating a first sub-action line on the service scatter map according to a preset starting point and a preset end point;

the second sub-action line generating unit is used for changing the starting point and the end point and generating a second sub-action line on the service scatter point map according to the changed starting point and end point;

and the optimal sub-action line generating unit is used for acquiring the fault-tolerant information of the second sub-action line and generating the optimal sub-action line in the service scatter map according to the fault-tolerant information.

Preferably, the optimal sub-action line generating unit is specifically configured to:

P＝e^{-[E(n+1)-E(n)]/T(n)}；

A third embodiment of the present invention provides a sorting apparatus for assignment services, including a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein the processor executes the computer program to implement a sorting method for assignment services as described in any one of the above.

A fourth embodiment of the invention provides a readable storage medium storing a computer program executable by a processor of a device in which the computer readable storage medium is located to implement a ranking of assignment services as described in any one of the above.

Based on the sequencing method, the sequencing device, the sequencing equipment and the readable storage medium of the assignment service provided by the invention, the problem of low assignment efficiency caused by the fact that the existing assignment service is not considered globally is solved by acquiring the place information needing service in a certain time period, establishing a service scatter map according to the place information, generating a corresponding first sub-action line according to a preset starting point and a preset end point, changing the starting point and the end point for multiple times, generating a corresponding second sub-action line according to each change, then acquiring the fault-tolerant information of each second sub-action line and generating an optimal sub-action line according to the fault-tolerant information.

Drawings

FIG. 1 is a flowchart illustrating a method for ordering assignment services according to a first embodiment of the present invention;

FIG. 2 is a schematic view of a service scatter map provided by the present invention;

FIG. 3 is a schematic diagram of an optimal sub-action line provided by the present invention;

fig. 4 is a block diagram of a sorting apparatus for assigning services according to a second embodiment of the present invention.

Detailed Description

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

For better understanding of the technical solutions of the present invention, the following detailed descriptions of the embodiments of the present invention are provided with reference to the accompanying drawings.

It should be understood that the described embodiments are only some embodiments of the invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.

The terminology used in the embodiments of the invention is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used in the examples of the present invention and the appended claims, the singular forms "a," "an," and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.

It should be understood that the term "and/or" as used herein is merely one type of association that describes an associated object, meaning that three relationships may exist, e.g., a and/or B may mean: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.

The word "if" as used herein may be interpreted as "at … …" or "when … …" or "in response to a determination" or "in response to a detection", depending on the context. Similarly, the phrases "if determined" or "if detected (a stated condition or event)" may be interpreted as "when determined" or "in response to a determination" or "when detected (a stated condition or event)" or "in response to a detection (a stated condition or event)", depending on the context.

In the embodiments, the references to "first \ second" are merely to distinguish similar objects and do not represent a specific ordering for the objects, and it is to be understood that "first \ second" may be interchanged with a specific order or sequence, where permitted. It should be understood that "first \ second" distinct objects may be interchanged under appropriate circumstances such that the embodiments described herein may be practiced in sequences other than those illustrated or described herein.

The following detailed description of specific embodiments of the invention refers to the accompanying drawings.

A first embodiment of the present invention provides a method for ordering assigned services, which is performed by an ordering apparatus (hereinafter, abbreviated as ordering apparatus) for assigned services, and in particular, by one or more processors in the ordering apparatus, so as to implement the following steps:

s101, acquiring service location information in a preset time period, and establishing a service scatter map according to the service location information;

in this embodiment, the ordering device may be located in a terminal device (such as a smart phone, a smart watch, or other smart devices), where the ordering device may communicate with a server, and may access the server to obtain location information that needs to be served in a certain time period.

It should be noted that the server may store service location information in a plurality of time periods, the sorting device may communicate with the server, may query the server for the presence of a plurality of location information that needs to be visited in a certain time period in a certain area, and establish a service scatter plot map according to the above information, in this embodiment, as shown in fig. 2, the service scatter plot map may include: a grid map 1, and an obstacle 2 and a target position 3 generated on the grid map;

s102, generating a first sub-action line on the service scatter map according to a preset starting point and a preset end point;

in this embodiment, a smooth position element may be randomly taken out from each line of the grid map, so that each line has one element, and since the elements are all free grids, an intermittent moving line is obtained after selection, and then the intermittent moving line is subjected to continuous processing until a first sub moving line is generated, and then length calculation is performed on the first sub moving line.

S103, changing a starting point and an end point, and generating a second sub-action line on the service scatter plot map according to the changed starting point and end point;

in this embodiment, a user may generate a corresponding second sub-moving line through changing the start point and the end point for multiple times, where the second sub-moving line may also be formed by obtaining an intermittent moving line first, and then performing continuous processing on the intermittent moving line until the second sub-moving line is generated.

S104, acquiring fault tolerance information of the second sub-action line, and generating an optimal sub-action line 4 in the service scatter plot map according to the fault tolerance information, as shown in FIG. 3.

In this embodiment, the specific processing manner is as follows:

if not, defining the first sub-moving line as the optimal moving line, and keeping the first sub-moving line to perform path search.

It should be noted that, in the prior art, when it is determined that the length value of the second sub-action line is greater than the length value of the first sub-action line, the second sub-action line is directly discarded, so that the local optimum is realized for the visiting route in a certain time period in the area, but the local optimum does not represent the global optimum, and the sub-action line generated in this way may cause a problem of low efficiency of the visiting service of a nurse.

In this embodiment, when it is determined that the length value of the second sub-action line is greater than the length value of the first sub-action line, a fault-tolerant threshold may be randomly generated first, where the fault-tolerant threshold is a random number between [0,1], and if the fault-tolerant rate is greater than the fault-tolerant threshold, the information of the first sub-action line is updated by using the information of the second sub-action line, otherwise, the second sub-action line is abandoned, and the first sub-action line is kept for searching.

And repeating iterative loop comparison on each sub-moving line, preferentially reserving the moving line with a short path, performing fault-tolerant probability calculation on the relatively long sub-moving line, moderately reserving and replacing the sub-moving line under the condition of fault tolerance permission, and continuing to perform speed reduction loop comparison on the moving lines until the optimal complete moving line is output.

In this embodiment, the fault tolerance of the second sub-action line is modeled as follows:

P＝e^{-[E(n+1)-E(n)]/T(n)}；

It should be noted that when E (n +1) < E (n), P ═ 1 is accepted (probability is 1), that is, the length of the second sub-action line is smaller than that of the first sub-action line, the second sub-action line is kept for path search, and when E (n +1) > E (n), P ═ E^{-[E(n+1)-E(n)]/T(n)}(ii) a Namely the secondThe fact that the length of the sub-action line is larger than that of the first sub-action line indicates that the system deviates farther from the global optimal value position, and at the moment, the fault tolerance model does not discard the sub-action line immediately but performs probability operation. First in the interval [0,1]]And generating a random number which is uniformly distributed, namely a fault-tolerant threshold, if P is larger than the fault-tolerant threshold, accepting the transfer, otherwise, refusing the transfer, and entering the next step to repeat the cycle. Where P determines the magnitude of the probability P by the amount of change in the length of the sub-action line and T, so this value is dynamic.

In order to ensure convergence in a limited time, a convergence parameter of a model for controlling the fault tolerance rate must be set, in the fault tolerance rate model, a parameter that can be adjusted is T, if T is too large, energy degradation is too fast, iteration is finished when a local optimal value is reached, and if a value is small, calculation time is increased, so that it is very critical to control a suitable adjustment parameter T, specifically, in the present embodiment, a large value of T is used in the initial stage, and is gradually reduced as energy degradation progresses.

(1) Initially, the initial T (0) should be chosen high enough that all transition states are accepted, the higher the initial subaction, the greater the probability of obtaining a high quality solution, and the longer it takes. So that optimization considerations introduce a suitable rate of descent.

(2) The rate of decrease. The descent mode is exponential (since it is a probability problem, it needs to be between 0 and 1, so an exponential function is introduced) descent:

T(n)＝λT(n)，n＝1，2，3，....

where T (n) is a positive number less than 1, typically between 0.8 and 0.99. So that for each descent there are enough transition attempts and the convergence rate of the exponential descent is slow.

Referring to fig. 4, a second embodiment of the present invention provides a sorting apparatus for assigning services, including:

a service scatter map establishing unit 201, configured to acquire service location information in a preset time period, and establish a service scatter map according to the service location information;

a first sub-action line generating unit 202, configured to generate a first sub-action line on the service scatter map according to a preset starting point and a preset ending point;

a second sub-action line generating unit 203, configured to change the starting point and the end point, and generate a second sub-action line on the service scatter plot map according to the changed starting point and end point;

and an optimal sub-action line generating unit 204, configured to obtain fault-tolerant information of the second sub-action line, and generate an optimal sub-action line in the service scatter map according to the fault-tolerant information.

P＝e^{-[E(n+1)-E(n)]/T(n)}；

Illustratively, the computer programs described in the third and fourth embodiments of the present invention may be partitioned into one or more modules, which are stored in the memory and executed by the processor to implement the present invention. The module or modules may be a series of computer program instruction segments capable of performing specific functions, which are used to describe the execution of the computer program in the sorting device implementing a sort of assignment service. For example, the device described in the second embodiment of the present invention.

The Processor may be a Central Processing Unit (CPU), other general purpose Processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), an off-the-shelf Programmable Gate Array (FPGA) or other Programmable logic device, discrete Gate or transistor logic, discrete hardware components, etc. The general purpose processor may be a microprocessor or the processor may be any conventional processor or the like, the processor being the control center for the sequencing method of assignment services, the various interfaces and lines connecting the various parts of the overall implementation implementing the sequencing method of assignment services.

The memory may be used to store the computer programs and/or modules, and the processor may implement the various functions of a sequencing method for a dispatch service by running or executing the computer programs and/or modules stored in the memory and calling the data stored in the memory. The memory may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required by at least one function (such as a sound playing function, a text conversion function, etc.), and the like; the storage data area may store data (such as audio data, text message data, etc.) created according to the use of the cellular phone, etc. In addition, the memory may include high speed random access memory, and may also include non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), at least one magnetic disk storage device, a Flash memory device, or other volatile solid state storage device.

Wherein the implemented module, if implemented in the form of a software functional unit and sold or used as a stand-alone product, can be stored in a computer readable storage medium. Based on such understanding, all or part of the flow of the method according to the embodiments of the present invention may also be implemented by a computer program, which may be stored in a computer-readable storage medium, and when the computer program is executed by a processor, the steps of the method embodiments may be implemented. Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, usb disk, removable hard disk, magnetic disk, optical disk, computer Memory, Read-Only Memory (ROM), Random Access Memory (RAM), electrical carrier wave signals, telecommunications signals, software distribution medium, and the like. It should be noted that the computer readable medium may contain content that is subject to appropriate increase or decrease as required by legislation and patent practice in jurisdictions, for example, in some jurisdictions, computer readable media does not include electrical carrier signals and telecommunications signals as is required by legislation and patent practice.

It should be noted that the above-described device embodiments are merely illustrative, where the units described as separate parts may or may not be physically separate, and the parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. In addition, in the drawings of the embodiment of the apparatus provided by the present invention, the connection relationship between the modules indicates that there is a communication connection between them, and may be specifically implemented as one or more communication buses or signal lines. One of ordinary skill in the art can understand and implement it without inventive effort.

The above description is only for the preferred embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.

Claims

1. A method for ordering assigned services, comprising:

2. The method according to claim 1, wherein the step of obtaining fault tolerance information of the second sub-routine and generating the optimal sub-routine on the service scatter plot map according to the fault tolerance information comprises:

3. The method according to claim 1, wherein the fault tolerance of the second sub-action line is modeled as:

P＝e^{-[E(n+1)-E(n)]/T(n)}；

4. The method of claim 1, wherein the service scatter map comprises: the system comprises a grid map and obstacles and target positions generated on the grid map.

5. An apparatus for ordering assigned services, comprising:

6. The sequencing apparatus for assignment services according to claim 5, wherein the optimal sub-action line generating unit is specifically configured to:

7. The apparatus according to claim 5, wherein the fault tolerance of the second sub-action line is modeled as:

P＝e^{-[E(n+1)-E(n)]/T(n)}；

8. The apparatus of claim 5, wherein the service scatter map comprises: the system comprises a grid map and obstacles and target positions generated on the grid map.

9. An ordering apparatus for assigning services, comprising 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 an ordering method for assigning services according to any one of claims 1 to 4.

10. A readable storage medium, in which a computer program is stored, the computer program being executable by a processor of a device in which the computer readable storage medium is located to implement a ranking of assignment services according to any of claims 1 to 4.