CN117689436A - Full-flow visualization method, device, system and storage medium - Google Patents
Full-flow visualization method, device, system and storage medium Download PDFInfo
- Publication number
- CN117689436A CN117689436A CN202311299898.2A CN202311299898A CN117689436A CN 117689436 A CN117689436 A CN 117689436A CN 202311299898 A CN202311299898 A CN 202311299898A CN 117689436 A CN117689436 A CN 117689436A
- Authority
- CN
- China
- Prior art keywords
- target
- determining
- transportation
- information
- 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.)
- Pending
Links
- 238000003860 storage Methods 0.000 title claims abstract description 19
- 238000007794 visualization technique Methods 0.000 title claims abstract description 16
- 230000000007 visual effect Effects 0.000 claims abstract description 48
- 230000002068 genetic effect Effects 0.000 claims abstract description 45
- 238000000034 method Methods 0.000 claims abstract description 39
- 238000012800 visualization Methods 0.000 claims description 30
- 238000012986 modification Methods 0.000 claims description 21
- 230000004048 modification Effects 0.000 claims description 21
- 238000004519 manufacturing process Methods 0.000 claims description 17
- 230000004044 response Effects 0.000 claims description 9
- 230000035772 mutation Effects 0.000 claims description 6
- 238000012216 screening Methods 0.000 claims description 4
- 230000008569 process Effects 0.000 abstract description 13
- 238000013461 design Methods 0.000 description 17
- 230000006870 function Effects 0.000 description 9
- 238000012545 processing Methods 0.000 description 8
- 238000013528 artificial neural network Methods 0.000 description 7
- 238000010586 diagram Methods 0.000 description 6
- 230000000694 effects Effects 0.000 description 6
- 238000004891 communication Methods 0.000 description 5
- 238000004590 computer program Methods 0.000 description 5
- 230000003287 optical effect Effects 0.000 description 5
- 230000001360 synchronised effect Effects 0.000 description 4
- 210000000349 chromosome Anatomy 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 238000005457 optimization Methods 0.000 description 3
- 230000003068 static effect Effects 0.000 description 3
- 238000012549 training Methods 0.000 description 3
- 238000003491 array Methods 0.000 description 2
- 238000013473 artificial intelligence Methods 0.000 description 2
- 235000019800 disodium phosphate Nutrition 0.000 description 2
- 238000012544 monitoring process Methods 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 238000006467 substitution reaction Methods 0.000 description 2
- 108700028369 Alleles Proteins 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000013527 convolutional neural network Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000009313 farming Methods 0.000 description 1
- 239000000446 fuel Substances 0.000 description 1
- 108090000623 proteins and genes Proteins 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The application provides a full-flow visualization method, a device, a system and a storage medium, wherein the method comprises the following steps: acquiring a plurality of transaction information of a plurality of transaction websites; carrying out semantic recognition according to the transaction information, and determining target keywords; displaying a visual operation interface and acquiring a target transaction corresponding to the target keyword input by the visual operation interface, wherein the visual operation interface comprises a plurality of information inputs; determining a selectable origin of the target transaction and a destination of the target transaction, and determining a plurality of transportation paths in an optimal path genetic algorithm according to the selectable origin and the destination; determining a target path in the plurality of transportation paths, and generating a target order based on a corresponding target selection origin in the target path; and determining logistics information corresponding to the target order, and displaying the target transaction and the target path in real time based on the logistics information. The method and the system can monitor the whole process from generation to transportation of the order, and ensure timeliness of dispatching of the order.
Description
Technical Field
The present disclosure relates to the field of artificial intelligence technologies, and in particular, to a full-flow visualization method, system, device, system, and storage medium.
Background
Currently, with the development of artificial intelligence and internet of things, online shopping is more and more common in daily life of people, and people can purchase fresh food through the internet, for a buyer user in an online transaction platform, when purchasing fresh food, the source and the transportation duration of the food are important aspects of their attention, and generally, merchants generate orders according to the time sequence of user ordering, and cannot monitor the whole process from generation to transportation of the orders, so how to construct a full-flow visual order becomes an urgent problem to be solved.
Disclosure of Invention
The embodiment of the application provides a full-flow visualization method, which is characterized in that a plurality of transaction information of a plurality of transaction websites is obtained, so that semantic recognition can be carried out on the plurality of transaction information, a target keyword is determined in the plurality of transaction information, further, a target transaction corresponding to the target keyword input by a visual operation interface can be obtained, further, a plurality of transportation paths can be determined through an optimal path genetic algorithm based on a destination and an optional production place in the target transaction, further, a target path can be determined in the plurality of transportation paths, a target order is determined according to a target selection production place corresponding to the target path, the target transaction and the target path are displayed in real time by finally determining logistics information corresponding to the target order, the whole process from generation to transportation of the order can be monitored, and timeliness of dispatching of the order is ensured.
In order to achieve the above purpose, the present application adopts the following technical scheme:
in a first aspect, a full-flow visualization method and system are provided, the method comprising: acquiring a plurality of transaction information of a plurality of transaction websites; carrying out semantic recognition according to the transaction information, and determining target keywords; displaying a visual operation interface and acquiring a target transaction corresponding to the target keyword input by the visual operation interface, wherein the visual operation interface comprises a plurality of information input frames; determining a selectable origin of the target transaction and a destination of the target transaction, and determining a plurality of transportation paths in an optimal path genetic algorithm according to the selectable origin and the destination; determining a target path in the plurality of transportation paths, and generating a target order based on a corresponding target selection origin in the target path; and determining logistics information corresponding to the target order, and displaying the target transaction and the target path in real time based on the logistics information.
According to the method of the first aspect, the plurality of transaction information of the plurality of transaction websites is acquired, so that semantic recognition can be performed on the plurality of transaction information, the target keywords are determined in the plurality of transaction information, the target transactions corresponding to the target keywords input by the visual operation interface can be acquired, the plurality of transportation paths can be determined through the optimal path genetic algorithm based on the destination and the selectable production place in the target transactions, the target paths can be determined in the plurality of transportation paths, the target orders are determined according to the target selection production place corresponding to the target paths, the logistics information corresponding to the target orders is finally determined to display the target transactions and the target paths in real time, the whole process from generation to transportation of the orders can be monitored, and the timeliness of dispatching of the orders is guaranteed.
With reference to the first aspect, in one possible design, the method further includes: responding to the selection operation of the visual operation interface, and determining a target production place corresponding to the selection operation; determining the target path according to the target place of origin and generating a target order; determining modification options of the target order in the SQL library, and displaying the modification options on the visual operation interface; and responding to the selection operation of the modification options of the visual operation interface, acquiring modification information, and determining the flow information for modifying the target order according to the modification information.
According to a possible design scheme, the embodiment can determine the modifiable item of the target order in the SQL library, so as to modify the modifiable item to modify the target order, thereby improving convenience.
With reference to the first aspect, in one possible design, the determining a plurality of transportation paths according to the selectable origin and the destination with an optimal path genetic algorithm includes: determining a staging area based on the selectable origin and the destination; generating a network topology map based on the staging area, the alternative origin and the destination; and taking a plurality of topological routes in the network topological graph as an initial population of a genetic algorithm, performing iterative evolution of the genetic algorithm, and determining a plurality of transportation paths.
According to a possible design scheme, the embodiment firstly determines a transit place according to a selectable origin and a destination, then generates a network topological graph according to the transit place, the selectable origin and the destination, so that a plurality of topological routes can be determined in the network topological graph, the plurality of topological routes are used as initial populations of a genetic algorithm, further, iterative optimization of the genetic algorithm is carried out according to the plurality of topological routes, a plurality of transportation routes are determined, and the accuracy of the genetic algorithm and the accuracy of a plurality of transportation routes are ensured.
With reference to the first aspect, in one possible design, the performing iterative evolutionary of a genetic algorithm with the plurality of topological routes in the network topology map as an initial population of the genetic algorithm, determining a plurality of transport paths includes: and taking a plurality of topological routes in the network topological graph as an initial population of a genetic algorithm, applying a crossover operator and a mutation operator, and performing iterative evolution of the genetic algorithm to determine a plurality of transportation paths.
According to a possible design scheme, the iterative optimization of the genetic algorithm is performed by applying the crossover operator and the mutation operator, so that the iterative efficiency of the genetic algorithm and the accuracy of a plurality of determined transportation paths are ensured.
With reference to the first aspect, in one possible design, the determining a target path among the plurality of transport paths includes: determining transport condition information corresponding to each of the plurality of transport paths and transport resource information corresponding to each of the plurality of transport paths; determining road section standard codes corresponding to the transportation paths according to the transportation condition information and the transportation resource information; screening the plurality of transportation paths according to the road section standard codes, and determining at least one reference transportation path; and determining the transportation path with the shortest transportation duration as a target path in the reference transportation path.
According to a possible design scheme, according to the embodiment, the road section standard codes corresponding to the plurality of transportation paths are determined through the transportation condition information corresponding to the plurality of transportation paths and the transportation resource information corresponding to the plurality of transportation paths, so that the plurality of transportation paths are conveniently screened according to the road section standard codes, at least one reference transportation path is determined, further, a target path can be determined in the at least one reference transportation path, and the accuracy of the target path is ensured.
With reference to the first aspect, in one possible design, the determining a target path among the plurality of transport paths includes: displaying the transport paths, and displaying the selected transport paths in response to a selection operation of the transport paths; displaying the transportation time length and the transportation route of the selected transportation route; and determining a target path in response to the dispatch selection, and generating first prompt information.
According to a possible design scheme, the embodiment displays the selected transportation path and the transportation duration and transportation path of the selected transportation path based on the selection operation in the plurality of transportation paths, so that an operator can conveniently select a target path, and a target order can be generated based on the target path selected by the operator.
With reference to the first aspect, in one possible design, the determining, according to semantic recognition of the plurality of transaction information, a target transaction corresponding to the target keyword includes: carrying out semantic recognition according to the transaction information, and determining target keywords; displaying a visual operation interface and acquiring target transactions corresponding to the target keywords input by the visual operation interface, wherein the visual operation interface comprises a plurality of information input frames.
According to a possible design scheme, the target transaction corresponding to the target keyword input by the Ying lake is obtained through the displayed visual operation interface, so that the accuracy of the target transaction is ensured.
With reference to the first aspect, in a possible design, the displaying the target order and the target path in real time based on the logistics information includes: determining a license plate number of the transport vehicle in the logistics information; determining positioning information of the transport vehicle according to the license plate number; and updating the transportation condition of the target order according to the positioning information, and displaying the position of the transportation vehicle on the target path.
According to a possible design scheme, the license plate number of the transport vehicle is obtained through logistics information in the target order, so that the transport vehicle is monitored in real time, the transport condition of the target order is updated in real time according to positioning information of the transport vehicle, and visualization of the transport process is achieved.
In a second aspect, there is provided a full-flow visualization apparatus, the apparatus comprising: the acquisition module is used for acquiring a plurality of transaction information of a plurality of transaction websites; the target keyword determining module is used for carrying out semantic recognition according to the transaction information and determining target keywords; the display module is used for displaying a visual operation interface and acquiring target transactions corresponding to the target keywords input in the visual operation interface, and the visual operation interface comprises a plurality of information input frames; a plurality of transportation path determining modules for determining a selectable origin of the target transaction and a destination of the target transaction, and determining a plurality of transportation paths according to the selectable origin and the destination in an optimal path genetic algorithm; a target order determining module, configured to determine a target path among the plurality of transportation paths, and generate a target order based on a corresponding target selection origin in the target path; and the display module is used for determining the logistics information corresponding to the target order and displaying the target transaction and the target path in real time based on the logistics information.
In addition, the technical effects of the full-flow visualization system described in the second aspect may refer to the technical effects of the full-flow visualization method described in the first aspect, which are not described herein.
In a third aspect, a full-flow visualization system is provided, wherein the system comprises: a processor; a memory having stored thereon computer readable instructions which, when executed by the processor, implement any one of the full flow visualization methods of the first aspect.
In addition, the technical effects of the intelligent full-flow visualization system according to the third aspect may refer to the technical effects of the full-flow visualization device according to the second aspect, which are not described herein.
In a fourth aspect, embodiments of the present application provide a computer readable storage medium having stored therein program code that is callable by a processor to perform any one of the full-flow visualizer methods of the first aspect.
Drawings
Fig. 1 is an application scenario diagram of a full-flow visualization method provided in an embodiment of the present application;
FIG. 2 is a flowchart of a full-flow visualization method provided in an embodiment of the present application;
FIG. 3 is a schematic diagram of a SOL library of a full-flow visualization method according to an embodiment of the present disclosure;
fig. 4 is a block diagram of a full-flow visualization device according to an embodiment of the present disclosure;
fig. 5 is a schematic structural diagram of a full-flow visualization system according to an embodiment of the present application.
Detailed Description
The technical solutions in the present application are described below with reference to the accompanying drawings.
In the embodiments of the present application, words such as "exemplary," "for example," and the like are used to indicate by way of example, illustration, or description. Any embodiment or design described herein as "exemplary" is not necessarily to be construed as preferred or advantageous over other embodiments or designs. Rather, the term use of an example is intended to present concepts in a concrete fashion. Furthermore, in embodiments of the present application, the meaning of "and/or" may be that of both, or may be that of either, optionally one of both.
In the embodiments of the present application, "image" and "picture" may be sometimes used in combination, and it should be noted that the meaning of the expression is consistent when the distinction is not emphasized. "of", "corresponding" and "corresponding" are sometimes used in combination, and it should be noted that the meaning of the expression is consistent when the distinction is not emphasized.
In the embodiments of the present application, sometimes subscripts such as W 1 May be misidentified as a non-subscripted form such as W1, the meaning it is intended to express being consistent when de-emphasizing the distinction.
With the increase of demands of people for various products, the audience of each product in the market is expanded explosively, and further, more and more product suppliers, sellers and the like select a method for distributing orders by adopting a time sequence of order placement and randomly generate distribution information according to the production place of the orders in order to reduce customer service pressure and operation cost. Therefore, fresh similar products cannot be dispatched at the position closest to the user, the experience of the user is extremely low, and operators cannot timely modify information in the order by monitoring the whole flow of the order, so that the logistic information is not updated timely and dispatched timely.
Therefore, in order to overcome the above-mentioned drawbacks, the embodiment of the present application can perform semantic recognition on a plurality of transaction information by acquiring a plurality of transaction information of a plurality of transaction websites, so as to determine a target transaction corresponding to a target keyword in the plurality of transaction information, further determine a/35764 song transportation path through an optimal path genetic algorithm based on a destination and a selectable production place in the target transaction, further determine a target path in the plurality of transportation paths, determine a target order according to a target selection production place corresponding to the target path, and finally determine logistics information corresponding to the target order to display the target transaction and the target path in real time, so that the whole process from generation to transportation of the order can be monitored, and timeliness of dispatch of the order is ensured.
Fig. 1 is a schematic diagram of an application scenario, shown in fig. 1, including a full-flow visualization system 110 and an electronic device 120 communicatively coupled to the full-flow visualization system 110, according to an embodiment of the present application. The electronic device 120 may be a mobile phone, a computer, a tablet computer, a smart watch, etc. that is communicatively connected to the full-flow visualization system. Alternatively, the communication connection may be a wireless network connection, a virtual local area network connection, an API communication interface connection, or the like.
For some embodiments, after the full-flow visualization system 110 generates order information, the target order may be sent to an electronic device communicatively connected to the full-flow visualization system, so that order information, logistics information, and the like corresponding to the target order may be checked in the electronic device, and meanwhile, a background person may fill in the information of the target order on the electronic device and display the information of the target order on the full-flow visualization system, so that the information of the target order may be displayed in time.
Referring to fig. 2, fig. 2 shows a flowchart of a full-flow visualization method according to an embodiment of the present application, where the method includes steps 210 to 250.
Step 210: a plurality of transaction information for a plurality of transaction websites is obtained.
Step 220: and carrying out semantic recognition according to the transaction information, and determining target keywords.
Step 230: displaying a visual operation interface and acquiring target transactions corresponding to the target keywords input by the visual operation interface, wherein the visual operation interface comprises a plurality of information input frames.
Step 240: a selectable origin of the target transaction and a destination of the target transaction are determined, and a plurality of transportation paths are determined in an optimal path genetic algorithm based on the selectable origin and the destination.
Step 250: and determining a target path in the plurality of transportation paths, and generating a target order based on a corresponding target selection place of origin in the target path.
Step 260: and determining logistics information corresponding to the target order, and displaying the target transaction and the target path in real time based on the logistics information.
For some embodiments, semantic recognition may be performed through an NLP algorithm, optionally, training may be performed in advance for a neural network used in the NLP algorithm, a plurality of sample data and key labels corresponding to the sample data may be preset, then the sample data is input into the neural network to perform keyword recognition, a recognition result is obtained, then the key label indicated by the recognition result is compared with the key label corresponding to the sample data, so as to determine a loss value of the loss function, when the loss value is greater than or equal to a loss threshold value, parameters of the neural network are adjusted, training is performed again according to the neural network after parameter adjustment, and when the loss value of the loss function is less than the loss threshold value, it may be determined that training of the neural network is completed. Alternatively, the neural network may be a convolutional neural network, or may be other neural network structure.
Alternatively, the target keyword may be an egg, so as to manage the corresponding order of the egg product, and the target keyword may also be an egg product or the like.
In some embodiments, the full-flow visualization method further comprises: responding to the selection operation of the visual operation interface, and determining a target production place corresponding to the selection operation; determining the target path according to the target place of origin and generating a target order; determining modification options of the target order in the SQL library, and displaying the modification options on the visual operation interface; and responding to the selection operation of the modification options of the visual operation interface, acquiring modification information, and determining the flow information for modifying the target order according to the modification information. As shown in fig. 3, operations may be performed in the SQL library.
For some embodiments, after determining the target transaction corresponding to the target keyword, a plurality of production places or warehouses corresponding to the target keyword may be queried at the cloud, where the production places may be determined according to the destination in the target transaction, and after determining the destination, the corresponding plurality of production places or warehouses may be queried within a preset range of the destination, so as to ensure that a plurality of transportation paths determined according to a plurality of selectable production places and destinations are all optimal paths.
Alternatively, a unique optimal transportation path may be determined by an optimal path genetic algorithm for each of the selectable origin and destination, whereby multiple transportation paths between multiple selectable sites and destinations may be obtained.
In some embodiments, the step 230 includes: determining a staging area based on the selectable origin and the destination; generating a network topology map based on the staging area, the alternative origin and the destination; and taking a plurality of topological routes in the network topological graph as an initial population of a genetic algorithm, performing iterative evolution of the genetic algorithm, and determining a plurality of transportation paths.
For some embodiments, the product needs to be transferred through a fixed transportation transfer station, so that monitoring of the product in the transportation process and logistics information of the product are guaranteed.
Optionally, since there are multiple transit places, the paths from each selectable place to the destination can be multiple, in order to determine the optimal path from each selectable place to the destination, a network topology map can be generated according to the transit places, the selectable places and the destination, so as to determine multiple topology routes in the network topology map, each topology route comprises multiple topology nodes, each topology node corresponds to a transit place, and the topology routes in the network topology map are used as an initial population of a genetic algorithm, so that the optimal transportation path corresponding to each selectable place and the destination is determined according to the optimal path genetic algorithm, and multiple transportation paths are obtained.
Optionally, the performing iterative evolutionary of the genetic algorithm with the plurality of topological routes in the network topology as the initial population of the genetic algorithm, determining a plurality of transport paths includes: and taking a plurality of topological routes in the network topological graph as an initial population of a genetic algorithm, applying a crossover operator and a mutation operator, and performing iterative evolution of the genetic algorithm to determine a plurality of transportation paths.
Wherein crossover operator is the main operation process in genetic algorithm for generating new individual, and it exchanges partial chromosome between two individuals with a certain probability, and mutation operator is to replace the gene value of some loci in the individual chromosome coding string with other alleles of the loci, so as to form a new individual. In this embodiment, the cross grandchildren and the compiler perform iterative optimization of the genetic algorithm using transit nodes in each topological route as chromosomes.
In some embodiments, the step 250 includes: determining transport condition information corresponding to each of the plurality of transport paths and transport resource information corresponding to each of the plurality of transport paths; determining road section standard codes corresponding to the transportation paths according to the transportation condition information and the transportation resource information; screening the plurality of transportation paths according to the road section standard codes, and determining at least one reference transportation path; and determining the transportation path with the shortest transportation duration as a target path in the reference transportation path.
For some embodiments, the transportation resource information includes, but is not limited to, transportation information, transportation personnel information, labor cost information, route fuel consumption parameters, and reliability coefficients for the point of transportation. The transportation condition information may be traffic information of a transportation path. The road section standard code and the limit code can be formed by combining at least two of characters, binary digits and other symbols, the limit code can be codes corresponding to paths with traffic control in the transportation paths, the codes can be codes generated by coding the paths after determining a plurality of transportation paths, then the transportation condition information of each transportation path is obtained, and the paths with the traffic control are determined according to the transportation condition information, so that the limit code is determined.
In other embodiments, different information types in the transportation resource information can be randomly combined into a plurality of constraint sets, and at least one information type is selected from the constraint sets; and taking the single constraint set as an input constraint condition of the optimal path genetic algorithm, generating an initial transportation path for obtaining the corresponding constraint set, and deleting the same initial transportation path to obtain a plurality of transportation paths.
In some embodiments, the step 250 further comprises: displaying the transport paths, and displaying the selected transport paths in response to a selection operation of the transport paths; displaying the transportation time length and the transportation route of the selected transportation route; and determining a target path in response to the dispatch selection, and generating first prompt information.
For some embodiments, the operator may select a target path on the full-flow visualization system, to dispatch orders for the target transaction according to the target path selected by the user, and so on.
Optionally, when the mouse of the operator is placed on any one of the multiple transport paths, the whole-flow visualization system may display the transport path length and the transport duration of the corresponding transport path, so that the operator may conveniently select the target path according to the transport path length and the transport duration of the mind.
In some embodiments, the step 220 includes: carrying out semantic recognition according to the transaction information, and determining target keywords; displaying a visual operation interface and acquiring target transactions corresponding to the target keywords input by the visual operation interface, wherein the visual operation interface comprises a plurality of information input frames.
For some embodiments, the user-defined order information input by the user on the visual operation interface is obtained, and then a plurality of information input frames are deleted or added on the visual operation interface according to the user-defined order information, so that the flexibility degree is high, and the operation is convenient and quick. For example, when the user performs batch commodity recording, the user can click an input frame adding option of the visual operation interface (the click command is user-defined order information input by the user), so that a plurality of information input frames for filling in customer information and commodity information corresponding to the customer information are added in a user-defined manner. Or, the user can delete some selected and filled information input frames on the visual operation interface so as to reduce the information filling amount and ensure the simplicity of the visual operation interface.
In some embodiments, the step 250 includes: determining a license plate number of the transport vehicle in the logistics information; determining positioning information of the transport vehicle according to the license plate number; and updating the transportation condition of the target order according to the positioning information, and displaying the position of the transportation vehicle on the target path.
In the embodiment of the application, the plurality of transaction information of the plurality of transaction websites is acquired, so that semantic recognition can be performed on the plurality of transaction information, the target transaction corresponding to the target keyword is determined in the plurality of transaction information, further, the song transportation path can be determined by the optimal path genetic algorithm based on the destination and the selectable production place in the target transaction, further, the target path can be determined in the plurality of transportation paths, the target order is determined according to the target selection production place corresponding to the target path, finally, the logistics information corresponding to the target order is determined to display the target transaction and the target path in real time, the whole process from generation to transportation of the order can be monitored, and the timeliness of dispatching the order is ensured.
Illustratively, fig. 4 is a schematic structural diagram of a full-flow visualization device 300 provided in an embodiment of the present application. As shown in fig. 4, the full-flow visualization method apparatus 300 includes: an acquisition module 310, a target transaction determination module 320, a plurality of transportation path determination modules 330, a target order determination module 340, and a display module 350.
For ease of illustration, fig. 4 shows only the main components of the full-flow visualization device 300.
The acquiring module 310 is configured to acquire a plurality of transaction information of a plurality of transaction websites.
The target keyword determining module 320 is configured to perform semantic recognition according to the transaction information, and determine a target keyword.
The display module 320 is configured to display a visual operation interface, and obtain a target transaction corresponding to the target keyword input in the visual operation interface, where the visual operation interface includes a plurality of information input boxes.
Further, the full-flow visualization method apparatus 300 further includes: the response module is used for responding to the selection operation of the visual operation interface and determining a target production place corresponding to the selection operation; the target order generation module is used for determining the target path according to the target place of origin and generating a target order; the display module is used for determining modification options of the target order in the SQL library and displaying the modification options on the visual operation interface; and the modification information acquisition module is used for responding to the selection operation of the modification options of the visual operation interface and acquiring modification information so as to determine the flow information for modifying the target order according to the modification information.
Further, the plurality of transport path determination modules 330 include: determining a staging area based on the selectable origin and the destination; generating a network topology map based on the staging area, the alternative origin and the destination; and taking a plurality of topological routes in the network topological graph as an initial population of a genetic algorithm, performing iterative evolution of the genetic algorithm, and determining a plurality of transportation paths.
Further, the plurality of transport path determination modules 330 further includes: and taking a plurality of topological routes in the network topological graph as an initial population of a genetic algorithm, applying a crossover operator and a mutation operator, and performing iterative evolution of the genetic algorithm to determine a plurality of transportation paths.
A target order determining module 340, configured to determine a target path among the plurality of transportation paths, and generate a target order based on a corresponding target selection origin in the target path.
Further, the target order determination module 340 includes: determining transport condition information corresponding to each of the plurality of transport paths and transport resource information corresponding to each of the plurality of transport paths; determining road section standard codes corresponding to the transportation paths according to the transportation condition information and the transportation resource information; screening the plurality of transportation paths according to the road section standard codes, and determining at least one reference transportation path; and determining the transportation path with the shortest transportation duration as a target path in the reference transportation path.
Further, the target order determining module 340 further includes: displaying the transport paths, and displaying the selected transport paths in response to a selection operation of the transport paths; displaying the transportation time length and the transportation route of the selected transportation route; and determining a target path in response to the dispatch selection, and generating first prompt information.
And the display module 350 is configured to determine the logistics information corresponding to the target order, and display the target transaction and the target path in real time based on the logistics information.
Further, the display module 350 includes: determining a license plate number of the transport vehicle in the logistics information; determining positioning information of the transport vehicle according to the license plate number; and updating the transportation condition of the target order according to the positioning information, and displaying the position of the transportation vehicle on the target path.
As shown in fig. 5, the full-flow visualization system may include the full-flow visualization apparatus shown in fig. 4 described above. Alternatively, the full-flow visualization system 110 may include the processor 2001.
Optionally, the full flow visualization system 110 may also include a memory 2002 and a transceiver 2003.
The processor 2001 may be connected to the memory 2002 and the transceiver 2003 via a communication bus, for example.
The various components of the overall flow visualization system 110 are described in detail below in conjunction with FIG. 5:
the processor 2001 is a control center of the whole-flow visualization system 110, and may be one processor or a plurality of processing elements. For example, processor 2001 is one or more central processing units (central processing unit, CPU), but may also be an integrated circuit (application specific integrated circuit, ASIC), or one or more integrated circuits configured to implement embodiments of the present application, such as: one or more microprocessors (digital signalprocessor, DSPs), or one or more field programmable gate arrays (field programmable gate array, FPGAs).
Alternatively, processor 2001 may perform various functions of full-flow visualization system 110 by running or executing software programs stored in memory 2002, and invoking data stored in memory 2002.
In a particular implementation, the processor 2001 may include one or more CPUs, such as CPU0 and CPU1 shown in FIG. 5, as an example.
In particular implementations, as one embodiment, the full flow visualization system 110 may also include multiple processors, such as processor 2001 and processor 2004 shown in FIG. 5. Each of these processors may be a single-core processor (single-CPU) or a multi-core processor (multi-CPU). A processor herein may refer to one or more devices, circuits, and/or processing cores for processing data (e.g., computer program instructions).
The memory 2002 is used for storing a software program for executing the solution of the present application, and is controlled by the processor 2001 to execute the program, and the specific implementation may refer to the above method embodiment, which is not described herein again.
Alternatively, memory 2002 may be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (random access memory, RAM) or other type of dynamic storage device that can store information and instructions, or an electrically erasable programmable read-only memory (electricallyerasable programmable read-only memory, EEPROM), a compact disc read-only memory (compact disc read-only memory) or other optical disk storage, optical disk storage (including compact disc, laser disc, optical disc, digital versatile disc, blu-ray disc, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, without limitation. Memory 2002 may be integrated with processor 2001 or may exist separately and be coupled to processor 2001 via interface circuitry (not shown in fig. 5) of smart culture system 110, as embodiments of the present application are not specifically limited in this regard.
A transceiver 2003 for communicating with a network device or with a terminal device.
Alternatively, transceiver 2003 may include a receiver and a transmitter (not separately shown in fig. 5). The receiver is used for realizing the receiving function, and the transmitter is used for realizing the transmitting function.
Alternatively, transceiver 2003 may be integrated with processor 2001 or may exist separately and be coupled to processor 2001 through interface circuitry (not shown in fig. 5) of router 110, as embodiments of the present application are not specifically limited.
It should be noted that the configuration of the full-flow visualization system 110 shown in fig. 5 is not limited to this router, and an actual smart farming system may include more or fewer components than shown, or some components may be combined, or a different arrangement of components.
In addition, the technical effects of the full-flow visualization system 110 may refer to the technical effects of the data transmission method described in the above method embodiments, which are not described herein.
It is to be appreciated that the processor 2001 in the embodiments of the present application may be a central processing unit (central processing unit, CPU), which may also be other general purpose processors, digital signal processors (digital signal processor, DSP), application specific integrated circuits (applicationspecific integrated circuit, ASIC), off-the-shelf programmable gate arrays (field programmable gate array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, or the like. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
It should also be appreciated that the memory in embodiments of the present application may be either volatile memory or nonvolatile memory, or may include both volatile and nonvolatile memory. The nonvolatile memory may be a read-only memory (ROM), a programmable read-only memory (programmableROM, PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (electricallyEPROM, EEPROM), or a flash memory, among others. The volatile memory may be random access memory (random access memory, RAM) which acts as an external cache. By way of example but not limitation, many forms of random access memory (randomaccess memory, RAM) are available, such as Static RAM (SRAM), dynamic Random Access Memory (DRAM), synchronous Dynamic Random Access Memory (SDRAM), double data rate synchronous dynamic random access memory (DDR SDRAM), enhanced synchronous dynamic random access memory (enhancedSDRAM, ESDRAM), synchronous Link DRAM (SLDRAM), and direct memory bus RAM (DR RAM).
The above embodiments may be implemented in whole or in part by software, hardware (e.g., circuitry), firmware, or any other combination. When implemented in software, the above-described embodiments may be implemented in whole or in part in the form of a computer program product. The computer program product comprises one or more computer instructions or computer programs. When the computer instructions or computer program are loaded or executed on a computer, the processes or functions described in accordance with the embodiments of the present application are all or partially produced. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from one website site, computer, server, or data center to another website site, computer, server, or data center by wired (e.g., infrared, wireless, microwave, etc.). The computer readable storage medium may be any available medium that can be accessed by a computer or a data storage device such as a server, data center, etc. that contains one or more sets of available media. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium. The semiconductor medium may be a solid state disk.
It should be understood that the term "and/or" is merely an association relationship describing the associated object, and means that three relationships may exist, for example, a and/or B may mean: there are three cases, a alone, a and B together, and B alone, wherein a, B may be singular or plural. In addition, the character "/" herein generally indicates that the associated object is an "or" relationship, but may also indicate an "and/or" relationship, and may be understood by referring to the context.
In the present application, "at least one" means one or more, and "a plurality" means two or more. "at least one of" or the like means any combination of these items, including any combination of single item(s) or plural items(s). For example, at least one (one) of a, b, or c may represent: a, b, c, a-b, a-c, b-c, or a-b-c, wherein a, b, c may be single or plural.
It should be understood that, in various embodiments of the present application, the sequence numbers of the foregoing processes do not mean the order of execution, and the order of execution of the processes should be determined by the functions and internal logic thereof, and should not constitute any limitation on the implementation process of the embodiments of the present application.
Those of ordinary skill in the art will appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, or combinations of computer software and electronic hardware. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, and are not repeated herein.
In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The functions, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present application may be embodied essentially or in a part contributing to the prior art or in a part of the technical solution, in the form of a software product stored in a storage medium, including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the methods described in the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a read-only memory (ROM), a random access memory (random access memory, RAM), a magnetic disk, or an optical disk, or other various media capable of storing program codes.
The foregoing is merely specific embodiments of the present application, but the scope of the present application is not limited thereto, and any person skilled in the art can easily think about changes or substitutions within the technical scope of the present application, and the changes and substitutions are intended to be covered by the scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.
Claims (10)
1. A full-flow visualization method, the method comprising:
acquiring a plurality of transaction information of a plurality of transaction websites;
carrying out semantic recognition according to the transaction information, and determining target keywords;
displaying a visual operation interface and acquiring a target transaction corresponding to the target keyword input by the visual operation interface, wherein the visual operation interface comprises a plurality of information input frames;
determining a selectable origin of the target transaction and a destination of the target transaction, and determining a plurality of transportation paths in an optimal path genetic algorithm according to the selectable origin and the destination;
determining a target path in the plurality of transportation paths, and generating a target order based on a corresponding target selection origin in the target path;
And determining logistics information corresponding to the target order, and displaying the target transaction and the target path in real time based on the logistics information.
2. The method according to claim 1, wherein the method further comprises:
responding to the selection operation of the visual operation interface, and determining a target production place corresponding to the selection operation;
determining the target path according to the target place of origin and generating a target order;
determining modification options of the target order in the SQL library, and displaying the modification options on the visual operation interface;
and responding to the selection operation of the modification options of the visual operation interface, acquiring modification information, and determining the flow information for modifying the target order according to the modification information.
3. The method of claim 1, wherein said determining a plurality of transportation paths in an optimal path genetic algorithm based on said selectable origin and said destination comprises:
determining a staging area based on the selectable origin and the destination;
generating a network topology map based on the staging area, the alternative origin and the destination;
and taking a plurality of topological routes in the network topological graph as an initial population of a genetic algorithm, performing iterative evolution of the genetic algorithm, and determining a plurality of transportation paths.
4. A method according to claim 3, wherein said performing iterative evolutionary evolution of genetic algorithms using a plurality of topological routes in the network topology as an initial population of genetic algorithms, determining a plurality of transport paths, comprises:
and taking a plurality of topological routes in the network topological graph as an initial population of a genetic algorithm, applying a crossover operator and a mutation operator, and performing iterative evolution of the genetic algorithm to determine a plurality of transportation paths.
5. The method of claim 1, wherein said determining a target path among said plurality of transport paths comprises:
determining transport condition information corresponding to each of the plurality of transport paths and transport resource information corresponding to each of the plurality of transport paths;
determining road section standard codes corresponding to the transportation paths according to the transportation condition information and the transportation resource information;
screening the plurality of transportation paths according to the road section standard codes, and determining at least one reference transportation path;
and determining the transportation path with the shortest transportation duration as a target path in the reference transportation path.
6. The method of claim 1, wherein said determining a target path among said plurality of transport paths comprises:
Displaying the transport paths, and displaying the selected transport paths in response to a selection operation of the transport paths;
displaying the transportation time length and the transportation route of the selected transportation route;
and determining a target path in response to the dispatch selection, and generating first prompt information.
7. The method of claim 1, wherein the displaying the target order and the target path in real-time based on the logistics information comprises
Determining a license plate number of the transport vehicle in the logistics information;
determining positioning information of the transport vehicle according to the license plate number;
and updating the transportation condition of the target order according to the positioning information, and displaying the position of the transportation vehicle on the target path.
8. A full-flow visualization apparatus, the apparatus comprising:
the acquisition module is used for acquiring a plurality of transaction information of a plurality of transaction websites;
the target keyword determining module is used for carrying out semantic recognition according to the transaction information and determining target keywords;
the display module is used for displaying a visual operation interface and acquiring target transactions corresponding to the target keywords input in the visual operation interface, and the visual operation interface comprises a plurality of information input frames;
A plurality of transportation path determining modules for determining a selectable origin of the target transaction and a destination of the target transaction, and determining a plurality of transportation paths according to the selectable origin and the destination in an optimal path genetic algorithm;
a target order determining module, configured to determine a target path among the plurality of transportation paths, and generate a target order based on a corresponding target selection origin in the target path;
and the display module is used for determining the logistics information corresponding to the target order and displaying the target transaction and the target path in real time based on the logistics information.
9. A full-flow visualization system, the system comprising:
a processor;
a memory having stored thereon computer readable instructions which, when executed by the processor, implement the method of any of claims 1 to 7.
10. A computer readable storage medium having stored therein program code which is callable by a processor to perform the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311299898.2A CN117689436A (en) | 2023-10-09 | 2023-10-09 | Full-flow visualization method, device, system and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311299898.2A CN117689436A (en) | 2023-10-09 | 2023-10-09 | Full-flow visualization method, device, system and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117689436A true CN117689436A (en) | 2024-03-12 |
Family
ID=90135941
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311299898.2A Pending CN117689436A (en) | 2023-10-09 | 2023-10-09 | Full-flow visualization method, device, system and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117689436A (en) |
-
2023
- 2023-10-09 CN CN202311299898.2A patent/CN117689436A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107437137A (en) | Risk identification in supply chain | |
| US10373117B1 (en) | Inventory optimization based on leftover demand distribution function | |
| CN110516984B (en) | Method and apparatus for generating delivery path information | |
| CN109345166B (en) | Method and apparatus for generating information | |
| US20200294073A1 (en) | Platform for In-Memory Analysis of Network Data Applied to Logistics For Best Facility Recommendations with Current Market Information | |
| CN113763093A (en) | User portrait-based item recommendation method and device | |
| US20200019933A1 (en) | Dynamic aggregation of queries | |
| CN112184348A (en) | Order data processing method and device, electronic equipment and medium | |
| CN110309142B (en) | Method and device for rule management | |
| Fan et al. | Distributed forecasting and ant colony optimization for the bike-sharing rebalancing problem with unserved demands | |
| CN113658597B (en) | Voice ordering method, device, electronic equipment and computer readable medium | |
| CN112150184A (en) | Click rate estimation method and system, computer system and computer readable medium | |
| CN113887783A (en) | Storage replenishment prediction method, device, equipment and storage medium | |
| CN112288484A (en) | Commodity automatic pricing method and device, electronic equipment and storage medium | |
| CN111222663B (en) | Data processing method and system, computer system and computer readable medium | |
| CN116777324A (en) | Logistics network scheduling method and device | |
| CN111507541A (en) | Goods quantity prediction model construction method, goods quantity measurement device and electronic equipment | |
| CN117689436A (en) | Full-flow visualization method, device, system and storage medium | |
| US20220292513A1 (en) | Predictive contextual transaction scoring | |
| CN114741618A (en) | Offline service point recommendation method, recommendation device, equipment and medium | |
| CN111325401B (en) | Method and device for training path planning model and computer system | |
| CN108885772A (en) | Cold chain data transmission when switching | |
| CN113780650A (en) | Transport capacity locking method, device, equipment and storage medium | |
| CN113159877A (en) | Data processing method, device, system and computer readable storage medium | |
| CN113780611A (en) | Inventory management method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Country or region after: China Address after: No. 413-26, No. 942 Tonglong Second Road, Torch High tech Zone (Xiang'an) Industrial Zone, Xiamen City, Fujian Province, 361000 Applicant after: Huiliantong Industrial Supply Chain Digital Technology (Xiamen) Co.,Ltd. Address before: 413-26, No. 942 Tonglong Second Road, Industrial Zone, Xiang'an District, Xiamen City, Fujian Province, 361101 Applicant before: Huiliantong Industrial Supply Chain Digital Technology (Xiamen) Co.,Ltd. Country or region before: China |