CN109558964A - The method and apparatus for establishing business map - Google Patents

The method and apparatus for establishing business map Download PDF

Info

Publication number
CN109558964A
CN109558964A CN201710890355.6A CN201710890355A CN109558964A CN 109558964 A CN109558964 A CN 109558964A CN 201710890355 A CN201710890355 A CN 201710890355A CN 109558964 A CN109558964 A CN 109558964A
Authority
CN
China
Prior art keywords
service unit
service
unit
sequence
path
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Granted
Application number
CN201710890355.6A
Other languages
Chinese (zh)
Other versions
CN109558964B (en
Inventor
王春兰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Jingdong Century Trading Co Ltd
Beijing Jingdong Shangke Information Technology Co Ltd
Original Assignee
Beijing Jingdong Century Trading Co Ltd
Beijing Jingdong Shangke Information Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Jingdong Century Trading Co Ltd, Beijing Jingdong Shangke Information Technology Co Ltd filed Critical Beijing Jingdong Century Trading Co Ltd
Priority to CN201710890355.6A priority Critical patent/CN109558964B/en
Publication of CN109558964A publication Critical patent/CN109558964A/en
Application granted granted Critical
Publication of CN109558964B publication Critical patent/CN109558964B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047Optimisation of routes or paths, e.g. travelling salesman problem
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/10Office automation; Time management
    • G06Q10/103Workflow collaboration or project management

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Game Theory and Decision Science (AREA)
  • Development Economics (AREA)
  • Data Mining & Analysis (AREA)
  • Instructional Devices (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a kind of method and apparatus for establishing business map, are related to field of computer technology.One specific embodiment of this method includes: the data information for obtaining current business unit;According to the data information, the forerunner's business unit and/or subsequent business unit of the current business unit are obtained;It establishes from forerunner's business unit to the oriented relationship of the current business unit, and/or from the current business unit to the subsequent oriented relationship of business unit, forms business map.The technical issues of which overcomes all structure of knowledge relationships for needing to be grasped all business unit when establishing business map in the prior art, realize the automatic establishment of business map, and then the efficiency of business map foundation is improved, while having saved a large amount of cost of labor.

Description

Method and device for establishing business map
Technical Field
The invention relates to the technical field of computers, in particular to a method and a device for establishing a business map.
Background
Nowadays, a large number of enterprises have a very complicated business system and a very complicated relationship between business systems, such as a large-scale e-commerce enterprise, a mall master station system, an operation and maintenance system, a distribution system, a reconciliation system, a capital system, a settlement system, a human resource system, and the like. When a new business system is accessed, a plurality of systems need to be associated, and establishment of a comprehensive global business map is necessary for informatization of enterprises. The service map is a directed graph among service units formed among a plurality of service units according to the flow direction relationship of the service process. The user can find out all information of the enterprise business system through the business map, and can know and be familiar with all business processes in the business system.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
1. when a business map is established, a designer needs to master knowledge structure relations among business units in all business systems, and a plurality of problems such as resource scheduling, time arrangement and the like need to be considered in design.
2. For the situations of complex service system and various service units, a large amount of communication cost is needed when designing a service flow path, a large amount of time is spent, and links that a design route is unreasonable or is missed in the midway may exist, so that the overall situation cannot be comprehensively planned, and resources can be quickly estimated.
3. The optimal business process path cannot be quickly selected according to the optimal conditions, and the improvable business process path can be found.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for establishing a service map, which implement self-learning to establish a service map according to a directional relationship between a service unit and its predecessor service units and successor service nodes, and overcome the technical problem in the prior art that all knowledge structure relationships of all service units need to be mastered when establishing a service map, thereby improving the efficiency of establishing a service map and saving a large amount of labor cost.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a method of creating a service map, including: s101, acquiring data information of a current service unit; s102, acquiring a precursor service unit and/or a subsequent service unit of the current service unit according to the data information; and S103, establishing a directed relationship from the precursor service unit to the current service unit and/or a directed relationship from the current service unit to the subsequent service unit to form a service map.
Optionally, after establishing a directed relationship from the predecessor business unit to the current business unit, and/or a directed relationship from the current business unit to the successor business unit, the method further includes: marking the current service unit; and in the case that the unmarked predecessor service unit and/or the unmarked successor service unit exist, taking the existing service unit as a new current service unit, and then returning to execute the steps S101 to S103.
Optionally, after step S103, the method further includes: selecting a starting service unit and a terminating service unit; and determining an optimized path between the initial service unit and the termination service unit according to the service unit in the intersection of the subsequent service unit set of the initial service unit and the precursor service unit set of the termination service unit, the initial service unit and the termination service unit.
Optionally, after step S103, the method further includes: selecting a starting service unit and a terminating service unit; for the intersection of the subsequent service unit set of the initial service unit and the precursor service unit set of the termination service unit, taking the subsequent service unit set which does not belong to the intersection as a first set, and taking the precursor service unit set which does not belong to the intersection as a second set; then, a subsequent service unit set of the first service unit in the first set is determined, a precursor service unit set of the first service unit in the second set is determined, and then an optimized path between the initial service unit and the terminating service unit is determined according to the intersection of the determined subsequent service unit set and the precursor service unit set, the first service unit in the first set and the first service unit in the second set, the initial service unit and the terminating service unit.
Optionally, after step S103, the method further includes: s104, selecting a starting service unit and a terminating service unit; acquiring a forward starting sequence, wherein the forward starting sequence comprises a starting service unit of the service flow path; acquiring a reverse termination sequence, wherein the reverse termination sequence comprises a termination service unit of the service flow path; s105, acquiring all subsequent service units of the initial service unit according to the service map, and forming a forward path sequence by the forward initial sequence and the subsequent service units of the initial service unit; acquiring all precursor service units of the service termination unit according to the service map, and forming a reverse path sequence by the reverse termination sequence and the precursor service units of the service termination unit; s106, screening a forward path sequence and a reverse path sequence which meet the following conditions: common service units between the forward path sequence and the reverse path sequence except for the starting service unit and the ending service unit in step S104 are not empty, or the forward path sequence is a reverse sequence of the reverse path sequence; and S107, solving a union sequence of the forward path sequence screened in the step S106 and a reverse sequence of the reverse path sequence, and taking the union sequence as an optimized path between the initial service unit and the termination service unit in the step S104.
Optionally, after step S107, the method further includes: step S108, marking the forward path sequence and the reverse path sequence screened in the step S106; s109, judging whether the unmarked forward path sequence and the unmarked reverse path sequence are both null; if yes, ending, otherwise executing step S110; s110, taking a subsequent service unit in the unmarked forward path sequence as a new initial service unit; an unlabeled forward path sequence is used as a new forward starting sequence; taking a precursor service unit in the unmarked reverse path sequence as a new termination service unit; the unmarked reverse path sequence is used as a new reverse termination sequence; the execution returns to step S105 to step S107.
Optionally, after step S107, the method further includes: step S111, marking the forward path sequence and the reverse path sequence screened in the step S106; s112, judging whether the unmarked forward path sequence and the unmarked reverse path sequence are both null; if yes, ending, otherwise executing step S113; s113, taking a subsequent service unit in the unmarked forward path sequence as a new initial service unit; taking a precursor service unit in the unmarked reverse path sequence as a new termination service unit; s114, acquiring all subsequent service units of the new initial service unit according to the service map, and forming a new forward path sequence by the unmarked forward path sequence and the subsequent service units of the new initial service unit; acquiring all precursor service units of the new service termination unit according to the service map; forming a new reverse path sequence by the unmarked reverse path sequence and the precursor service unit of the new termination service unit; s115, taking the marked forward path sequence as a new forward path sequence; taking the marked reverse path sequence as a new reverse path sequence; the execution returns to step S106 to step S107.
Optionally, after obtaining all the optimized paths, the method further includes: obtaining an optimal path condition, and calculating the consumption of the optimized path by taking the optimal path condition as a weight; and selecting the optimized path with the minimum consumption as the optimal business process path.
Optionally, after obtaining all the optimized paths, the method further includes: counting the total application times of all the optimized paths and the application times of each optimized path in a set time period; and if the ratio of the application times of the optimized paths to the total application times of all the optimized paths is smaller than a set threshold value mu, the service flow optimized paths are the improved paths.
In order to achieve the above object, according to another aspect of the embodiments of the present invention, there is provided an apparatus for creating a service map, including: the system comprises a business unit acquisition module, a front and rear business unit acquisition module and a self-learning business map building module; the service unit obtaining module is used for obtaining data information of the current service unit; the front and back service unit acquisition module is used for acquiring a precursor service unit and/or a successor service unit of the current service unit according to the data information; the self-learning service map building module is used for building a directed relationship from the precursor service unit to the current service unit and/or a directed relationship from the current service unit to the subsequent service unit so as to form a service map.
Optionally, the self-learning service map building module is further configured to: marking the current service unit; and in the case that the unmarked predecessor service unit and/or the unmarked successor service unit exist, taking the existing service unit as a new current service unit, and then returning to execute the steps S101 to S103.
Optionally, the apparatus further comprises: a service flow path optimization acquisition module; the business process path optimization acquisition module is used for: selecting a starting service unit and a terminating service unit; and determining an optimized path between the initial service unit and the termination service unit according to the service unit in the intersection of the subsequent service unit set of the initial service unit and the precursor service unit set of the termination service unit, the initial service unit and the termination service unit.
Optionally, the apparatus further comprises: a service flow path optimization acquisition module; the business process path optimization acquisition module is used for: selecting a starting service unit and a terminating service unit; for the intersection of the subsequent service unit set of the initial service unit and the precursor service unit set of the termination service unit, taking the subsequent service unit set which does not belong to the intersection as a first set, and taking the precursor service unit set which does not belong to the intersection as a second set; then, a subsequent service unit set of the first service unit in the first set is determined, a precursor service unit set of the first service unit in the second set is determined, and then an optimized path between the initial service unit and the terminating service unit is determined according to the intersection of the determined subsequent service unit set and the precursor service unit set, the first service unit in the first set and the first service unit in the second set, the initial service unit and the terminating service unit.
Optionally, the apparatus further comprises: a service flow path optimization acquisition module; the service flow path optimization acquisition module is configured to: selecting a starting service unit and a terminating service unit; acquiring a forward starting sequence, wherein the forward starting sequence comprises a starting service unit of the service flow path; acquiring a reverse termination sequence, wherein the reverse termination sequence comprises a termination service unit of the service flow path; acquiring all subsequent service units of the initial service unit according to the service map, and forming a forward path sequence by the forward initial sequence and the subsequent service units of the initial service unit; acquiring all precursor service units of the service termination unit according to the service map, and forming a reverse path sequence by the reverse termination sequence and the precursor service units of the service termination unit; screening forward path sequences and reverse path sequences which meet the following conditions: common service units between the forward path sequence and the reverse path sequence except for the starting service unit and the ending service unit in step S104 are not empty, or the forward path sequence is a reverse sequence of the reverse path sequence; and solving a union sequence of the forward path sequence and the reverse sequence of the reverse path sequence screened in the step S106, and taking the union sequence as an optimized path between the initial service unit and the termination service unit in the step S104.
Optionally, the service flow path optimization obtaining module is further configured to: marking the forward path sequence and the reverse path sequence screened in the step S106; judging whether the unmarked forward path sequence and the unmarked reverse path sequence are both null: if yes, ending; if not, using a subsequent service unit in the unmarked forward path sequence as a new initial service unit, using the unmarked forward path sequence as a new forward initial sequence, using a precursor service unit in the unmarked reverse path sequence as a new termination service unit, and using the unmarked reverse path sequence as a new reverse termination sequence; the execution returns to step S105 to step S107.
Optionally, the service flow path optimization obtaining module is further configured to: marking the forward path sequence and the reverse path sequence screened in the step S106; judging whether the unmarked forward path sequence and the unmarked reverse path sequence are both null: if yes, ending; if not, using the subsequent service unit in the unmarked forward path sequence as a new initial service unit; taking a precursor service unit in the unmarked reverse path sequence as a new termination service unit; acquiring all subsequent service units of the new initial service unit according to the service map, and forming a new forward path sequence by the unmarked forward path sequence and the subsequent service units of the new initial service unit; acquiring all precursor service units of the new service termination unit according to the service map; forming a new reverse path sequence by the unmarked reverse path sequence and the precursor service unit of the new termination service unit; taking the marked forward path sequence as a new forward path sequence; taking the marked reverse path sequence as a new reverse path sequence; the execution returns to step S106 to step S107.
Optionally, the apparatus further comprises: an optimal service flow path acquisition module; the optimal service flow path obtaining module is used for: obtaining an optimal path condition, and calculating the consumption of the optimized path by taking the optimal path condition as a weight; and selecting the optimized path with the minimum consumption as the optimal business process path.
Optionally, the apparatus further comprises: a business process path statistic module; the business process path statistic module is used for: counting the total application times of all the optimized paths and the application times of each optimized path in a set time period; and if the ratio of the application times of the optimized paths to the total application times of all the optimized paths is smaller than a set threshold value mu, the service flow optimized paths are the improved paths.
To achieve the above object, according to still another aspect of embodiments of the present invention, there is provided an electronic apparatus including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the processor, and the instructions are executed by the at least one processor to enable the at least one processor to execute the method for establishing the service map provided by the embodiment of the invention.
To achieve the above object, according to still another aspect of embodiments of the present invention, there is provided a computer-readable storage medium storing computer instructions for causing a computer to execute a method of creating a service map provided by the present invention.
One embodiment of the above invention has the following advantages or benefits: according to the embodiment of the invention, all the service units can be automatically combined into a directed graph, namely the service map, according to the directed relationship among the service units, the precursor service units and the subsequent service nodes, the technical problem that all knowledge structure relationships of all the service units need to be mastered when the service map is established in the prior art is solved, the automatic establishment of the service map is realized, the efficiency of establishing the service map is further improved, and a large amount of labor cost is saved.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
fig. 1 is a schematic diagram of a basic flow of a method of establishing a business map according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a preferred flow of a method of building a business map according to an embodiment of the invention;
FIG. 3 is a schematic diagram of a business map of a query system according to an embodiment of the invention;
FIG. 4 is a schematic diagram of a preferred flow of obtaining an optimized path according to an embodiment of the invention;
fig. 5 is a schematic diagram of obtaining an optimal service flow path by using optimal conditions as weights according to an embodiment of the present invention;
fig. 6 is a schematic diagram of basic constituent modules of an apparatus for creating a service map according to an embodiment of the present invention;
FIG. 7 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 8 is a schematic structural diagram of a computer system suitable for implementing a terminal device or a server according to an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
Fig. 1 is a schematic diagram of a basic flow of a method of establishing a business map according to an embodiment of the present invention;
as shown in fig. 1, an embodiment of the present invention provides a method for establishing a service map, including:
s101, acquiring data information of a current service unit;
s102, acquiring a precursor service unit and/or a subsequent service unit of the current service unit according to the data information;
and S103, establishing a directed relationship from the precursor service unit to the current service unit and/or a directed relationship from the current service unit to the subsequent service unit to form a service map.
One service functional unit of one service system is a service unit, the service unit is used as a basic unit, one service system can have one or more service units, and a plurality of service systems have a plurality of service units; the precursor service unit of the current service unit is an upstream service unit of the current service unit in the service flow; and the subsequent service unit of the current service unit is a downstream service unit of the current service unit in the service process. The service flow path refers to a flow path from one service unit, namely a starting service unit, to another service unit, namely a terminating service unit, in the service map.
In some embodiments, the name Ai of the business system can be used as a unique index, and the business system Ai is coded into Si in the form of "S + system self-increment id", wherein Ai and Si are in one-to-one correspondence. In the service system Ai, the name Bj of the service unit is used as a unique index, and the service unit Bj under the code Si of the service system Ai is coded as Sik; the name Bj of a service unit corresponds one-to-one to the code Sik of the service unit.
The data information of the service unit Bj includes: the method comprises the steps of establishing cost values of a service system code Si, a service unit name Bj, a service unit code Sik, a precursor service unit name Bl of the service unit code Sik, a subsequent service unit name Bm of the service unit code Sik, a service unit code Spk of the precursor service unit name Bl, a service unit code Sqk of the subsequent service unit name Bm, and establishing cost values of the precursor service unit Bl and the subsequent service unit Bm. The cost values of the predecessor service unit Bl and the successor service unit Bm include, but are not limited to, for example, a first predecessor cost value representing time resource consumption required for establishing the service unit code Sik and the predecessor service code Spk, a second predecessor cost value representing human resource consumption required for establishing the service unit code Sik and the predecessor service unit code Spk, a third predecessor cost value representing scheduling time required for establishing the service unit code Sik and the predecessor service unit code Spk, and so on. The subsequent cost value, similar to the previous cost value, represents the corresponding resource consumption required by the traffic unit Sik to establish with the subsequent traffic unit Sqk.
Acquiring a service unit code Sik corresponding to the name of a service unit according to data information of the service unit Bj, acquiring a precursor service unit code Spk and a subsequent service unit code Sqk according to the service unit code Sik, establishing a directed relationship from the precursor service unit code Spk to the service unit code Sik and a directed relationship from the service unit code Sik to the subsequent service unit code Sqk, and automatically forming a directed graph taking the service unit code as a node, namely a service map W; or establishing a directed relationship by the service unit name Bj, the name Bl of the precursor service unit and the name Bm of the subsequent service unit to form a service map W.
According to the embodiment of the invention, all the service units can be automatically combined into a directed graph, namely the service map, according to the directed relationship among the service units, the precursor service units and the subsequent service nodes, the technical problem that all knowledge structure relationships of all the service units need to be mastered when the service map is established in the prior art is solved, the automatic establishment of the service map is realized, the efficiency of establishing the service map is further improved, and a large amount of labor cost is saved.
In this embodiment of the present invention, after establishing the directed relationship from the predecessor service unit to the current service unit, and/or after establishing the directed relationship from the current service unit to the successor service unit, the method may further include: marking the current service unit; and in the case that the unmarked predecessor service unit and/or the unmarked successor service unit exist, taking the existing service unit as a new current service unit, and then returning to execute the steps S101 to S103.
The embodiment of the invention realizes the automatic construction of the service map under the condition of a large number of complex service unit relations, thereby improving the efficiency of the construction of the service map under the condition of various service units and complex services and saving a large amount of labor cost and time cost.
Fig. 2 is a schematic flow chart of a preferred method for establishing a service map according to an embodiment of the present invention.
As shown in fig. 2, step S201 obtains all predecessor service units and all successor service units according to a current service unit;
step S202 judges whether the predecessor service unit and the successor service unit of the current service unit are empty, if so, step S206 is executed, otherwise, step S203 is executed;
step S203 marks the current service unit, and establishes and marks: the directed relation between the current service unit and all the precursor service units thereof and/or the directed relation between the current service unit and all the subsequent service units thereof; executing step S204;
wherein, the marked directional relation is not repeatedly established in the step;
step S204 determines whether the previous service unit and the subsequent service unit of the current service unit that are not marked are both empty, if yes, step S209 is executed, otherwise, step S205 is executed;
step S205 takes the unmarked predecessor service unit and/or the unmarked successor service unit as a new current service unit; returning to execute the step S201;
step S206, marking the current service unit, and searching other unmarked service units; step S207 is executed;
step S207 determines whether other unmarked service units are empty, if not, step S208 is executed, and if so, step S209 is executed;
step S208 randomly selecting one other unmarked service unit as a new current service unit; returning to execute the step S201;
step S209 forms all the acquired directed relationships into a service map, and ends.
Taking the establishment of a service map of a certain query system as an example: the inquiry system comprises an advertisement service system unit S1, a public-to-public reconciliation system unit S2, a payment system unit S3, an advertisement settlement system unit S4 and a payment and receipt platform system unit S5. The advertisement service system unit S1 includes a receiving application service unit S11, an advertisement receivable service unit S12 and a service unit S13 for receiving feedback to account information; the common-to-common reconciliation system unit S2 comprises a receiving business unit S21, a receiving business unit S22 and a reconciliation sending and receiving payment platform business unit S23; the payment system unit S3 includes a payment sending real receiving service unit S31; the advertisement settlement system unit S4 includes a charging receipt application service unit S41, a confirmed charging service unit S42; the receiving and payment platform system unit S5 includes a receiving application service unit S51, a cashier accounting service unit S52, a feedback to accounting information service unit S53, and a receiving reconciliation result service unit S54.
The process of establishing the service map is as follows:
(1) the current business unit is a service unit for sending a receiving and applying service S11, a business unit for receiving and feeding back received data to an account information business unit S13 is obtained from a business unit for sending a receiving and applying service S11 according to the data information of the business unit for sending the receiving and applying service, a business unit for receiving and applying fee is obtained from a business unit for receiving and applying fee S41, a business unit for confirming charging S42 and a business unit for receiving and applying fee S51 are obtained from a business unit for sending the receiving and applying service S11;
(2) after judging that the predecessor service unit of the service unit S11 for sending the receiving application is not empty and the successor service unit of the service unit S11 for sending the receiving application is not empty, executing (3);
(3) marking the current service unit and sending a receipt application service unit S11, establishing and marking a directed relationship: the receiving and applying service unit S11 and the oriented relation S13- > S11 of the receiving and feeding back to the account information service unit S13, the receiving and applying service unit S11 and the subsequent service unit fee receiving and applying service unit S41, the charging confirming service unit S42 and the receiving and applying service unit S51 are oriented relations S11- > S41, S11- > S42 and S11- > S51;
(4) all precursor service units which are not marked and send the collection application service unit S11 by the current service unit receive and feed back to the account information service unit S13 and all subsequent service unit fee collection application service units which are not marked S41, the confirmed charging service unit S42 and the received collection application service unit S51 as new current service units;
(5) the data information is inquired, a predecessor business unit receiving the feedback to the account information business unit S13 has a feedback to the account information business unit S53, and a successor business unit receiving the feedback to the account information business unit S13 has a sending collection application business unit S11; the precursor service unit of the charging and receiving application service unit S41 has a service unit S11 for sending and receiving application, and the subsequent service unit of the charging and receiving application service unit S41 has a service unit S52 for paying and accounting; the precursor service unit of the charging service confirming unit S42 has a service unit for sending a receiving application S11, and the subsequent service unit of the charging service confirming unit S42 is coded as null; the predecessor service unit of the receiving applying service unit S51 has a sending receiving applying service unit S11, and the successor service unit of the receiving applying service unit S51 is coded as null;
(6) after judging that the precursor service unit which receives the feedback to the account information service unit S13, the charging and receiving application service unit S41, the charging service unit S42 and the receiving and receiving application service unit S51 is not empty, and the subsequent service unit which receives the feedback to the account information service unit S13 and the charging and receiving application service unit S41 is not empty, executing (7);
(7) marking the current business unit to receive feedback to the account information business unit S13, the fee collection application business unit S41, the confirmed charging business unit S42 and the received collection application business unit S51, establishing and marking the directed relationship: receiving a directed relation S53- > S13 fed back to the accounting information service unit S13 and the predecessor service unit thereof to the accounting information service unit S53, and receiving and charging the payment application service unit S41 and the successor service unit thereof to the service unit S52, and sending the payment application service unit S41- > S52;
(8) all precursor business units of the current business unit which are not marked are fed back to the account information business unit S53 and all subsequent business units which are not marked are taken as new current business units through the cashier accounting business unit S52;
(9) the data information is inquired and obtained, a predecessor business unit which is fed back to an account information business unit S53 is provided with a cashier point account business unit S52 and a received account checking result business unit S54, and a successor business unit which is fed back to the account information business unit S53 is provided with a confirmed charging business unit S42 and a received and fed back account information business unit S13; the former business unit of the cashier and accounting business unit S52 has a charging and receiving application business unit S41, and the latter business unit of the cashier and accounting business unit S52 has a feedback to the account information business unit S53;
(10) after judging that the former business unit fed back to the account information business unit S53 and the cashier check business unit S52 is not empty, and the latter business unit fed back to the account information business unit S53 and the cashier check business unit S52 is not empty, executing (11);
(11) marking the current business unit to be fed back to the account information business unit S53 and the cashier point account business unit S52, establishing and marking a directed relationship: the directed relation S52- > S53 fed back to the account information service unit S53 and the service unit S52 which is the predecessor of the account information service unit S53, the directed relation S54- > S53 fed back to the service unit S53 and the service unit S54 which is the predecessor of the account information service unit S53 and the service unit S53- > S42 which is the successor of the account information service unit S53 and the service unit S42 which confirms the directed relation S53- > S42 of the charging service unit S42;
(12) taking all the precursor business unit receiving reconciliation result business units S54 which are not marked in the current business unit as new current business units;
(13) the query data information is obtained, a front business unit of the business unit for receiving the account checking result S54 comprises an account checking and sending, receiving and paying platform business unit S23, and a subsequent business unit of the business unit for receiving the account checking result S54 comprises an account information business unit S53;
(14) judging that the precursor business unit of the business unit S54 for receiving the account checking result is not empty, and the subsequent business unit is not empty, and executing (15);
(15) marking the current business unit and receiving the reconciliation result business unit S54, establishing and marking a directed relationship: the account checking result receiving service unit S54 checks the oriented relation S23- > S54 of the charge and payment platform sending service unit S23 with the predecessor service unit;
(16) all predecessor business units of the current business unit that are not marked are reconciled to the receipt and payment platform business unit S23 as the new current business unit.
(17) The data information is inquired, a precursor business unit of the reconciliation sending and receiving payment platform business unit S23 comprises a real receiving business unit S21 and a receiving business unit S22, and a subsequent business unit of the reconciliation sending and receiving payment platform business unit S23 comprises a receiving reconciliation result business unit S54;
(18) executing (19) if the predecessor business unit of the reconciliation sending and receiving payment platform business unit S23 is not empty and the successor business unit is not empty;
(19) marking the current business unit reconciliation sending receiving and paying platform business unit S23, establishing and marking the directed relationship: the service unit S23 of the account checking, sending, receiving and paying platform and the service unit S21 of the predecessor thereof receive the directed relationship S21- > S23 of the service unit S21, and the service unit S23 of the account checking, sending, receiving and paying platform and the service unit S22- > S23 of the service unit S22 of the predecessor thereof receive;
(20) all precursor service units which are not marked in the current service unit are coded as new current service units, wherein the precursor service units receive actual service units S21 and receive-response service units S22;
(21) the query data information is obtained, a payment sending real receiving service unit S31 is arranged in a precursor service unit of the real receiving service unit S21, and a reconciliation sending receiving payment platform service unit S23 is arranged in a subsequent service unit of the real receiving service unit S21; the front business unit of the business unit S22 has a business unit S12 for sending advertisements and receiving businesses, and the back business unit of the business unit S22 has a business unit S23 for checking accounts, sending, receiving and paying platforms;
(22) after judging that the predecessor service unit of the receiving real receiving service unit S21 and the receiving-awaiting receiving service unit S22 is not empty, and the successor service unit of the receiving real receiving service unit S21 and the receiving-awaiting receiving service unit S22 is not empty, executing (23);
(23) marking the actual receiving service unit S21 of the current service unit and the receiving service unit S22, establishing and marking a directed relationship: the directed relationship S31- > S21 between the real receiving service unit S21 and the payment sending real receiving service unit S31, and the directed relationship S12- > S22 between the receiving service unit S22 and the sending advertisement receivable service unit S12;
(24) paying all precursor service units which are not marked of the current service unit to send an actual receiving service unit S31 and sending an advertisement receivable service unit S12 as a new current service unit;
(25) the data information is inquired, the predecessor service unit of the payment sending real receiving service unit S31 is empty, and the successor service unit of the payment sending real receiving service unit S31 is provided with a receiving real receiving service unit S21; the predecessor service unit of the service unit S12 for sending the advertisement receivable is empty, and the successor service unit of the service unit S12 for sending the advertisement receivable has a service unit S22 for receiving the advertisement;
(26) executing (27) if the subsequent service unit of the service unit S31 for sending real income and the service unit S12 for sending advertisement receivable are judged not to be empty;
(27) marking the service unit S31 which is paid and sent and actually received by the current service unit and the service unit S12 which is sent and received by the advertisement, wherein the directed relation is marked in (23) by S31- > S21, S12- > S22, and is not repeatedly established;
(28) judging that all the precursor service unit codes which are not marked and all the subsequent service unit codes which are not marked of the current service unit are null;
(29) and composing all the acquired directed relationships into a service map, where fig. 3 is a schematic diagram of a service map of a certain query system according to an embodiment of the present invention.
In the embodiment of the present invention, after step S103, the method may further include: selecting a starting service unit and a terminating service unit; and determining an optimized path between the initial service unit and the termination service unit according to the service unit in the intersection of the subsequent service unit set of the initial service unit and the precursor service unit set of the termination service unit, the initial service unit and the termination service unit.
According to the embodiment of the invention, the optimized path between the initial service unit and the terminal service unit can be automatically calculated under the complex condition according to the service flow map, the initial service unit and the terminal service unit, the obtained optimized path is more complete and comprehensive, and meanwhile, the enterprise informatization efficiency is also improved.
In the embodiment of the present invention, after step S103, the method may further include: selecting a starting service unit and a terminating service unit; for the intersection of the subsequent service unit set of the initial service unit and the precursor service unit set of the termination service unit, taking the subsequent service unit set which does not belong to the intersection as a first set, and taking the precursor service unit set which does not belong to the intersection as a second set; then, a subsequent service unit set of the first service unit in the first set is determined, a precursor service unit set of the first service unit in the second set is determined, and then an optimized path between the initial service unit and the terminating service unit is determined according to the intersection of the determined subsequent service unit set and the precursor service unit set, the first service unit in the first set and the first service unit in the second set, the initial service unit and the terminating service unit.
The embodiment of the invention can automatically calculate the optimized path between the initial service unit and the termination service unit under the complex condition according to the service flow map, the obtained optimized path is more complete and comprehensive, and the enterprise informatization efficiency is improved.
In the embodiment of the present invention, after step S103, the method may further include: s104, selecting a starting service unit and a terminating service unit; acquiring a forward starting sequence, wherein the forward starting sequence comprises the starting service unit; acquiring a reverse termination sequence, wherein the reverse termination sequence comprises the termination service unit; s105, acquiring all subsequent service units of the initial service unit according to the service map, and forming a forward path sequence by the forward initial sequence and the subsequent service units of the initial service unit; acquiring all precursor service units of the service termination unit according to the service map, and forming a reverse path sequence by the reverse termination sequence and the precursor service units of the service termination unit; s106, screening a forward path sequence and a reverse path sequence which meet the following conditions: common service units between the forward path sequence and the reverse path sequence except for the starting service unit and the ending service unit in step S104 are not empty, or the forward path sequence is a reverse sequence of the reverse path sequence; and S107, solving a union sequence of the forward path sequence screened in the step S106 and a reverse sequence of the reverse path sequence, and taking the union sequence as an optimized path between the initial service unit and the termination service unit in the step S104.
According to the embodiment of the invention, the business process path is obtained by adopting a bidirectional search method according to the business map, so that the automatic acquisition of the optimized path between two business units is realized, and the efficiency of personnel for learning the related business process of the enterprise is improved.
In this embodiment of the present invention, after step S107, the method may further include: step S108, marking the forward path sequence and the reverse path sequence screened in the step S106; s109, judging whether the unmarked forward path sequence and the unmarked reverse path sequence are both null; if yes, ending, otherwise executing step S110; s110, taking a subsequent service unit in the unmarked forward path sequence as a new initial service unit; an unlabeled forward path sequence is used as a new forward starting sequence; taking a precursor service unit in an unmarked reverse sequence as a new termination service unit; the unmarked reverse path sequence is used as a new reverse termination sequence; the execution returns to step S105 to step S107.
The embodiment of the invention automatically calculates the optimized path between the two business units under the complex condition according to the business process map, thereby improving the enterprise informatization efficiency.
In this embodiment of the present invention, after step S107, the method may further include: step S111, marking the forward path sequence and the reverse path sequence screened in the step S106; s112, judging whether the unmarked forward path sequence and the unmarked reverse path sequence are both null; if yes, ending, otherwise executing step S113; s113, taking a subsequent service unit in the unmarked forward path sequence as a new initial service unit; taking a precursor service unit in the unmarked reverse path sequence as a new termination service unit; s114, acquiring all subsequent service units of the new initial service unit according to the service map, and forming a new forward path sequence by the unmarked forward path sequence and the subsequent service units of the new initial service unit; acquiring all precursor service units of the new service termination unit according to the service map; forming a new reverse path sequence by the unmarked reverse path sequence and the precursor service unit of the new termination service unit; s115, taking the marked forward path sequence as a new forward path sequence; taking the marked reverse path sequence as a new reverse path sequence; the execution returns to step S106 to step S107.
According to the embodiment of the invention, all optimized paths between two business units can be automatically calculated under the complex condition according to the business process map, the obtained optimized paths are more complete and comprehensive, and meanwhile, the enterprise informatization efficiency is also improved.
Fig. 4 is a schematic diagram of a preferred flow of acquiring an optimized path according to an embodiment of the present invention. As shown in fig. 4:
s401, selecting a starting service unit and a terminating service unit; acquiring a forward starting sequence, wherein the forward starting sequence comprises a starting service unit of the service flow path; acquiring a reverse termination sequence, wherein the reverse termination sequence comprises a termination service unit of the service flow path;
step S402, acquiring all subsequent service units of the initial service unit according to the service map, and acquiring all precursor service units of the terminating service unit according to the service map; whether a subsequent service unit of the initial service unit or a precursor service unit of the termination service unit is empty is judged, if yes, the operation is finished, and if not, the step S403 is executed;
s403, forming a forward path sequence by the forward starting sequence and the subsequent service units of the starting service unit; forming a reverse path sequence by the reverse termination sequence and the precursor service units of the termination service unit;
s404, acquiring a forward path sequence and a reverse path sequence;
step S405, screening a forward path sequence and a reverse path sequence which meet the following conditions:
common service units between the forward path sequence and the reverse path sequence except the starting service unit and the ending service unit are not empty, or the forward path sequence is a reverse sequence of the reverse path sequence;
step S406, finding a union sequence of the forward path sequence screened in the step S405 and the reverse sequence of the reverse path sequence, and obtaining the union sequence as an optimized path of the business process path. Marking the screened forward path sequence and reverse path sequence;
step S407, judging whether the unmarked forward path sequence and the unmarked reverse path sequence are both null; if yes, ending, otherwise executing step S408;
step S408, using the subsequent service unit in the unmarked forward path sequence as a new initial service unit; taking a precursor service unit in the unmarked reverse path sequence as a new termination service unit;
s409, acquiring all subsequent service units of the initial service unit according to the service map, and acquiring all precursor service units of the terminating service unit according to the service map; whether a successor service unit of the initial service unit or a predecessor service unit of the termination service unit is empty, if so, executing a step S410, otherwise, executing a step S411;
step S410, if the successor service unit of the initial service unit is empty, marking the forward path sequence in step S408, if the predecessor service unit of the terminating service unit is empty, marking the reverse path sequence in step S408; returning to execute the step S407;
step S411, forming a new forward path sequence by the unmarked forward path sequence and the subsequent service unit of the new initial service unit; forming a new reverse path sequence by the unmarked reverse path sequence and the precursor service unit of the new termination service unit;
step S412, taking the marked forward path sequence as a new forward path sequence; taking the marked reverse path sequence as a new reverse path sequence; the process returns to step S404.
Step S409 may also be understood as determining whether the successor service unit of the initial service unit and the predecessor service unit of the terminating service unit are successfully obtained, that is, exist; if not, go to step S410, if yes, go to step S411.
Taking the obtained service map of a certain query system as an example, the process of obtaining the service flow path from the service unit sending the receipt application to the service unit confirming the charging is as follows:
(30) acquiring a forward initial sequence, wherein the forward initial sequence comprises an initial service unit of the service flow path; acquiring a reverse termination sequence, wherein the reverse termination sequence comprises a termination service unit of the service flow path; the initial service unit is a service unit for sending a collection application S11, and the termination service unit is a service unit for confirming charging S42; the subsequent service units of the service unit S11 for searching the service map and acquiring the initial service unit forward direction and sending the collection application service unit comprise a charging collection application service unit S41 and a charging confirmation service unit S42; the service unit for searching the reverse service map and acquiring the termination service confirms that the precursor service unit of the charging service unit S42 has a service unit for sending a collection application S11 and a service unit for feeding back to the account information S53.
(31) And judging whether the service termination unit confirms that the precursor service unit or the initial service unit of the charging service unit S42 sends the subsequent service unit of the collection application service unit S11 is empty, if one service is empty, ending the process, otherwise, executing the subsequent step (32).
(32) The service unit determines that the precursor service unit of the charging service unit S42 is not empty and the subsequent service unit of the service unit S11 sent by the initial service unit is not empty, the service unit S11 sent by receiving and applying, the service unit S41 sent by receiving and applying and the service unit S42 sent by receiving and applying, and the service unit S42 sent by receiving and applying and the service unit S11 sent by determining and the service unit S53 sent by receiving and applying respectively form a reverse path sequence.
(33) Acquiring all forward path sequences: seq 11 ═ S11, S41, seq 12 ═ S11, S42; all reverse path sequences seq21 ═ S42, S11, seq22 ═ S42, S53 are obtained.
(34) Screening forward path sequences and reverse path sequences which meet the following conditions: the forward path sequence and the reverse path sequence remove the receiving application service sending unit S11 and the charging service confirming unit S42 and then have a common service unit, or the forward path sequence is a reverse sequence of the reverse path sequence; the screening process is as follows:
seq 11, seq21 and seq22 remove the receiving sending application service unit S11 and confirm that the charging service unit S42 has no common service unit, and seq 11 is not the reverse sequence of seq21 and seq 22;
seq 12, seq21 and seq22, except that the receiving sending application service unit S11 and the charging confirming service unit S42 have no common service unit, however, seq 12 is a reverse sequence of seq 21; seq 12 and seq21 are labeled.
(35) The reverse sequence of seq21 ═ { S42, S11} is seq' 21 ═{ S11, S42}, solving the union of seq 12 and seq' 21, and obtaining an optimized path R of a business process1={S11,S42}。
(36) Judging whether the unmarked forward path sequence and the unmarked reverse path sequence are both null; if so, the process is terminated, otherwise, the following step (37) is continued.
(37) Seq 11 and seq22 were judged to be unlabeled; updating the starting service unit in the new starting service unit name seq 11 to send the subsequent service unit of the receiving application service unit S11, which is the charging receiving application service unit S41; updating the terminating service unit in the new terminating service unit name seq22 confirms the predecessor service unit of the charging service unit S42, which is fed back to the account information service unit S53.
(38) The subsequent service unit of the service unit S41 for obtaining the charging and receiving application of the initial service unit positively by searching the service map comprises a cashier check service unit S52; the predecessor business units fed back to the account information business unit S53 by the reverse acquisition termination business unit include a cashier accounting business unit S52 and a receipt reconciliation result business unit S54.
(39) And judging whether the precursor service unit fed back to the account information service unit S53 and the subsequent service unit of the charging and receiving application service unit S41 are empty, if the precursor service unit fed back to the account information service unit S53 is empty, marking seq22, and if the subsequent service unit of the charging and receiving application service unit S41 is empty, marking seq 11.
(40) The precursor service unit fed back to the account information service unit S53 is judged not to be empty, and the subsequent service unit of the charging and receiving application service unit S41 is also judged not to be empty, so that the unmarked forward path sequence seq 11 and the subsequent service unit of the new initial service unit, the cashier and accounting service unit S52, form a new forward path sequence seq*11 ═ S11, S41, S52 }; forming a new reverse path sequence seq by the unlabeled reverse path sequence seq22 and the predecessor service unit cashier point-check service unit of the new terminating service unit S521 *22={S42,S53, S52}, the unmarked reverse path sequence seq22 and the predecessor service unit receipt reconciliation result service unit S54 of the new terminating service unit form a new reverse path sequence seq2 *22={S42,S53,S54}。
(41) The marked forward path sequence seq 12 is also used as a new forward path sequence; the tagged reverse path sequence seq21 also serves as a new reverse path sequence.
(42) Acquiring all forward path sequences: seq*11 ═ S11, S41, S52, and seq 12 ═ S11, S42; obtaining all reverse path sequences seq21 ═ { S42, S11}, seq ═ S42, S11}, seq1 *22={S42,S53,S52}、seq2 *22={S42,S53,S54}。
(43) Screening forward path sequences and reverse path sequences meeting the conditions, wherein the forward path sequences and the reverse path sequences are screened as follows:
seq*11 and seq*22 removing the service unit S11 for sending a receipt application and confirming that the charging service unit S42 has the same service unit S52 for cashier and accounting; marker seq*11、seq1 *22;
seq 12 is the reverse sequence of seq21, except that path R1Obtained in (35) { S11, S42 }.
(44)seq*The reverse sequence of 22 ═ S42, S53, S52 is seq' 22 ═ S52, S53, S42, and seq is obtained*11 and seq' 22 to obtain a service flow optimization path R2={S11,S41,S52,S53,S42}。
(45) Judging whether the unmarked forward path sequence and the unmarked reverse path sequence are both null; if yes, the process is ended, otherwise, the following step (46) is continued.
(46) Judged seq2 *22 is not labeled; updating a new terminating service Unit to seq2 *22, which is the receive reconciliation results business unit S54.
(47) The business unit of the reverse direction acquisition termination business unit receiving reconciliation result business unit S54 has a reconciliation sending receiving and paying platform business unit S23.
(48) Judging whether a precursor business unit of the business unit S54 for receiving the account checking result is empty or not, and marking seq if the precursor business unit is empty2 *22, if not, executing (49); .
(49) Judging that the precursor business unit of the business unit S54 for receiving the account checking result is not empty, and sending the unmarked reverse path sequence seq2 *22 forms a new reverse path sequence seq with the predecessor service unit reconciliation sending receipt payment platform service unit S23 of the new terminating service unit21 *22={S42,S53,S54,S23}。
(50) The marked forward path sequence is also used as a new forward path sequence; the marked reverse path sequence also serves as a new reverse path sequence.
(51) Acquiring all forward path sequences: seq*11 ═ S11, S41, S52, and seq 12 ═ S11, S42; obtaining all reverse path sequences seq21 ═ { S42, S11}, seq ═ S42, S11}, seq1 *22={S42,S53,S52}、seq21 *22={S42,S53,S54,S23}。
(52) Screening forward path sequences and reverse path sequences meeting the conditions, wherein the forward path sequences and the reverse path sequences are screened as follows:
seq*11 and seq*22 service element for receiving payment application removal S11, service element for confirming billing S42 has the same service element for cashier check S52, but path R2Obtained in (44) { S11, S41, S52, S53, S42 };
seq 12 is the reverse sequence of seq21, except that path R1Obtained in (35) { S11, S42 }.
(53) Judging whether the unmarked forward path sequence and the unmarked reverse path sequence are both null; if yes, the process is ended, otherwise, the following step (54) is continued.
(54) Judged seq21 *22 is not labeled; updating a new terminating service Unit to seq21 *22, which is the receive reconciliation results business unit S23.
(55) The service unit S23 for receiving the reconciliation result includes a real receiving service unit S21 and a receiving service unit S22.
(56) Judging whether the precursor business unit of the business unit S23 for receiving the account checking result is empty or not, if so, markingIf not, execution is performed (57).
(57) Judging that the precursor business unit of the business unit S23 for receiving the account checking result is not empty, and sequencing unmarked reverse pathsA new reverse path sequence is respectively formed by the service unit S21 actually received by the precursor service unit of the new service unit and the service unit S22 received by the precursor service unit of the new service unit
(58) The marked forward path sequence is also used as a new forward path sequence; the marked reverse path sequence also serves as a new reverse path sequence.
(59) Acquiring all forward path sequences: seq*11 ═ S11, S41, S52, and seq 12 ═ S11, S42; obtaining all reverse path sequences seq21 ═ { S42, S11}, seq ═ S42, S11}, seq1 *22={S42,S53,S52}、
(60) Screening forward path sequences and reverse path sequences meeting the conditions, wherein the forward path sequences and the reverse path sequences are screened as follows:
seq*11 and seq*22 service element for receiving payment application removal S11, service element for confirming billing S42 has the same service element for cashier check S52, but path R2Obtained in (44) { S11, S41, S52, S53, S42 };
seq 12 is the reverse sequence of seq21, except that path R1Obtained in (35) { S11, S42 }.
(61) Judging whether the unmarked forward path sequence and the unmarked reverse path sequence are both null; if so, the process is terminated, otherwise, the following step (62) is continued.
(63) Is judged byIs not marked; updating the new terminating service unit name asThe predecessor service unit in (1) receives the real receiving service unit S21,The predecessor service unit in (a) receives the receive service unit S22.
(64) The predecessor business unit of the reverse obtaining receiving real receiving business unit S21 has a payment sending real receiving business unit S31; the predecessor service unit of the reverse direction get receivable service unit S22 has the send advertisement receivable service unit S12.
(65) Judging whether precursor service unit of receiving real service unit S21 and precursor service unit of receiving service unit S22 are presentEmpty, the flag is asserted if the predecessor service unit that received real received service unit S21 is emptyFlag if S12 is null
(66) Judging that the precursor service unit of the receiving actual service unit S21 and the precursor service unit of the receiving response service unit S22 are not empty, and sequencing the unmarked reverse pathForming a new reverse path sequence with the predecessor service unit payment sending real receiving service unit S31 of the new terminating service unitSequence of unlabeled reverse pathsForming a new reverse path sequence with the predecessor service unit sending advertisement pending service unit of the new terminating service unit S12
(67) The marked forward path sequence is also used as a new forward path sequence; the marked reverse path sequence also serves as a new reverse path sequence.
(68) Acquiring all forward path sequences: seq*11 ═ S11, S41, S52, and seq 12 ═ S11, S42; acquiring all reverse path sequences: seq21 ═ S42, S11, seq1 *22={S42,S53,S52}、
(69) Screening forward path sequences and reverse path sequences meeting the conditions, wherein the forward path sequences and the reverse path sequences are screened as follows:
seq*11 and seq*22 service element for receiving payment application removal S11, service element for confirming billing S42 has the same service element for cashier check S52, but path R2Obtained in (44) { S11, S41, S52, S53, S42 };
seq 12 is the reverse sequence of seq21, except that path R1Obtained in (35) { S11, S42 }.
(70) Judging whether the unmarked forward path sequence and the unmarked reverse path sequence are both null; if so, the process is terminated, otherwise, the following step (71) is continued.
(71) Is judged byIs not marked; update the new terminating service unit asThe predecessor business unit payment sending real receiving business unit S31,The predecessor service unit in (a) sends the ad receivable service unit S12.
(72) A precursor service unit of the payment sending real receiving service unit S31 is reversely acquired; and reversely acquiring the precursor service unit of the service unit S12 which is received by the advertisement.
(73) And judging whether the precursor service unit of the payment real-time receiving service unit S31 and the precursor service unit of the advertisement receivable service unit S12 are empty or not.
(74) Precursor service unit for sending real receiving service unit S31 and precursor service unit for sending advertisement receivable service unit S12 after judging paymentAll are empty, mark
(75) Judging that the unmarked forward path sequence and the unmarked reverse path sequence are both null, and ending.
The optimized path of the service flow from the service unit for sending the collection application to the service unit for confirming the charging is obtained as follows: r1={S11,S42},R2={S11,S41,S52,S53,S42}。
In this embodiment of the present invention, after obtaining all the optimized paths, the method may further include: obtaining an optimal path condition, and calculating the consumption of the optimized path by taking the optimal path condition as a weight; and selecting the optimized path with the minimum consumption as the optimal business process path.
According to the embodiment of the invention, the initial service unit, the termination service unit and the optimal path condition are input according to the service flow map, and the optimal service flow path can be automatically calculated. Meanwhile, the optimal business process path can be selected preferentially according to the actual conditions, and the enterprise informatization efficiency is greatly improved.
Fig. 5 is a schematic diagram of obtaining an optimal service flow path by using optimal conditions as weights according to an embodiment of the present invention. As shown in fig. 5, taking the obtained service flow path from the service unit sending the receipt application to the service unit confirming the charging as an example, the optimal service flow path is calculated, and the specific process is as follows:
the optimal path condition d is selected as (d1, d2, d3), wherein d1 represents the working time of each person, d2 represents the scheduling time, d2 days later, the work can be started, and d3 represents the number of workers. The optimized path of the service flow from the service unit for sending the collection application to the service unit for confirming the charging is obtained as follows: r1={S11,S42},R2(S11, S41, S52, S53, S42) as the number of service unitsThe information is obtained that the weights of S11 to S41 are d1 ═ 4, 2, 2}, the weights of S41 to S52 are d2 ═ 2, 1, 3}, the weights of S52 to S53 are d3 ═ 8, 1, 1}, the weights of S53 to S42 are d4 ═ 8, 1, 1}, and the weights of S11 to S42 are d5 ═ 16, 20, 1 }.
The first condition is as follows: selecting the working hours and the number of workers of each person as the optimal path conditions, and setting d1 and d3 as effective weights;
service flow optimization path R1Resource consumption of (2):
service flow optimization path R2Resource consumption of (2):
wherein,represents a path Rj′The working hours of each person on the ith' road segment,represents a path Rj′The i 'th segment is the number of workers, l represents the number of segments of the traffic flow path, and j' is 1,2, …, l ', l' is the number of traffic flow optimization paths from the same originating traffic unit to the same terminating traffic unit.
Q1<Q2Then the service flow optimizes the path R1And { S11, S42} is the optimal business process path.
Case two: and d2 is set as effective weight by taking the shortest scheduling time as the optimal path condition.
Service flow optimization path R1Minimum duration of
Service flow optimization path R2Minimum period time T2′=min{2,1,1,1}=1;
Wherein,represents a path Rj′The scheduling time of the ith' road segment.
T1<T2Then the service flow optimizes the path R2The path of the optimal business process is { S11, S41, S52, S53, S42 }.
In this embodiment of the present invention, after obtaining all the optimized paths, the method may further include: counting the total application times of all the optimized paths and the application times of each optimized path in a set time period; and if the ratio of the application times of the optimized paths to the total application times of all the optimized paths is smaller than a set threshold value mu, the service flow optimized paths are the improved paths. The improvable paths may be deleted, or re-optimization of the improvable paths or redesigning of the business process may be prompted.
The embodiment of the invention can discover the service flow path with unreasonable design by counting the application times of the service flow path, delete the path or prompt the optimization of the path, thereby playing the role of optimizing the service flow. Due to the display of the business map, if a plurality of optimized paths exist from one business unit to another business unit and the intersection points are numerous, the repeated design of the optimized paths is determined, the part of the business process can be simplified by directly seeing from the display of the map, the business process with few use times is eliminated, the repeated useless design is removed, the optimized and simplified business process map is realized, and the informatization efficiency of enterprises is greatly improved.
Fig. 6 is a schematic diagram of basic constituent modules of an apparatus for creating a service map according to an embodiment of the present invention.
As shown in fig. 6, an apparatus 600 for creating a service map according to an embodiment of the present invention includes: a service unit acquisition module 601, a front and back service unit acquisition module 602, and a self-learning service map building module 603; the service unit obtaining module 601 is configured to obtain data information of a current service unit; the previous and subsequent service unit obtaining module 602 is configured to obtain a predecessor service unit and/or a successor service unit of the current service unit according to the data information; the self-learning service map building module 603 is configured to build a directional relationship from the predecessor service unit to the current service unit, and/or a directional relationship from the current service unit to the successor service unit, so as to form a service map.
According to the embodiment of the invention, all the service units can be automatically combined into one directed graph according to the directed relationship among the service units, the precursor service units and the subsequent service nodes, namely, the service map is established, the technical problem that all knowledge structure relationships of all the service units need to be mastered when the service map is established in the prior art is solved, the automatic establishment of the service map is realized, the efficiency of establishing the service map is further improved, and a large amount of labor cost is saved.
In this embodiment of the present invention, the self-learning service map building module 603 may further be configured to: marking the current service unit; marking the current service unit; and in the case that the unmarked predecessor service unit and/or the unmarked successor service unit exist, taking the existing service unit as a new current service unit, and then returning to execute the steps S101 to S103.
The embodiment of the invention realizes the automatic construction of the service map under the condition of a large number of complex service unit relations, thereby improving the efficiency of the construction of the service map under the condition of various service units and complex services and saving a large amount of labor cost and time cost.
In the embodiment of the present invention, the apparatus may further include: a service flow path optimization acquisition module; the business process path optimization acquisition module may be configured to: selecting a starting service unit and a terminating service unit; and determining an optimized path between the initial service unit and the termination service unit according to the service unit in the intersection of the subsequent service unit set of the initial service unit and the precursor service unit set of the termination service unit, the initial service unit and the termination service unit.
In the embodiment of the present invention, the apparatus may further include: a service flow path optimization acquisition module; the business process path optimization acquisition module may be configured to: selecting a starting service unit and a terminating service unit; for the intersection of the subsequent service unit set of the initial service unit and the precursor service unit set of the termination service unit, taking the subsequent service unit set which does not belong to the intersection as a first set, and taking the precursor service unit set which does not belong to the intersection as a second set; then, a subsequent service unit set of the first service unit in the first set is determined, a precursor service unit set of the first service unit in the second set is determined, and then an optimized path between the initial service unit and the terminating service unit is determined according to the intersection of the determined subsequent service unit set and the precursor service unit set, the first service unit in the first set and the first service unit in the second set, the initial service unit and the terminating service unit.
The apparatus may further include: a service flow path optimization acquisition module; the service flow path optimization obtaining module may be configured to: selecting a starting service unit and a terminating service unit; acquiring a forward starting sequence, wherein the forward starting sequence comprises a starting service unit of the service flow path; acquiring a reverse termination sequence, wherein the reverse termination sequence comprises a termination service unit of the service flow path; acquiring all subsequent service units of the initial service unit according to the service map, and forming a forward path sequence by the forward initial sequence and the subsequent service units of the initial service unit; acquiring all precursor service units of the service termination unit according to the service map, and forming a reverse path sequence by the reverse termination sequence and the precursor service units of the service termination unit; screening forward path sequences and reverse path sequences which meet the following conditions: common service units between the forward path sequence and the reverse path sequence except for the starting service unit and the ending service unit in step S104 are not empty, or the forward path sequence is a reverse sequence of the reverse path sequence; and solving a union sequence of the forward path sequence and the reverse sequence of the reverse path sequence screened in the step S106, and taking the union sequence as an optimized path between the initial service unit and the termination service unit in the step S104.
According to the embodiment of the invention, the business process path is obtained by adopting a bidirectional search method according to the business map, so that the automatic acquisition of the business process optimization path is realized, and the efficiency of personnel for learning the related business process of the enterprise is improved.
In this embodiment of the present invention, the service flow path optimization obtaining module may be further configured to: marking the forward path sequence and the reverse path sequence screened in the step S106; judging whether the unmarked forward path sequence and the unmarked reverse path sequence are both null: if yes, ending; if not, using a subsequent service unit in the unmarked forward path sequence as a new initial service unit, using the unmarked forward path sequence as a new forward initial sequence, using a precursor service unit in the unmarked reverse path sequence as a new termination service unit, and using the unmarked reverse path sequence as a new reverse termination sequence; the execution returns to step S105 to step S107.
The embodiment of the invention automatically calculates the optimized path of the business process under the complex condition according to the business process map, the initial business unit and the termination business unit, thereby improving the enterprise informatization efficiency.
In this embodiment of the present invention, the service flow path optimization obtaining module may be further configured to: marking the forward path sequence and the reverse path sequence screened in the step S106; judging whether the unmarked forward path sequence and the unmarked reverse path sequence are both null: if yes, ending; if not, using the subsequent service unit in the unmarked forward path sequence as a new initial service unit; taking a precursor service unit in the unmarked reverse path sequence as a new termination service unit; acquiring all subsequent service units of the new initial service unit according to the service map, and forming a new forward path sequence by the unmarked forward path sequence and the subsequent service units of the new initial service unit; acquiring all precursor service units of the new service termination unit according to the service map; forming a new reverse path sequence by the unmarked reverse path sequence and the precursor service unit of the new termination service unit; taking the marked forward path sequence as a new forward path sequence; taking the marked reverse path sequence as a new reverse path sequence; the execution returns to step S106 to step S107.
The embodiment of the invention can automatically calculate the optimized paths of all the business processes under the complex condition according to the business process map, the initial business unit and the termination business unit, the obtained optimized paths are more complete and comprehensive, and the enterprise informatization efficiency is improved.
In the embodiment of the present invention, the apparatus may further include: an optimal service flow path acquisition module; the optimal service flow path obtaining module may be configured to: obtaining an optimal path condition, and calculating the consumption of the optimized path by taking the optimal path condition as a weight; and selecting the optimized path with the minimum consumption as the optimal business process path.
According to the embodiment of the invention, the initial service unit, the termination service unit and the optimal path condition are input according to the service flow map, and the optimal service flow path can be automatically calculated. Meanwhile, the optimal business process path can be selected preferentially according to the actual conditions, and the enterprise informatization efficiency is greatly improved.
In the embodiment of the present invention, the apparatus may further include: a business process path statistic module; the business process path statistics module may be configured to: counting the total application times of all the optimized paths and the application times of each optimized path in a set time period; and if the ratio of the application times of the optimized paths to the total application times of all the optimized paths is smaller than a set threshold value mu, the service flow optimized paths are the improved paths. The improvable paths may be deleted, or re-optimization of the improvable paths or redesigning of the business process may be prompted.
The apparatus may further include: a display module; the display module is used for displaying all the optimized paths including the optimal business process path.
The embodiment of the invention can find the service flow path with unreasonable design by counting the application times of the service flow path, delete the path or prompt the optimization of the path, and can play a role in optimizing the service flow again. Due to the display of the business map, if a plurality of optimized paths exist from one business unit to another business unit and the intersection points are numerous, the repeated design of the optimized paths is determined, the part of the business process can be simplified by directly seeing from the display of the map, the business process with few use times is eliminated, the repeated useless design is removed, the optimized and simplified business process map is realized, and the informatization efficiency of enterprises is greatly improved.
Fig. 7 illustrates an exemplary system architecture 700 of a method of building a business map or an apparatus based on building a business map to which embodiments of the present invention may be applied.
As shown in fig. 7, the system architecture 700 may include terminal devices 701, 702, 703, a network 704, and a server 705. The network 704 serves to provide a medium for communication links between the terminal devices 701, 702, 703 and the server 705. Network 704 may include various connection types, such as wired, wireless communication links, or fiber optic cables, to name a few.
A user may use the terminal devices 701, 702, 703 to interact with a server 705 over a network 704, to receive or send messages or the like. Various communication client applications, such as shopping applications, web browser applications, search applications, instant messaging tools, mailbox clients, social platform software, and the like, may be installed on the terminal devices 701, 702, and 703.
The terminal devices 701, 702, 703 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 705 may be a server that provides various services, such as a background management server that supports shopping websites browsed by users using the terminal devices 701, 702, and 703. The background management server can analyze and process the received data such as the product information query request and feed back the processing result such as the target push information to the terminal equipment.
It should be noted that the method for establishing a service map provided by the embodiment of the present invention is generally executed by the server 705, and accordingly, the apparatus for establishing a service map is generally disposed in the server 705.
It should be understood that the number of terminal devices, networks, and servers in fig. 7 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
The invention also provides an electronic device and a readable storage medium according to the embodiment of the invention.
The electronic device of the present invention includes: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to cause the at least one processor to perform the method of creating a service map provided by the present invention.
The computer readable storage medium of the present invention stores computer instructions for causing the computer to execute the method for building a business map provided by the present invention.
Referring now to FIG. 8, shown is a block diagram of a computer system 800 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 8 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 8, the computer system 800 includes a Central Processing Unit (CPU)801 that can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)802 or a program loaded from a storage section 808 into a Random Access Memory (RAM) 803. In the RAM 803, various programs and data necessary for the operation of the system 800 are also stored. The CPU 801, ROM 802, and RAM 803 are connected to each other via a bus 804. An input/output (I/O) interface 805 is also connected to bus 804.
The following components are connected to the I/O interface 805: an input portion 806 including a keyboard, a mouse, and the like; an output section 807 including a signal such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 808 including a hard disk and the like; and a communication section 809 including a network interface card such as a LAN card, a modem, or the like. The communication section 809 performs communication processing via a network such as the internet. A drive 810 is also connected to the I/O interface 805 as necessary. A removable medium 811 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 810 as necessary, so that a computer program read out therefrom is mounted on the storage section 808 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 809 and/or installed from the removable medium 811. The computer program executes the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 801.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor, comprising: the system comprises a service unit acquisition module, a front and back service unit acquisition module and a self-learning service map building module. The names of these modules do not in some cases form a limitation on the modules themselves, and for example, the service unit acquiring module may also be described as a "module acquiring data information of a current service unit".
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: s101, acquiring data information of a current service unit; s102, acquiring a precursor service unit and/or a subsequent service unit of the current service unit according to the data information; and S103, establishing a directed relationship from the precursor service unit to the current service unit and/or a directed relationship from the current service unit to the subsequent service unit to form a service map.
According to the embodiment of the invention, all the service units can be automatically combined into a directed graph, namely the service map, according to the directed relationship among the service units, the precursor service units and the subsequent service nodes, the technical problem that all knowledge structure relationships of all the service units need to be mastered when the service map is established in the prior art is solved, the automatic establishment of the service map is realized, the efficiency of establishing the service map is further improved, and a large amount of labor cost is saved.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (20)

1. A method of building a business map, comprising:
s101, acquiring data information of a current service unit;
s102, acquiring a precursor service unit and/or a subsequent service unit of the current service unit according to the data information;
and S103, establishing a directed relationship from the precursor service unit to the current service unit and/or a directed relationship from the current service unit to the subsequent service unit to form a service map.
2. The method of claim 1, wherein after establishing a directed relationship from the predecessor business unit to the current business unit, and/or from the current business unit to the successor business unit, the method further comprises:
marking the current service unit;
and in the case that the unmarked predecessor service unit and/or the unmarked successor service unit exist, taking the existing service unit as a new current service unit, and then returning to execute the steps S101 to S103.
3. The method according to claim 1, further comprising, after step S103:
selecting a starting service unit and a terminating service unit;
and determining an optimized path between the initial service unit and the termination service unit according to the service unit in the intersection of the subsequent service unit set of the initial service unit and the precursor service unit set of the termination service unit, the initial service unit and the termination service unit.
4. The method according to claim 1, further comprising, after step S103:
selecting a starting service unit and a terminating service unit;
for the intersection of the subsequent service unit set of the initial service unit and the precursor service unit set of the termination service unit, taking the subsequent service unit set which does not belong to the intersection as a first set, and taking the precursor service unit set which does not belong to the intersection as a second set; then, a subsequent service unit set of the first service unit in the first set is determined, a precursor service unit set of the first service unit in the second set is determined, and then an optimized path between the initial service unit and the terminating service unit is determined according to the intersection of the determined subsequent service unit set and the precursor service unit set, the first service unit in the first set and the first service unit in the second set, the initial service unit and the terminating service unit.
5. The method according to claim 1, further comprising, after step S103:
s104, selecting a starting service unit and a terminating service unit;
acquiring a forward starting sequence, wherein the forward starting sequence comprises the starting service unit;
acquiring a reverse termination sequence, wherein the reverse termination sequence comprises the termination service unit;
s105, acquiring all subsequent service units of the initial service unit according to the service map, and forming a forward path sequence by the forward initial sequence and the subsequent service units of the initial service unit;
acquiring all precursor service units of the service termination unit according to the service map, and forming a reverse path sequence by the reverse termination sequence and the precursor service units of the service termination unit;
s106, screening a forward path sequence and a reverse path sequence which meet the following conditions:
common traffic units between the forward path sequence and the reverse path sequence except the start traffic unit and the end traffic unit in step S104 are not empty,
or the forward path sequence is a reverse sequence of the reverse path sequence;
and S107, solving a union sequence of the forward path sequence screened in the step S106 and a reverse sequence of the reverse path sequence, and taking the union sequence as an optimized path between the initial service unit and the termination service unit in the step S104.
6. The method according to claim 5, after step S107, further comprising:
step S108, marking the forward path sequence and the reverse path sequence screened in the step S106;
s109, judging whether the unmarked forward path sequence and the unmarked reverse path sequence are both null; if yes, ending, otherwise executing step S110;
s110, taking a subsequent service unit in the unmarked forward path sequence as a new initial service unit; an unlabeled forward path sequence is used as a new forward starting sequence;
taking a precursor service unit in the unmarked reverse path sequence as a new termination service unit; the unmarked reverse path sequence is used as a new reverse termination sequence;
the execution returns to step S105 to step S107.
7. The method according to claim 5, after step S107, further comprising:
step S111, marking the forward path sequence and the reverse path sequence screened in the step S106;
s112, judging whether the unmarked forward path sequence and the unmarked reverse path sequence are both null; if yes, ending, otherwise executing step S113;
s113, taking a subsequent service unit in the unmarked forward path sequence as a new initial service unit; taking a precursor service unit in the unmarked reverse path sequence as a new termination service unit;
s114, acquiring all subsequent service units of the new initial service unit according to the service map, and forming a new forward path sequence by the unmarked forward path sequence and the subsequent service units of the new initial service unit;
acquiring all precursor service units of the new service termination unit according to the service map; forming a new reverse path sequence by the unmarked reverse path sequence and the precursor service unit of the new termination service unit;
s115, taking the marked forward path sequence as a new forward path sequence; taking the marked reverse path sequence as a new reverse path sequence; the execution returns to step S106 to step S107.
8. The method of claim 5, wherein after obtaining all of the optimized paths, further comprising:
obtaining an optimal path condition, and calculating the consumption of the optimized path by taking the optimal path condition as a weight;
and selecting the optimized path with the minimum consumption as the optimal business process path.
9. The method of claim 5, wherein after obtaining all of the optimized paths, further comprising:
counting the total application times of all the optimized paths and the application times of each optimized path in a set time period;
and if the ratio of the application times of the optimized paths to the total application times of all the optimized paths is smaller than a set threshold value mu, the service flow optimized paths are the improved paths.
10. An apparatus for creating a business map, comprising: the system comprises a business unit acquisition module, a front and rear business unit acquisition module and a self-learning business map building module; wherein,
the service unit obtaining module is used for obtaining the data information of the current service unit;
the front and back service unit acquisition module is used for acquiring a precursor service unit and/or a successor service unit of the current service unit according to the data information;
the self-learning service map building module is used for building a directed relationship from the precursor service unit to the current service unit and/or a directed relationship from the current service unit to the subsequent service unit so as to form a service map.
11. The apparatus of claim 10, wherein the self-learning build traffic map module is further configured to:
marking the current service unit;
and in the case that the unmarked predecessor service unit and/or the unmarked successor service unit exist, taking the existing service unit as a new current service unit, and then returning to execute the steps S101 to S103.
12. The apparatus of claim 10, further comprising: a service flow path optimization acquisition module; the business process path optimization acquisition module is used for:
selecting a starting service unit and a terminating service unit;
and determining an optimized path between the initial service unit and the termination service unit according to the service unit in the intersection of the subsequent service unit set of the initial service unit and the precursor service unit set of the termination service unit, the initial service unit and the termination service unit.
13. The apparatus of claim 10, further comprising: a service flow path optimization acquisition module; the business process path optimization acquisition module is used for:
selecting a starting service unit and a terminating service unit;
for the intersection of the subsequent service unit set of the initial service unit and the precursor service unit set of the termination service unit, taking the subsequent service unit set which does not belong to the intersection as a first set, and taking the precursor service unit set which does not belong to the intersection as a second set; then, a subsequent service unit set of the first service unit in the first set is determined, a precursor service unit set of the first service unit in the second set is determined, and then an optimized path between the initial service unit and the terminating service unit is determined according to the intersection of the determined subsequent service unit set and the precursor service unit set, the first service unit in the first set and the first service unit in the second set, the initial service unit and the terminating service unit.
14. The apparatus of claim 10, further comprising: a service flow path optimization acquisition module;
the service flow path optimization acquisition module is configured to:
selecting a starting service unit and a terminating service unit;
acquiring a forward starting sequence, wherein the forward starting sequence comprises a starting service unit of the service flow path;
acquiring a reverse termination sequence, wherein the reverse termination sequence comprises a termination service unit of the service flow path;
acquiring all subsequent service units of the initial service unit according to the service map, and forming a forward path sequence by the forward initial sequence and the subsequent service units of the initial service unit;
acquiring all precursor service units of the service termination unit according to the service map, and forming a reverse path sequence by the reverse termination sequence and the precursor service units of the service termination unit;
screening forward path sequences and reverse path sequences which meet the following conditions:
common traffic units between the forward path sequence and the reverse path sequence except the start traffic unit and the end traffic unit in step S104 are not empty,
or the forward path sequence is a reverse sequence of the reverse path sequence;
and solving a union sequence of the forward path sequence and the reverse sequence of the reverse path sequence screened in the step S106, and taking the union sequence as an optimized path between the initial service unit and the termination service unit in the step S104.
15. The apparatus of claim 14, wherein the business process path optimization acquisition module is further configured to:
marking the forward path sequence and the reverse path sequence screened in the step S106;
judging whether the unmarked forward path sequence and the unmarked reverse path sequence are both null: if yes, ending;
if not, using a subsequent service unit in the unmarked forward path sequence as a new initial service unit, using the unmarked forward path sequence as a new forward initial sequence, using a precursor service unit in the unmarked reverse path sequence as a new termination service unit, and using the unmarked reverse path sequence as a new reverse termination sequence; the execution returns to step S105 to step S107.
16. The apparatus of claim 14, wherein the business process path optimization acquisition module is further configured to:
marking the forward path sequence and the reverse path sequence screened in the step S106;
judging whether the unmarked forward path sequence and the unmarked reverse path sequence are both null: if yes, ending;
if not, using the subsequent service unit in the unmarked forward path sequence as a new initial service unit; taking a precursor service unit in the unmarked reverse path sequence as a new termination service unit;
acquiring all subsequent service units of the new initial service unit according to the service map, and forming a new forward path sequence by the unmarked forward path sequence and the subsequent service units of the new initial service unit;
acquiring all precursor service units of the new service termination unit according to the service map; forming a new reverse path sequence by the unmarked reverse path sequence and the precursor service unit of the new termination service unit;
taking the marked forward path sequence as a new forward path sequence; taking the marked reverse path sequence as a new reverse path sequence; the execution returns to step S106 to step S107.
17. The apparatus of claim 14, further comprising: an optimal service flow path acquisition module;
the optimal service flow path obtaining module is used for:
obtaining an optimal path condition, and calculating the consumption of the optimized path by taking the optimal path condition as a weight;
and selecting the optimized path with the minimum consumption as the optimal business process path.
18. The apparatus of claim 14, further comprising: a business process path statistic module;
the business process path statistic module is used for:
counting the total application times of all the optimized paths and the application times of each optimized path in a set time period;
and if the ratio of the application times of the optimized paths to the total application times of all the optimized paths is smaller than a set threshold value mu, the service flow optimized paths are the improved paths.
19. An electronic device, comprising:
at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor for storing one or more programs;
when executed by the at least one processor, cause the one or more processors to implement the method of any one of claims 1-9.
20. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-9.
CN201710890355.6A 2017-09-27 2017-09-27 Method and device for establishing business map Active CN109558964B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201710890355.6A CN109558964B (en) 2017-09-27 2017-09-27 Method and device for establishing business map

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201710890355.6A CN109558964B (en) 2017-09-27 2017-09-27 Method and device for establishing business map

Publications (2)

Publication Number Publication Date
CN109558964A true CN109558964A (en) 2019-04-02
CN109558964B CN109558964B (en) 2021-07-30

Family

ID=65863771

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201710890355.6A Active CN109558964B (en) 2017-09-27 2017-09-27 Method and device for establishing business map

Country Status (1)

Country Link
CN (1) CN109558964B (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101776995A (en) * 2010-01-04 2010-07-14 北京航空航天大学 Self-adaptive combined service optimization method and device
CN101959092A (en) * 2010-09-28 2011-01-26 中兴通讯股份有限公司 WSON (Wavelength Switch Optical Node) route acquisition method and device
CN102004839A (en) * 2010-12-17 2011-04-06 北京优纳科技有限公司 Method for optimizing full-node traversal path
CN102831492A (en) * 2012-06-06 2012-12-19 西安电子科技大学 Method for balancing production line in industrial sewing industry
US20140222492A1 (en) * 2013-02-04 2014-08-07 The Boeing Company Alpha-Chain Constraints For Process Planning
CN104035864A (en) * 2013-12-17 2014-09-10 北京邮电大学 Path generation method based on contradiction fragment mode
CN106529748A (en) * 2015-09-10 2017-03-22 富士通株式会社 Rule processing method and device, and rule testing method and device

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101776995A (en) * 2010-01-04 2010-07-14 北京航空航天大学 Self-adaptive combined service optimization method and device
CN101959092A (en) * 2010-09-28 2011-01-26 中兴通讯股份有限公司 WSON (Wavelength Switch Optical Node) route acquisition method and device
CN102004839A (en) * 2010-12-17 2011-04-06 北京优纳科技有限公司 Method for optimizing full-node traversal path
CN102831492A (en) * 2012-06-06 2012-12-19 西安电子科技大学 Method for balancing production line in industrial sewing industry
US20140222492A1 (en) * 2013-02-04 2014-08-07 The Boeing Company Alpha-Chain Constraints For Process Planning
CN104035864A (en) * 2013-12-17 2014-09-10 北京邮电大学 Path generation method based on contradiction fragment mode
CN106529748A (en) * 2015-09-10 2017-03-22 富士通株式会社 Rule processing method and device, and rule testing method and device

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
LI XIANG等: "On the union of intermediate nodes of shortest paths", 《JOURNAL OF COMBINATORIAL OPTIMIZATION》 *
刘灿灿 等: "基于路径平衡的工作流费用优化方法", 《软件学报》 *
胡延忠 等: "《编译原理》", 31 July 2007, 华中科技大学出版社 *

Also Published As

Publication number Publication date
CN109558964B (en) 2021-07-30

Similar Documents

Publication Publication Date Title
CN107633358B (en) Facility site selection and distribution method and device
CN111038906B (en) Order sorting method and device
CN110473036B (en) Method and device for generating order number
CN111127181A (en) Voucher bookkeeping method and device
CN111367663A (en) Service processing method and device
CN111044062A (en) Path planning and recommending method and device
CN111429092B (en) Method, apparatus, device and computer readable medium for paying an accumulation fund
CN110807612A (en) Method and device for determining residual capacity
CN113900907B (en) Mapping construction method and system
CN113190558A (en) Data processing method and system
CN112927066A (en) Batch deduction method and device
CN112884427A (en) Process management method and device supporting multiple service sources
CN109558964B (en) Method and device for establishing business map
CN112433757A (en) Method and device for determining interface calling relationship
CN116664060A (en) Method, system and device for generating expense reimbursement basic data
CN112184095A (en) Method and device for sending mail
CN112668949B (en) Method and device for picking goods
CN113449941B (en) Method and device for distributing picking tasks, electronic equipment and storage medium
CN114202210A (en) Task allocation method and device
CN112102068A (en) ETC business handling method and system
CN110120958B (en) Task pushing method and device based on crowdsourcing mode
CN112907223A (en) Method and device for processing service information
CN111402044A (en) Data configuration system and data configuration method thereof
CN113496386A (en) Method and device for combined charging
CN111786801A (en) Method and device for charging based on data flow

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant