CN111221508B - Service path design method, design device, electronic equipment and storage medium - Google Patents
Service path design method, design device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN111221508B CN111221508B CN201911115038.2A CN201911115038A CN111221508B CN 111221508 B CN111221508 B CN 111221508B CN 201911115038 A CN201911115038 A CN 201911115038A CN 111221508 B CN111221508 B CN 111221508B
- Authority
- CN
- China
- Prior art keywords
- service
- resource
- last node
- target
- task
- 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
- 238000000034 method Methods 0.000 title claims abstract description 49
- 238000013461 design Methods 0.000 title claims abstract description 36
- 230000008901 benefit Effects 0.000 claims abstract description 118
- PCHJSUWPFVWCPO-UHFFFAOYSA-N gold Chemical compound [Au] PCHJSUWPFVWCPO-UHFFFAOYSA-N 0.000 claims description 11
- 239000010931 gold Substances 0.000 claims description 11
- 229910052737 gold Inorganic materials 0.000 claims description 11
- 238000012545 processing Methods 0.000 claims description 9
- 238000004590 computer program Methods 0.000 claims description 7
- 238000004891 communication Methods 0.000 claims description 5
- 230000009286 beneficial effect Effects 0.000 abstract description 2
- 230000008569 process Effects 0.000 description 13
- 238000010586 diagram Methods 0.000 description 9
- 235000013311 vegetables Nutrition 0.000 description 9
- 238000012360 testing method Methods 0.000 description 5
- 238000012938 design process Methods 0.000 description 4
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 238000004422 calculation algorithm Methods 0.000 description 2
- 239000003337 fertilizer Substances 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000000007 visual effect Effects 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000001680 brushing effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000008676 import Effects 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
- 239000002689 soil Substances 0.000 description 1
- 239000000126 substance Substances 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/20—Software design
-
- A—HUMAN NECESSITIES
- A63—SPORTS; GAMES; AMUSEMENTS
- A63F—CARD, BOARD, OR ROULETTE GAMES; INDOOR GAMES USING SMALL MOVING PLAYING BODIES; VIDEO GAMES; GAMES NOT OTHERWISE PROVIDED FOR
- A63F13/00—Video games, i.e. games using an electronically generated display having two or more dimensions
- A63F13/60—Generating or modifying game content before or while executing the game program, e.g. authoring tools specially adapted for game development or game-integrated level editor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Abstract
The embodiment of the application provides a business path design method, a design device, electronic equipment and a storage medium, wherein the method comprises the following steps: acquiring a task service set, a resource pool set corresponding to a target user and expected benefits of the service; selecting a plurality of task services reaching the expected benefits of the service from the task service set, and combining the plurality of task services to obtain a plurality of service paths reaching the expected benefits of the service; analyzing the total amount of resources consumed by each service path, and comparing the total amount of resources consumed by each service path with a resource pool set corresponding to the target user to obtain a target service path in the plurality of service paths; prompting to execute the target service path to acquire the expected benefits of the service. The embodiment of the application is beneficial to improving the efficiency of the service path design, thereby improving the user experience.
Description
Technical Field
The present application relates to the field of business processing technologies, and in particular, to a business path design method, a design apparatus, an electronic device, and a storage medium.
Background
At present, in order to achieve a certain business purpose, a business process is required to be executed according to a business path preset by a user so as to achieve the business purpose; when there are multiple alternatives for the business process, multiple alternative business paths exist to achieve the business goal. Some of the many alternative approaches are not suitable for accomplishing this business purpose. For example, if the employee wants to ask for his or her leave, he or she needs to go to the primary leader, the secondary leader, and the tertiary leader permit a leave in order, and the tertiary leader is composed of a director, a manager, and a manager, only any one of the tertiary leaders permit a leave can pass through, so there are many alternative ways for the employee to ask for his or her leave. However, if the leave flow is set to require the board-board permit a leave, the design of the path is not reasonable because the board-board is busy and there is no time permit a leave. For example, in a game, a developer designs a plurality of game growth lines for the purpose of the game, but a part of the game growth lines require a large amount of game resources (e.g., game medals) or a large amount of growth time (e.g., long-time copy brushing) so that the part of the game growth lines do not meet the actual needs of the user, and the game growth lines are unreasonable.
Therefore, when the service is developed, the design mode of the service path is single, the actual condition of the service is not considered, and the problem of unreasonable service path frequently occurs.
Disclosure of Invention
The embodiment of the application provides a service path design method, a design device, electronic equipment and a storage medium, which are used for rapidly designing an optimal service path for achieving expected benefits of service according to the existing resource pool set of a target user, so that user experience is improved.
In a first aspect, an embodiment of the present application provides a service path design method, including:
Acquiring a task service set, a resource pool set corresponding to a target user and expected benefits of the service;
Selecting a plurality of task services reaching the expected benefits of the service from the task service set, and combining the plurality of task services to obtain a plurality of service paths reaching the expected benefits of the service;
Analyzing the total amount of resources consumed by each service path, and comparing the total amount of resources consumed by each service path with a resource pool set corresponding to the target user to obtain a target service path in the plurality of service paths;
Prompting to execute the target service path to acquire the expected benefits of the service.
In a second aspect, an embodiment of the present application provides a service path design apparatus, including:
the acquisition unit is used for acquiring the task service set, the resource pool set corresponding to the target user and the expected benefits of the service;
The processing unit is used for selecting a plurality of task services reaching the expected benefits of the service from the task service set, and combining the plurality of task services to obtain a plurality of service paths reaching the expected benefits of the service;
the comparison unit is used for analyzing the total amount of resources consumed by each service path, and comparing the total amount of resources consumed by each service path with the resource pool set corresponding to the target user to obtain a target service path in the plurality of service paths;
And the prompting unit is used for prompting the execution of the target service path so as to acquire the expected benefits of the service.
In a third aspect, an embodiment of the present application provides an electronic device comprising a processor, a memory, a communication interface, and one or more programs, wherein the one or more programs are stored in the memory and configured to be executed by the processor, the programs comprising instructions for performing the steps in the method according to the first aspect.
In a fourth aspect, embodiments of the present application provide a computer-readable storage medium storing a computer program that causes a computer to perform the method according to the first aspect.
In a fifth aspect, embodiments of the present application provide a computer program product comprising a non-transitory computer readable storage medium storing a computer program, the computer being operable to cause a computer to perform the method according to the first aspect.
The embodiment of the application has the following beneficial effects:
It can be seen that, in the embodiment of the present application, a task service set and expected benefits of a service corresponding to a target user may be input in advance, and multiple service paths are automatically designed for achieving the expected benefits of the service through the task service set, so that efficiency of service path design is improved; and the target service path is selected from the plurality of service paths according to the existing resource pool set of the target user, so that the selection of the optimal service path for achieving the expected benefits of the service is facilitated, the plurality of service paths do not need to be tested one by the input of manpower, the manpower resources are saved, and the user experience is further improved.
Drawings
Fig. 1A is a schematic view of a service path design according to an embodiment of the present application;
FIG. 1B is a schematic diagram of a service path design according to an embodiment of the present application;
FIG. 1C is a schematic diagram of a virtual game character growth path according to an embodiment of the present application;
Fig. 2A is a schematic flow chart of a service path design according to an embodiment of the present application;
FIG. 2B is a schematic diagram of a virtual game character growth process according to an embodiment of the present application;
fig. 2C is a schematic diagram of service path expansion according to an embodiment of the present application;
FIG. 3A is a flow chart of another business path design according to an embodiment of the present application;
FIG. 3B is a schematic diagram of another virtual game character growth process according to an embodiment of the present application;
Fig. 4 is a schematic structural diagram of a service path design device according to an embodiment of the present application;
Fig. 5 is a functional unit composition block diagram of a service path design apparatus according to an embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and fully with reference to the accompanying drawings, in which it is evident that the embodiments described are some, but not all embodiments of the application. All other embodiments, which can be made by those skilled in the art based on the embodiments of the application without making any inventive effort, are intended to be within the scope of the application.
The terms "first," "second," "third," and "fourth" and the like in the description and in the claims and drawings are used for distinguishing between different objects and not necessarily for describing a particular sequential or chronological order. Furthermore, the terms "comprise" and "have," as well as any variations thereof, are intended to cover a non-exclusive inclusion. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those listed steps or elements but may include other steps or elements not listed or inherent to such process, method, article, or apparatus.
Reference herein to "an embodiment" means that a particular feature, result, or characteristic described in connection with the embodiment may be included in at least one embodiment of the application. The appearances of such phrases in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Those of skill in the art will explicitly and implicitly appreciate that the embodiments described herein may be combined with other embodiments.
For the understanding of the present application, some of the terms involved in the present application will be explained first.
Gaming the growth line: within the game, predetermined steps are set for achieving the game target.
Directed graph: a directed graph refers to an ordered triplet (V (D), a (D), ψd), where ψd is an association function that corresponds each element (directed edge or arc) in a (D) to an ordered element (vertex or point) pair in V (D).
And (3) optimal solution: the best solution that can be achieved without sacrificing any overall goal and individual goals; because the globally optimal solution is difficult to calculate, a locally optimal solution is also often used instead of the globally optimal solution.
Fig. 1A is a schematic view of a service path design according to an embodiment of the present application, including: a user terminal 100 and a traffic path designing apparatus 200. As shown in fig. 1B, the traffic path designing apparatus 200 has a function of expanding a hierarchical directed graph (i.e., directed acyclic graph) layer by layer based on an Entity-redemption model (Entity-Trade). The user terminal 100 transmits a task service set to the user terminal; the service path design device 200 firstly converts the task service set to obtain data conforming to a set format, and introduces a plurality of converted task services and resource pool sets into an Entity-Trade model; in addition, the service path design device 200 receives the expected benefits of the service and the resource pool set corresponding to the target user sent by the user terminal 100 through the interface of the system database, and imports the expected benefits of the service into the Entity-Trade model, and plans a plurality of service paths for achieving the expected benefits of the service by using the Entity-Trade model; finally, a target traffic path (optimal traffic path) is selected from the plurality of traffic paths using the set of resource pools.
It can be seen that in the embodiment of the application, task services are input in advance, and a plurality of service paths are automatically designed for achieving expected benefits of the services based on the task services, so that the efficiency of service path design is improved; and the target service path is selected from the plurality of service paths according to the owned resource pool set, so that the optimal service path is selected for achieving the expected benefits of the service, and the user experience is improved.
The design process of the service path is first described by taking the design process of the virtual game character as a long line.
It will be appreciated that the set of task services is a set of escalation rules corresponding to the virtual game character, and that the expected benefits of the services include the target level of the virtual game character, the type of prop, the number of each prop, the medal of game, etc., wherein the prop includes weapon type, weapon attribute, pendant type, etc.
Therefore, according to the expected benefits of the service and the task service set, a previous upgrade rule capable of being upgraded to the expected benefits of the service is selected, the type of resources consumed when the previous upgrade rule is used for upgrading and the quantity of each resource are obtained, and then the previous upgrade rule capable of being upgraded to the previous upgrade rule is selected from the task service set; and by analogy, obtaining the upgrading rule under each level, the type of the resource required by each upgrading rule and the quantity of each resource. Until the consumed resource is a set basic resource (such as primary tokens, physical strength, props, etc.), a plurality of growth routes corresponding to the expected benefit (growth line target) are obtained, each growth route being composed of respective upgrade rules.
As shown in FIG. 1C, the expected benefits of the business are upgrading the virtual game character to level 18, obtaining a bank Wu Peijian and upgrading the saber's attack to 150, obtaining a secondary head in the saber, a speed boot, and obtaining a 1W gold coin. The expected benefits of achieving the service from the pre-input task service set (upgrading rule) can be obtained by opening the common copy or opening the advanced copy. Thus, the expected benefits of the business can be achieved through route 1 and route 2 shown in fig. 1C. And finally, sequentially expanding forwards to obtain upgrading rules under each level, so as to obtain a plurality of growing lines reaching expected benefits of the service.
Further, each growing route can be represented by a multi-element linear equation, and finally, the multi-element linear equation corresponding to each growing route is solved and approximated by an exploration algorithm, so that the quantity of consumed basic resources of each growing route and the growing time corresponding to each growing route are obtained; finally, a target growth route (optimal growth route) is selected from the plurality of growth routes according to preset growth limiting conditions, wherein the growth limiting conditions comprise: one or more of a shortest growing time, a minimum total consumption of resources, a minimum consumption of a certain resource, and a degree of matching with a set of resource pools that are currently owned.
It can be seen that, in the embodiment of the present application, an optimal growth route can be automatically obtained for the growth route target of the virtual game character, thereby simplifying the design process of the game growth route; in addition, the optimal growth route has short growth time or low resource consumption, so that the problem of unreasonable growth route design is avoided.
And then taking greenhouse vegetable cultivation as an illustration of the design process of the business path.
It can be understood that the task business set is a plurality of growth rules of vegetables, for example, the growth rules can be x kg of chemical fertilizer application and y kg of watering, and the vegetables can grow z g; the expected benefits of the business include weight, maturity, freshness, yield, reject rate, etc. of the vegetables.
Therefore, according to the expected benefits of the service and the task service set, a superior growth rule which can grow to the expected benefits of the service is selected, the type of resources and the quantity of each resource which are consumed when the vegetables are cultivated by using the superior growth rule are obtained, and then the superior growth rule which is used when growing to the type of the consumed resources and the quantity of each resource is selected from the task service set; and by analogy, obtaining the growth rule under each level, the type of the resources required by each growth rule and the quantity of each resource. Until the consumed resources are set basic resources (such as artificial fertilizer, soil environment, vegetable seedlings, etc.), a plurality of growing routes corresponding to the expected benefits (growing line targets) are obtained.
Finally, the types and the quantity of the basic resources required by each growth route are used for comparing with the existing resource sets to obtain a target growth route; then, the target growth route is used for cultivating the vegetables, so that the vegetables can reach expected business benefits according to the optimal growth route, and further the yield, growth speed and yield of the vegetables can be improved, and user experience is improved.
Fig. 2A is a flow chart of a method for designing a service path according to an embodiment of the present application, where the method includes but is not limited to the following steps:
201: and acquiring the task service set, a resource pool set corresponding to the target user and expected benefits of the service.
When the target user is a virtual game character, the task service in the task service set is a growth rule (upgrading rule) of the virtual game character.
For example, in the game of "wait soul is hazy and say" 5 points of physical effort and 5 keys can be made once for magic copy in deep-in-the-word, after the copy is made, 8 magic ember props and 2 ten thousand gold coins can be obtained, and then the growth rule is converted into the Entity-Trade model to be expressed as: trade name: magic world deep-drawing, growth rule: cost: physical strength 5 and key 5, gain: magic embers 8 and gold 20000.
Wherein the expected benefits of the service are the targets set by the user and needed to be achieved. For example, 24 magic ember props set by the user in the game of soul, haze and month legend are expected benefits of business.
Wherein the resource set is a currently owned resource set. For example, a user currently has 20 physical strength, 20 keys and one thousand gold coins in a "soul-off legend" game, and then takes 20 physical strength and 20 keys and one thousand gold coin as a resource set of a target user.
202: And selecting a plurality of task services reaching the expected benefits of the service from the task service set, and combining the plurality of task services to obtain a plurality of service paths reaching the expected benefits of the service.
Optionally, determining the resource of the previous level according to the expected benefits of the service and the task service set; then, determining the resources of the upper hierarchy according to the determined resources of the upper hierarchy, and so on, and sequentially pushing and expanding the upper hierarchy according to the task service set until the upper hierarchy cannot be expanded. It can be understood that the interworking paths between any two adjacent levels are not only one, so that all possible service paths between any two adjacent levels are cross-combined to obtain a plurality of service paths, and all service paths between the whole levels are cross-combined to obtain a plurality of service paths.
For example, as in game XXX, the expected business benefit is to obtain prop X, and a specified prop X in the multiple task business sets may be obtained by copy a or copy B, so that the expected business benefit is first expanded based on the expected business benefit, so as to obtain the resources consumed by the previous level to achieve the expected business benefit, namely:
in addition, in the task service set, the copy a needs to consume the ticket E1 and the ticket E2 to be opened, and the copy B needs to consume the ticket E3 and the ticket E4 to be opened, so that the acquisition target prop X can be converted into: the tickets E1 and E2 are acquired, or the tickets E3 and E4 are acquired, namely:
Continuing to push reversely, setting ticket E1 in the task service set to be obtained through copy C or D, ticket E2 to be obtained through copy E or F, E3 to be obtained through copy H or I, and E4 to be obtained through copy J or K. And at this time, it can not be expanded in the previous level, and then it can be determined that all possible service paths for obtaining prop X are { C and E, C and F, D and E, D and F, H and J, H and K, I and J, I and K }, that is:
203: analyzing the total amount of resources consumed by each service path, and comparing the total amount of resources consumed by each service path with the resource pool set corresponding to the target user to obtain a target service path in the plurality of service paths.
Optionally, a preferred service path (i.e., a target service path) is selected from the plurality of service paths according to the existing resource pool set, and the service expected benefit is achieved by using the preferred service path.
204: Prompting to execute the target service path to acquire the expected benefits of the service.
Optionally, after the target service path is obtained, the service path is animated in a visual interface, and a process of executing the target service path to achieve expected benefits of the service is displayed.
As shown in fig. 2B, when the target user is a virtual game character, the growth condition when the virtual game character grows according to the upgrade rule of each node in the target service path is sequentially shown.
It can be seen that in the embodiment of the application, task services can be input in advance, and a plurality of service paths are automatically designed for expected benefits of the services through the task services, so that the efficiency of service path design is improved; and the target service path is selected from the plurality of service paths according to the basic resource pool set, so that the rationality of service path design is improved, and the user experience is further improved.
The method of hierarchical expansion to obtain the traffic path is described in detail below.
Constructing a directed acyclic graph according to the task service set and the expected benefits of the service to obtain a plurality of task services reaching the expected benefits of the service, wherein each node except the last node in the directed acyclic graph comprises at least one task service in the plurality of task services, and at least one task service corresponding to the last node is the expected benefits of the service substantially;
According to at least one task service corresponding to each node, at least one sub-service path corresponding to any two adjacent nodes in the directed acyclic graph is obtained;
And cross-combining at least one sub-service path corresponding to any two adjacent nodes to obtain a plurality of service paths reaching expected benefits of the service.
Specifically, the expected benefit of the service is taken as the last node in the directed acyclic graph, then, at least one first task service reaching the expected benefit of the service in the task service set is determined, the at least one first task service is taken as the last node corresponding to the last node, as described above, prop X needs to be obtained through copy A or copy B, the resource required to be consumed by the last node is A or B, that is, the first task service of the last node is consumed resource A or B to obtain tool X; then, taking the last node as a new last node, and determining at least one second task service reaching the at least one first task service in the task service set, namely all second task services reaching any one first task service in the task service set; and by analogy, when the determined new last node meets the preset condition, namely, when the resources consumed in executing the business task of the new last node meet the preset condition, stopping expanding, and constructing a directed acyclic graph reaching the expected benefit of the business according to all the determined last nodes and the last node.
As shown in fig. 2C, each level is sequentially expanded, and the resources required to be consumed by each node are sequentially obtained, until the resources required to be consumed in the level N are basic resources, the expansion is stopped. { T1, T2, …, tn } is one sub-traffic path from the previous level to the present level, T1, T2, …, tn is the resource that needs to be consumed by each sub-traffic path. And cross-combining the sub-service paths between any two levels to obtain a plurality of service paths corresponding to expected benefits of the service and the script resources required to be consumed on each service path.
A method of selecting a target traffic path from a plurality of traffic paths is provided.
Wherein the expected revenue for the business includes at least one target resource and a quantity of each target resource.
And obtaining the first resource type consumed by the last node and the number of each first resource according to the number of each target resource and the task service of the last node corresponding to the last node on each service path. For example, prop X (expected revenue of business) needs to be obtained by 2 copies a or 3 copies B, then the first resource category includes a or B, and the number of first resource copies a is 2, and the number of copies B is 3; taking the last node as a new last node on each service path; obtaining the second resource type consumed by the last node and the quantity of each second resource according to the first resource type consumed by the new last node, the quantity of each first resource and the task service of the last node corresponding to the new last node on each service path; when the types of the basic resources consumed by the initial node of each service path and the quantity of each basic resource are determined, obtaining the total quantity of the resources consumed by each service path; and finally, comparing the total amount of resources consumed by each service path with the resource pool set of the target user, and selecting a target service path from a plurality of service paths.
That is, the resource types and the number of each resource consumed by each node of each traffic path are inversely pushed through the exploration algorithm and the expected benefits of the traffic until the basic resource types and the number of each basic resource corresponding to the starting node on each traffic path are obtained.
Optionally, according to the number of each target resource and the task service of the last node corresponding to the last node on each service path, the implementation process of obtaining the first resource type consumed by the last node and the number of each first resource may be:
Determining a first target resource in the at least one target resource, wherein the first target resource is the target resource with the least number of the at least one target resource;
According to the task business of the last node corresponding to the last node, acquiring a first resource type consumed by the last node, and determining a second target resource in the first resource consumed by the last node, wherein the second target resource is the resource with the most variety of other resources generated in the first resource consumed by the last node, and the other resources at least comprise the first target resource;
determining the number of the second target resources according to the number of the first target resources;
Determining a new first target resource of the at least one target resource, the new first target resource being the least number of resources than the first target resource of the at least one target resource;
determining a new second target resource corresponding to the last node, wherein the new second target resource is the resource with the largest variety of other resources except the second target resource in the first resource consumed by the last node, and the other resources at least comprise the new first target resource;
And determining the quantity of each first resource consumed by the last node corresponding to the last node on each service path according to the new first target resource and the new second target resource.
The process of acquiring the target path by the search algorithm is described below by way of a practical example.
For example, the target resources for expected revenue for a business are: four resources of 100E1, 150E2, 200E3, 250E4 are acquired, and the four resources are specified in the task traffic set to be available through three resources of T1, T2, or T3 in the previous node. If one T1 can obtain 5E 1, one T2 can obtain 10E 1 and 5E 2; one T3 can obtain 10E 2, 10E 3 and 10E 4; it can be determined that there are three service paths, i.e., T1 and T3, T2 and T3, or T1, T2 and T3, that achieve the expected benefits of the service. When the total amount of resources consumed by the traffic paths T1, T2 and T3 is calculated, a multi-element linear equation corresponding to T1, T2 and T3 can be established: at1+b t2+c t3=100e1+150e2+200e3+250e4. Therefore, the total amount of resources consumed by the traffic path is obtained and converted into values of solutions a, b, and c. Since the number of E1 needed in the target resource is minimal, and T1 can only produce E1, T2 can produce T2 while T2 can produce E1. Therefore, T2 is preferentially used to reach the target resource E1, so that 10T 2's are consumed in the previous node, i.e. b=10; in addition, after the number of target resources E1 is reached, the target resources E2 need to be reached. Since T3 also generates E3 and E4 when E2 is generated, T3 is used to reach the target resource E2; in addition, 50E2 are generated simultaneously when 100E1 is generated using 10T1, so when target resource E2 is generated using T3, 10T 3 are also needed initially, and 150E2 can be generated; in addition, only T3 can produce E3 and E4, and thus, 25T 3 are actually required to produce 250E4. It is determined that a=0, b=10, c=25.
In some possible embodiments, the comparing the total amount of resources consumed by each service path with the set of resource pools corresponding to the target user, to obtain the implementation procedure of the target service path in the multiple service paths may be: constructing a first feature vector according to the types of the basic resources consumed by each service path and the quantity of each basic resource; constructing a second feature vector according to the basic resource types in the resource pool set corresponding to the target user and the quantity of each basic resource; calculating cosine similarity of each service path of the first feature vector and the second feature vector; and determining according to the cosine similarity of each service path to obtain a target service path in the plurality of service paths.
And taking the service path with the maximum cosine similarity as the target service path.
In some possible embodiments, the comparing the total amount of resources consumed by each service path with the set of resource pools corresponding to the target user, to obtain the implementation procedure of the target service path in the multiple service paths may be: and acquiring the duty ratio of the number of the set resources consumed by each service path relative to the resource set, and taking the service path with the minimum or maximum duty ratio as the target service path. Wherein the set resource is one or more of the basic resources.
For example, the basic resources include A, B, C, and the traffic path consuming the least resource B is specified as the target traffic path.
In addition, the number of resource types consumed by each service path may be acquired, and the service path with the smallest number of resource types may be used as the target service path.
In addition, the service paths may be selected based on the growth time required for each service path, and the service path having the shortest growth time may be used as the target service path. The application does not limit the mode of screening the target service path.
Fig. 3A is a flow chart of another method for designing a service path according to an embodiment of the present application, which is the same as the embodiment shown in fig. 2A, and will not be repeated here. The method includes, but is not limited to, the steps of:
301: and acquiring the task service set, a resource pool set corresponding to the target user and expected benefits of the service.
302: And selecting a plurality of task services reaching the expected benefits of the service from the task service set, and combining the plurality of task services to obtain a plurality of service paths reaching the expected benefits of the service.
303: Analyzing the total amount of resources consumed by each service path, and comparing the total amount of resources consumed by each service path with the resource pool set corresponding to the target user to obtain a target service path in the plurality of service paths.
304: And comparing the target service path with a first service path to determine the rationality of the first service path, wherein the first service path is a service path preset for achieving the expected benefit of the service.
Namely, the types of basic resources required by the target path and the quantity of each basic resource are compared with the types of basic resources required by the first traffic path and the quantity of each basic resource designed in advance, so that the rationality of the first traffic path is judged.
Further, as shown in fig. 3B, when the first service path is unreasonable, a growing process corresponding to the first service path and a growing process of the target service path are displayed on a visual interface, so as to highlight the difference between the two service paths, so that a user can adjust the task service on the first service path to design an optimal growing route.
Compared with the prior art, after a plurality of business paths are designed, a tester is required to test, data in the test process are collected, and the rationality of the first business path is judged according to the data. According to the application, the optimal service path and the first service path are compared, so that a large amount of manpower and material resources are not required to be input for testing, the testing process is simplified, the testing time is saved, and meanwhile, the input of manpower and material resources is reduced.
Fig. 4 is a schematic structural diagram of a traffic path designing apparatus 400 according to an embodiment of the present application, where, as shown in fig. 4, the traffic path designing apparatus 400 includes a processor, a memory, a communication interface, and one or more programs, where the one or more programs are different from the one or more application programs, and the one or more programs are stored in the memory and configured to be executed by the processor, and the programs include instructions for performing the following steps:
Acquiring a task service set, a resource pool set corresponding to a target user and expected benefits of the service;
Selecting a plurality of task services reaching the expected benefits of the service from the task service set, and combining the plurality of task services to obtain a plurality of service paths reaching the expected benefits of the service;
Analyzing the total amount of resources consumed by each service path, and comparing the total amount of resources consumed by each service path with a resource pool set corresponding to the target user to obtain a target service path in the plurality of service paths;
Prompting to execute the target service path to acquire the expected benefits of the service.
In some possible embodiments, in selecting a plurality of task services from the task service set, where the task services reach the expected benefits of the services, combining the task services to obtain a plurality of service paths reaching the expected benefits of the services, the program is specifically configured to execute instructions for:
Constructing a directed acyclic graph according to the task service set and the service expected benefits to obtain a plurality of task services reaching the service expected benefits, wherein each node except the last node in the directed acyclic graph comprises at least one task service in the plurality of task services, and at least one task service corresponding to the last node is the service expected benefits;
according to at least one task service corresponding to each node, at least one sub-service path corresponding to any two adjacent nodes in the directed acyclic graph is obtained;
and cross-combining at least one sub-service path corresponding to any two adjacent nodes to obtain a plurality of service paths reaching the expected benefits of the service.
In some possible embodiments, in constructing a directed acyclic graph from the set of task services and the expected benefits of the services, the above-described program is specifically configured to execute instructions for:
taking expected benefits of the service as the last node of the directed acyclic graph
Determining at least one first task service reaching expected benefits of the service in the task service set to obtain a last node corresponding to the last node;
Taking the last node as a new last node;
Determining at least one second task service reaching at least one first task service corresponding to the new last node in the task service set to obtain a last node corresponding to the new last node;
And when the new last node meets the preset condition, constructing a directed acyclic graph reaching the expected benefit of the service according to all the determined last nodes and the last node.
In some possible embodiments, the expected benefit of the service includes at least one target resource and the number of each target resource, and the program is specifically configured to execute the following instructions in analyzing the total amount of resources consumed by each service path:
Obtaining the first resource type consumed by the last node and the number of each first resource according to the number of each target resource and the task service of the last node corresponding to the last node on each service path;
taking the last node as a new last node on each service path;
Obtaining a second resource type consumed by a last node and the quantity of each second resource according to the first resource type consumed by the last node and the quantity of each first resource and the task service of the last node corresponding to the last node on each service path;
when the types of the basic resources consumed by the starting node of each service path and the quantity of each basic resource are determined, the total quantity of the resources consumed by each service path is obtained.
In some possible embodiments, in terms of obtaining the first resource type consumed by the last node and the number of each first resource according to the number of each target resource and the task traffic of the last node corresponding to the last node on each traffic path, the program is specifically configured to execute the following instructions:
Determining a first target resource in the at least one target resource, wherein the first target resource is the target resource with the least number of the at least one target resource;
According to the task business of the last node corresponding to the last node, acquiring a first resource type consumed by the last node, and determining a second target resource in the first resource consumed by the last node, wherein the second target resource is the resource with the most variety of other resources generated in the first resource consumed by the last node, and the other resources at least comprise the first target resource;
determining the number of the second target resources according to the number of the first target resources;
Determining a new first target resource of the at least one target resource, the new first target resource being the least number of resources than the first target resource of the at least one target resource;
determining a new second target resource corresponding to the last node, wherein the new second target resource is the resource with the largest variety of other resources except the second target resource in the first resource consumed by the last node, and the other resources at least comprise the new first target resource;
And determining the quantity of each first resource consumed by the last node corresponding to the last node on each service path according to the new first target resource and the new second target resource.
In some possible embodiments, in comparing the total amount of resources consumed by each service path with the set of resource pools corresponding to the target user to obtain a target service path in the plurality of service paths, the program is specifically configured to execute instructions for:
Constructing a first feature vector according to the types of the basic resources consumed by each service path and the quantity of each basic resource;
Constructing a second feature vector according to the basic resource types in the resource pool set corresponding to the target user and the quantity of each basic resource;
calculating cosine similarity of each service path of the first feature vector and the second feature vector;
and determining according to the cosine similarity of each service path to obtain a target service path in the plurality of service paths.
In some possible embodiments, the target user is a virtual game character, the resource pool set corresponding to the target user includes a game gold coin, an initial prop, and an initial level of the virtual game character, the task service in the task service set is an upgrade rule of the virtual game character, and the expected benefit of the service includes the target level of the virtual game character;
In the aspect of selecting a plurality of task services reaching the expected benefits of the service from the task service set, combining the plurality of task services to obtain a plurality of service paths reaching the expected benefits of the service, the program is specifically configured to execute instructions of the following steps:
Selecting a plurality of upgrading rules reaching the target level of the virtual game role from the task service set, and combining the upgrading rules in a crossing way to obtain a plurality of service paths reaching the expected benefits of the service;
The above-described program is specifically for executing instructions for the following steps in terms of analyzing the total amount of resources consumed by each traffic path:
and determining the game gold coins, props and the initial grades of the virtual game roles consumed by each service path according to the target grades of the target virtual game roles and the upgrading rules corresponding to each service path.
Fig. 5 shows a block diagram of one possible functional unit composition of the traffic path designing apparatus 500 involved in the above-described embodiment, the traffic path designing apparatus 500 comprising: an acquisition unit 510, a processing unit 520, an alignment unit 530 and a prompting unit 540, wherein:
an obtaining unit 510, configured to obtain a task service set, a resource pool set corresponding to a target user, and a service expected benefit;
a processing unit 520, configured to select a plurality of task services that reach the expected benefits of the service from the task service set, and combine the plurality of task services to obtain a plurality of service paths that reach the expected benefits of the service;
A comparison unit 530, configured to analyze the total amount of resources consumed by each service path, and compare the total amount of resources consumed by each service path with the set of resource pools corresponding to the target user, so as to obtain a target service path in the plurality of service paths;
and a prompting unit 540, configured to prompt execution of the target service path to obtain the expected benefit of the service.
In some possible embodiments, in selecting a plurality of task services from the task service set, where the expected benefits of the services are achieved, combining the plurality of task services to obtain a plurality of service paths that achieve the expected benefits of the services, the processing unit 520 is specifically configured to:
Constructing a directed acyclic graph according to the task service set and the service expected benefits to obtain a plurality of task services reaching the service expected benefits, wherein each node except the last node in the directed acyclic graph comprises at least one task service in the plurality of task services, and at least one task service corresponding to the last node is the service expected benefits;
according to at least one task service corresponding to each node, at least one sub-service path corresponding to any two adjacent nodes in the directed acyclic graph is obtained;
and cross-combining at least one sub-service path corresponding to any two adjacent nodes to obtain a plurality of service paths reaching the expected benefits of the service.
In some possible embodiments, the processing unit 520 is specifically configured to, in terms of constructing a directed acyclic graph according to the task service set and the expected benefits of the service:
taking expected benefits of the service as the last node of the directed acyclic graph
Determining at least one first task service reaching expected benefits of the service in the task service set to obtain a last node corresponding to the last node;
Taking the last node as a new last node;
Determining at least one second task service reaching at least one first task service corresponding to the new last node in the task service set to obtain a last node corresponding to the new last node;
And when the new last node meets the preset condition, constructing a directed acyclic graph reaching the expected benefit of the service according to all the determined last nodes and the last node.
In some possible embodiments, the expected benefit of the service includes at least one target resource and the number of each target resource, and the comparing unit is specifically configured to:
Obtaining the first resource type consumed by the last node and the number of each first resource according to the number of each target resource and the task service of the last node corresponding to the last node on each service path;
taking the last node as a new last node on each service path;
Obtaining a second resource type consumed by a last node and the quantity of each second resource according to the first resource type consumed by the last node and the quantity of each first resource and the task service of the last node corresponding to the last node on each service path;
when the types of the basic resources consumed by the starting node of each service path and the quantity of each basic resource are determined, the total quantity of the resources consumed by each service path is obtained.
In some possible embodiments, the comparing unit 530 is specifically configured to, according to the number of each target resource and the task traffic of the last node corresponding to the last node on each traffic path, obtain the first resource type consumed by the last node and the number of each first resource:
Determining a first target resource in the at least one target resource, wherein the first target resource is the target resource with the least number of the at least one target resource;
According to the task business of the last node corresponding to the last node, acquiring a first resource type consumed by the last node, and determining a second target resource in the first resource consumed by the last node, wherein the second target resource is the resource with the most variety of other resources generated in the first resource consumed by the last node, and the other resources at least comprise the first target resource;
determining the number of the second target resources according to the number of the first target resources;
Determining a new first target resource of the at least one target resource, the new first target resource being the least number of resources than the first target resource of the at least one target resource;
determining a new second target resource corresponding to the last node, wherein the new second target resource is the resource with the largest variety of other resources except the second target resource in the first resource consumed by the last node, and the other resources at least comprise the new first target resource;
And determining the quantity of each first resource consumed by the last node corresponding to the last node on each service path according to the new first target resource and the new second target resource.
In some possible embodiments, in comparing the total amount of resources consumed by each service path with the set of resource pools corresponding to the target user, the comparing unit 530 is specifically configured to:
Constructing a first feature vector according to the types of the basic resources consumed by each service path and the quantity of each basic resource;
Constructing a second feature vector according to the basic resource types in the resource pool set corresponding to the target user and the quantity of each basic resource;
calculating cosine similarity of each service path of the first feature vector and the second feature vector;
and determining according to the cosine similarity of each service path to obtain a target service path in the plurality of service paths.
In some possible embodiments, the target user is a virtual game character, the resource pool set corresponding to the target user includes a game gold coin, an initial prop, and an initial level of the virtual game character, the task service in the task service set is an upgrade rule of the virtual game character, and the expected benefit of the service includes the target level of the virtual game character;
In selecting a plurality of task services from the task service set, and combining the task services to obtain a plurality of service paths for achieving the expected benefits of the services, the processing unit 520 is specifically configured to:
Selecting a plurality of upgrading rules reaching the target level of the virtual game role from the task service set, and combining the upgrading rules in a crossing way to obtain a plurality of service paths reaching the expected benefits of the service;
the comparison unit 530 is specifically configured to analyze the total amount of resources consumed by each traffic path:
and determining the game gold coins, props and the initial grades of the virtual game roles consumed by each service path according to the target grades of the target virtual game roles and the upgrading rules corresponding to each service path.
The embodiment of the present application also provides a computer storage medium storing a computer program that is executed by a processor to implement some or all of the steps of any one of the traffic path designing methods described in the above method embodiments.
Embodiments of the present application also provide a computer program product comprising a non-transitory computer-readable storage medium storing a computer program operable to cause a computer to perform part or all of the steps of any one of the traffic path design methods described in the method embodiments above.
It should be noted that, for simplicity of description, the foregoing method embodiments are all described as a series of acts, but it should be understood by those skilled in the art that the present application is not limited by the order of acts described, as some steps may be performed in other orders or concurrently in accordance with the present application. Further, those skilled in the art will also appreciate that the embodiments described in the specification are alternative embodiments, and that the acts and modules referred to are not necessarily required for the present application.
In the foregoing embodiments, the descriptions of the embodiments are emphasized, and for parts of one embodiment that are not described in detail, reference may be made to related descriptions of other embodiments.
In the several embodiments provided by the present application, it should be understood that the disclosed apparatus may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, such as the division of the units, merely a logical function division, and there may be additional manners of dividing the actual implementation, such as multiple units or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, or may be in electrical or other forms.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in the embodiments of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units described above may be implemented either in hardware or in software program modules.
The integrated units, if implemented in the form of software program modules, may be stored in a computer-readable memory for sale or use as a stand-alone product. Based on this understanding, the technical solution of the present application may be embodied essentially or partly in the form of a software product, or all or part of the technical solution, which is stored in a memory, and includes several instructions for causing a computer device (which may be a personal computer, a server, a network device, or the like) to perform all or part of the steps of the method according to the embodiments of the present application. And the aforementioned memory includes: a usb disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a removable hard disk, a magnetic disk, or an optical disk, or other various media capable of storing program codes.
Those of ordinary skill in the art will appreciate that all or a portion of the steps in the various methods of the above embodiments may be implemented by a program that instructs associated hardware, and the program may be stored in a computer readable memory, which may include: flash disk, read-Only Memory (ROM), random access Memory (Random Access Memory, RAM), magnetic disk or optical disk.
The foregoing has outlined rather broadly the more detailed description of embodiments of the application, wherein the principles and embodiments of the application are explained in detail using specific examples, the above examples being provided solely to facilitate the understanding of the method and core concepts of the application; meanwhile, as those skilled in the art will have variations in the specific embodiments and application scope in accordance with the ideas of the present application, the present description should not be construed as limiting the present application in view of the above.
Claims (9)
1. A business path design method is characterized by being applied to a design scene of virtual game character growth lines, and comprises the following steps:
acquiring a task service set, a resource pool set corresponding to a target user and expected benefits of the service; the expected revenue of the business includes at least one target resource and the number of each target resource;
Selecting a plurality of task services reaching the expected benefits of the service from the task service set, and combining the plurality of task services to obtain a plurality of service paths reaching the expected benefits of the service;
Analyzing the total amount of resources consumed by each traffic path, including: obtaining the first resource type consumed by the last node corresponding to the last node and the number of each first resource according to the number of each target resource and the task service of the last node corresponding to the last node on each service path; the last node corresponding to the last node is used as a new last node on each service path; obtaining a second resource type and the number of each second resource consumed by the last node corresponding to the new last node according to the first resource type and the number of each first resource consumed by the new last node and the task service of the last node corresponding to the new last node on each service path; when the types of the basic resources consumed by the initial node of each service path and the quantity of each basic resource are determined, obtaining the total quantity of the resources consumed by each service path;
comparing the total amount of resources consumed by each service path with a resource pool set corresponding to the target user to obtain a target service path in the plurality of service paths;
Prompting to execute the target service path to acquire the expected benefits of the service.
2. The method of claim 1, wherein selecting a plurality of task services from the set of task services that achieve the expected revenue for the service, combining the plurality of task services to obtain a plurality of service paths that achieve the expected revenue for the service, comprises:
Constructing a directed acyclic graph according to the task service set and the service expected benefits to obtain a plurality of task services reaching the service expected benefits, wherein each node except the last node in the directed acyclic graph comprises at least one task service in the plurality of task services, and at least one task service corresponding to the last node is the service expected benefits;
according to at least one task service corresponding to each node, at least one sub-service path corresponding to any two adjacent nodes in the directed acyclic graph is obtained;
and cross-combining at least one sub-service path corresponding to any two adjacent nodes to obtain a plurality of service paths reaching the expected benefits of the service.
3. The method of claim 2, wherein constructing a directed acyclic graph from the set of task services and the expected revenue for the services comprises:
taking expected benefits of the service as the last node of the directed acyclic graph
Determining at least one first task service reaching expected benefits of the service in the task service set to obtain a last node corresponding to the last node;
Taking the last node as a new last node;
Determining at least one second task service reaching at least one first task service corresponding to the new last node in the task service set to obtain a last node corresponding to the new last node;
And when the new last node meets the preset condition, constructing a directed acyclic graph reaching the expected benefit of the service according to all the determined last nodes and the last node.
4. The method of claim 1, wherein the obtaining the first resource type consumed by the last node corresponding to the last node and the number of each first resource according to the number of each target resource and the task traffic of the last node corresponding to the last node on each traffic path includes:
Determining a first target resource in the at least one target resource, wherein the first target resource is the target resource with the least number of the at least one target resource;
According to task business of a last node corresponding to the last node, acquiring a first resource type consumed by the last node corresponding to the last node, determining a second target resource in the first resource consumed by the last node, wherein the second target resource is the resource with the largest variety of other resources generated in the first resource consumed by the last node, and the other resources at least comprise the first target resource;
determining the number of the second target resources according to the number of the first target resources;
Determining a new first target resource of the at least one target resource, the new first target resource being the least number of resources than the first target resource of the at least one target resource;
Determining a new second target resource corresponding to the last node, wherein the new second target resource is a resource with the most variety of other resources except the second target resource in the first resource consumed by the last node corresponding to the last node, and the other resources at least comprise the new first target resource;
And determining the quantity of each first resource consumed by the last node corresponding to the last node on each service path according to the new first target resource and the new second target resource.
5. The method according to claim 1 or 4, wherein comparing the total amount of resources consumed by each service path with the set of resource pools corresponding to the target user to obtain a target service path of the plurality of service paths includes:
Constructing a first feature vector according to the types of the basic resources consumed by each service path and the quantity of each basic resource;
Constructing a second feature vector according to the basic resource types in the resource pool set corresponding to the target user and the quantity of each basic resource;
calculating cosine similarity of each service path of the first feature vector and the second feature vector;
and determining according to the cosine similarity of each service path to obtain a target service path in the plurality of service paths.
6. The method of claim 1, wherein the target user is a virtual game character, the set of resource pools corresponding to the target user includes a game gold coin, an initial prop, and an initial level of the virtual game character, the task services in the set of task services are upgrading rules of the virtual game character, and the expected benefits of the services include the target level of the virtual game character;
The selecting a plurality of task services reaching the expected benefits of the service from the task service set, and combining the plurality of task services to obtain a plurality of service paths reaching the expected benefits of the service, including:
Selecting a plurality of upgrading rules reaching the target level of the virtual game role from the task service set, and combining the upgrading rules in a crossing way to obtain a plurality of service paths reaching the expected benefits of the service;
the analyzing the total amount of resources consumed by each traffic path includes:
And determining the game gold coins, props and the initial grades of the virtual game roles consumed by each service path according to the target grades of the virtual game roles and the upgrading rules corresponding to each service path.
7. A traffic path design apparatus, for use in a virtual game character growth line design scenario, comprising:
The acquisition unit is used for acquiring the task service set, the resource pool set corresponding to the target user and the expected benefits of the service; the expected revenue of the business includes at least one target resource and the number of each target resource;
The processing unit is used for selecting a plurality of task services reaching the expected benefits of the service from the task service set, and combining the plurality of task services to obtain a plurality of service paths reaching the expected benefits of the service;
An comparing unit, configured to analyze the total amount of resources consumed by each traffic path, including: obtaining the first resource type consumed by the last node corresponding to the last node and the number of each first resource according to the number of each target resource and the task service of the last node corresponding to the last node on each service path; the last node corresponding to the last node is used as a new last node on each service path; obtaining a second resource type and the number of each second resource consumed by the last node corresponding to the new last node according to the first resource type and the number of each first resource consumed by the new last node and the task service of the last node corresponding to the new last node on each service path; when the types of the basic resources consumed by the initial node of each service path and the quantity of each basic resource are determined, obtaining the total quantity of the resources consumed by each service path; comparing the total amount of resources consumed by each service path with a resource pool set corresponding to the target user to obtain a target service path in the plurality of service paths;
And the prompting unit is used for prompting the execution of the target service path so as to acquire the expected benefits of the service.
8. An electronic device comprising a processor, a memory, a communication interface, and one or more programs, wherein the one or more programs are stored in the memory and configured for execution by the processor, the programs comprising instructions for performing the steps of the method of any of claims 1-6.
9. A computer readable storage medium, characterized in that the computer readable storage medium stores a computer program, which is executed by a processor to implement the method of any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911115038.2A CN111221508B (en) | 2019-11-14 | 2019-11-14 | Service path design method, design device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911115038.2A CN111221508B (en) | 2019-11-14 | 2019-11-14 | Service path design method, design device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111221508A CN111221508A (en) | 2020-06-02 |
| CN111221508B true CN111221508B (en) | 2024-04-23 |
Family
ID=70827675
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911115038.2A Active CN111221508B (en) | 2019-11-14 | 2019-11-14 | Service path design method, design device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111221508B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112115171B (en) * | 2020-09-28 | 2023-11-21 | 广州华多网络科技有限公司 | Data aggregation method, device, terminal equipment and computer readable storage medium |
| CN112418599B (en) * | 2020-10-15 | 2023-02-10 | 重庆市科学技术研究院 | Enterprise growth path planning method and system based on index set |
| CN113052496A (en) * | 2021-04-23 | 2021-06-29 | 深圳壹账通智能科技有限公司 | Method and device for generating business processing flow, electronic equipment and medium |
| CN115738245A (en) * | 2022-11-22 | 2023-03-07 | 乐元素科技(北京)股份有限公司 | Task processing method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101808254A (en) * | 2010-02-12 | 2010-08-18 | 重庆邮电大学 | Static routing and wavelength allocation method based on layered graph |
| CN106339831A (en) * | 2015-07-09 | 2017-01-18 | 阿里巴巴集团控股有限公司 | Method and device for acquiring effective path for service |
| CN110311862A (en) * | 2019-06-14 | 2019-10-08 | 北京邮电大学 | A kind of service chaining mapping method and device |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060080175A1 (en) * | 2001-02-02 | 2006-04-13 | International Game Technology | Player scoring for customizing a game of chance on a gaming machine |
| US8366552B2 (en) * | 2002-12-10 | 2013-02-05 | Ol2, Inc. | System and method for multi-stream video compression |
-
2019
- 2019-11-14 CN CN201911115038.2A patent/CN111221508B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101808254A (en) * | 2010-02-12 | 2010-08-18 | 重庆邮电大学 | Static routing and wavelength allocation method based on layered graph |
| CN106339831A (en) * | 2015-07-09 | 2017-01-18 | 阿里巴巴集团控股有限公司 | Method and device for acquiring effective path for service |
| CN110311862A (en) * | 2019-06-14 | 2019-10-08 | 北京邮电大学 | A kind of service chaining mapping method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111221508A (en) | 2020-06-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111221508B (en) | Service path design method, design device, electronic equipment and storage medium | |
| Berger et al. | Creating agents and landscapes for multiagent systems from random samples | |
| CN110059162A (en) | A kind of matching process and device of job seeker resume and position vacant | |
| CN106408132A (en) | Method and device of crop yield prediction based on plantation device | |
| CN104820945B (en) | Online community network information based on community structure mining algorithm propagates maximization approach | |
| CN105300398B (en) | The methods, devices and systems of gain location information | |
| Kühn et al. | Combining spatial and phylogenetic eigenvector filtering in trait analysis | |
| CN108090734A (en) | User role matching process and device | |
| CN109191167A (en) | A kind of method for digging and device of target user | |
| CN110097529A (en) | A kind of farmland Grading unit division methods and system based on semantic rules | |
| van der Bijl et al. | Butterfly dichromatism primarily evolved via Darwin's, not Wallace's, model | |
| Kamrani et al. | A framework for simulation-based optimization of business process models | |
| Matsunaga et al. | Strategies to reconstruct 3D Coffea arabica L. plant structure | |
| Wang et al. | Regional multi-armed bandits with partial informativeness | |
| Horák | Nation-building and sporting spectacles in authoritarian regimes: Turkmenistan’s Aziada-2017 | |
| CN110457200A (en) | A kind of method for generating test case and its equipment, storage medium, electronic equipment | |
| KR100751276B1 (en) | System and method for supplying patent map be able to grasp correlation degree between data | |
| CN109978575A (en) | A kind of method and device excavated customer flow and manage scene | |
| CN108717445A (en) | A kind of online social platform user interest recommendation method based on historical data | |
| Räty et al. | Fusing diameter distributions predicted by an area-based approach and individual-tree detection in coniferous-dominated forests | |
| Papaik et al. | Forest processes from stands to landscapes: exploring model forecast uncertainties using cross-scale model comparison | |
| CN108629023A (en) | Data digging method, device and computer readable storage medium | |
| CN110772794B (en) | Intelligent game processing method, device, equipment and storage medium | |
| CN113205408A (en) | Customer manager capacity map generation method and device | |
| CN109242520A (en) | A kind of potential user group localization method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 40023554 Country of ref document: HK |
|
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |