CN111523692B - Order management method, order management device and order management system - Google Patents

Order management method, order management device and order management system Download PDF

Info

Publication number
CN111523692B
CN111523692B CN202010272492.5A CN202010272492A CN111523692B CN 111523692 B CN111523692 B CN 111523692B CN 202010272492 A CN202010272492 A CN 202010272492A CN 111523692 B CN111523692 B CN 111523692B
Authority
CN
China
Prior art keywords
order
resource matching
resource
completed
scheduling
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202010272492.5A
Other languages
Chinese (zh)
Other versions
CN111523692A (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 Bailong Mayun Technology Co ltd
Original Assignee
Beijing Bailong Mayun 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 Bailong Mayun Technology Co ltd filed Critical Beijing Bailong Mayun Technology Co ltd
Priority to CN202010272492.5A priority Critical patent/CN111523692B/en
Publication of CN111523692A publication Critical patent/CN111523692A/en
Application granted granted Critical
Publication of CN111523692B publication Critical patent/CN111523692B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/02—Reservations, e.g. for tickets, services or events
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G06Q30/0601—Electronic shopping [e-shopping]
    • G06Q30/0633—Lists, e.g. purchase orders, compilation or processing
    • G06Q30/0635—Processing of requisition or of purchase orders
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
    • Y02P90/00—Enabling technologies with a potential contribution to greenhouse gas [GHG] emissions mitigation
    • Y02P90/30—Computing systems specially adapted for manufacturing

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Marketing (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Educational Administration (AREA)
  • Game Theory and Decision Science (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

An order management method, an order management device and an order management system are disclosed. The method comprises the following steps: receiving an order; sending order data of the order to the data storage module so that the data storage module can execute storage operation and store the order data; sending a resource matching request to the scheduling module so that the scheduling module performs a resource matching operation, and selecting resources to provide services requested by orders, wherein the resource matching operation and the storage operation for the same order are performed in parallel; in the event that a resource matching operation for an order has been completed, and a storage operation for an order has also been completed, the order is allocated to the resource selected by the resource matching operation. Thus, order transaction is completed efficiently under the condition of multi-platform access.

Description

Order management method, order management device and order management system
Technical Field
The disclosure relates to an order management method in the field of internet, and in particular relates to a management method for a network vehicle order.
Background
With the continued popularity and development of networks, it has become increasingly a trend for users to access internet resource orders to obtain desired resources or services. For example, the user can order on the network vehicle-restraining platform to meet the travel demands of the user, and the development of the Internet brings great convenience to life.
In the conventional order management method, the steps of storing order data, matching the order resources, and the like are generally serial. For example, in a network order, the steps of storing order data, matching drivers by the calling module of the order system, etc. are serial. The data table and the field related to the order data are more, so that the time consumption of the storage operation of the order data is longer.
In addition, resource matching of orders involves cumbersome resource matching strategies. For example, in resource matching of network taxi orders, considerations include, but are not limited to, road conditions, real-time distance between driver and passenger, and the like. Thus, performing the resource matching operation of the order is also time consuming.
That is, it generally takes a long time from receiving an order to matching resources, which may cause a problem of poor user experience to some extent.
However, both the user and the order manager want to consume shorter time from the receiving and storing of the order to the matching of the resource, so that the whole order transaction link is faster, thereby being beneficial to the improvement of the user experience and the efficient utilization of the resource.
Disclosure of Invention
The disclosure provides an order management method, an order management device and an order management system. The method and the system can complete order transaction rapidly while meeting the demands of users, and realize efficient order management.
According to a first aspect of the present disclosure, there is provided an order management method comprising: receiving an order; transmitting order data of the received order to the data storage module so that the data storage module can execute storage operation and store the order data; sending a resource matching request to the scheduling module so that the scheduling module performs a resource matching operation, and selecting resources to provide services requested by orders, wherein the resource matching operation and the storage operation for the same order are performed in parallel; in the event that the resource matching operation for the order has been completed and the storage operation for the order has also been completed, the order is allocated to the resource selected by the resource matching operation.
Therefore, the resource matching operation and the storage operation aiming at the same order are executed in parallel, the period required for completing the order is shortened, and the order can be managed efficiently.
Optionally, the method may further include: in the case where the resource matching operation for the order has been completed and the storage operation for the order has not been completed, information of the resource selected by the resource matching operation is saved and the storage operation is waited for to be completed.
Therefore, by waiting for the completion of the storage operation after the completion of the resource matching operation, the problem that the order data does not exist when the resource matching is faster than the order is stored and the order is allocated to the corresponding resource is avoided.
Optionally, the method may further include: whether the store operation for the order is completed is determined based on the identification corresponding to the order, and the identification is set based on whether the store operation is completed.
Optionally, the step of waiting for completion of the storing operation includes: and polling the corresponding identifiers for the saved multiple resource matching results for multiple orders to determine whether the storage operation for each order is completed.
Optionally, the identifier in the scheme may be located in a local memory; or in redis.
Optionally, the method is executed by an order system of the platform, the scheduling module may be a scheduling system of the platform, and the order system sends a resource matching request to the scheduling system based on the nio long link and waits for a resource matching result.
Therefore, the characteristics that the request can be sent based on the nio long link are the same through the intranet environment of the same platform, the time for creating the link, address routing and closing the link is saved, the period required for completing the order is shortened, and the order is managed efficiently.
Optionally, the method is executed by an order system of the platform, the scheduling module may also be a scheduling system of a third party, the order system sends a resource matching request to the scheduling system of the third party based on the http protocol, and receives a resource matching result from the scheduling system of the third party based on the http protocol.
Optionally, the method may further include: the order data is checked before sending the order data to the data storage module and the scheduling module.
Alternatively, the method of the present disclosure may be applied to a network taxi order system, and the order may be a network taxi order.
According to a second aspect of the present disclosure, there is provided an order management apparatus comprising: an order receiving device for receiving an order; the storage request device is used for sending the order data of the received order to the data storage module so that the data storage module can execute storage operation and store the order data; a scheduling request means for transmitting a resource matching request to the scheduling module so that the scheduling module performs a resource matching operation, selecting a resource to provide a service requested by an order, wherein the resource matching operation and the storage operation for the same order are performed in parallel; and the order allocation device is used for allocating the order to the resource selected by the resource matching operation in the case that the resource matching operation for the order is completed and the storage operation for the order is completed.
Optionally, the apparatus may further include: and the storage waiting device is used for storing the information of the resources selected by the resource matching operation and waiting for the completion of the storage operation in the case that the resource matching operation for the order is completed and the storage operation for the order is not completed.
Optionally, the apparatus may further include: and judging means for judging whether or not the storing operation for the order is completed based on the identification corresponding to the order, the identification being set based on whether or not the storing operation is completed.
Optionally, the apparatus may further include: and the polling device is used for polling the corresponding identifiers for the saved multiple resource matching results for multiple orders so as to determine whether the storage operation for each order is completed.
Optionally, the apparatus may further include: the order checking device is used for checking the order data before sending the order data to the data storage module and the scheduling module.
According to a third aspect of the present disclosure, there is provided an order management system, including an order system, a scheduling system, and a database, the order system receiving an order, transmitting order data of the received order to the database, and transmitting a resource matching request to the scheduling module; the database executes a storage operation to store order data; the scheduling system performs a resource matching operation, selects a resource to provide a service requested by an order, wherein the resource matching operation and the storage operation for the same order are performed in parallel; the order system allocates an order to the resource selected by the resource matching operation if the resource matching operation for the order has been completed and the storage operation for the order has also been completed.
Optionally, the order system saves information of the resource selected by the resource matching operation and waits for the completion of the storage operation in case the resource matching operation for the order has been completed and the storage operation for the order has not been completed.
According to a fourth aspect of the present disclosure, there is provided a network vehicle restraint system including the order management system described above.
According to a fifth aspect of the present disclosure, there is provided a computing device comprising: a processor; and a memory having executable code stored thereon which, when executed by the processor, causes the processor to perform the method as described in the first aspect above.
According to a sixth aspect of the present disclosure there is provided a non-transitory machine-readable storage medium having stored thereon executable code which, when executed by a processor of an electronic device, causes the processor to perform the method as described in the first aspect above.
Therefore, the method and the system realize the efficient completion of order transaction under the condition of multi-platform access by executing the resource matching operation and the storage operation in parallel and adaptively selecting the mode of sending the resource matching request to the dispatching system according to different dispatching systems.
Drawings
The foregoing and other objects, features and advantages of the disclosure will be apparent from the following more particular descriptions of exemplary embodiments of the disclosure as illustrated in the accompanying drawings wherein like reference numbers generally represent like parts throughout exemplary embodiments of the disclosure.
FIG. 1 shows a schematic flow chart diagram of an order management method according to one embodiment of the present disclosure.
Fig. 2 shows a schematic flow chart of an order management method according to one embodiment of the present disclosure.
FIG. 3 illustrates a schematic flow diagram of an order system requesting a resource match, allocation order, according to one embodiment of the present disclosure.
Fig. 4 shows a schematic block diagram of an order management device according to one embodiment of the present disclosure.
Fig. 5 shows a schematic block diagram of an order management system according to one embodiment of the present disclosure.
FIG. 6 illustrates a schematic diagram of a computing device that may be used to implement an order management method according to an embodiment of the present disclosure.
Detailed Description
Preferred embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While the preferred embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
The disclosure provides an order management method, and a user can place an order through a platform or a third party. The matching operation and the storage operation of the order are executed in parallel, and different methods are adopted when resource matching requests are sent with different scheduling modules, so that the user requirements can be met, resources can be utilized efficiently, the order transaction can be completed more quickly, and the ordering experience of the user is improved.
FIG. 1 shows a schematic flow chart diagram of an order management method according to one embodiment of the present disclosure.
Referring to fig. 1, in step S110, an order is received. For example, the order of the user may be received in response to the user placing an order, where the user may be a user placing an order on a platform or a user placing an order from a third party.
In step S131, order data of the order is sent to a data storage module, so that the data storage module performs a storage operation to store the order data. For example, in a network taxi order, the order data may include, but is not limited to, user related information, user wind control information, driver wind control information, start-stop location information, vehicle type information, estimated price/estimated mileage information, offer information, and the like.
In step S132, a resource matching request is sent to the scheduling module, so that the scheduling module performs a resource matching operation, and selects a resource to provide the service requested by the order. Here, the scheduling module may be a platform scheduling system or a third party scheduling system.
For example, in the network vehicle-restraining order, the scheduling module can execute resource matching according to the real-time distance between a driver and a passenger, the vehicle type selected by the passenger, the road condition of a corresponding road section and other factors.
Wherein, for the same order, the data storage module performing the storage operation and the scheduling module performing the resource matching operation are performed in parallel.
In step S140, in the case where the resource matching operation for an order has been completed and the storage operation for the order has also been completed, the order is allocated to the resource selected by the resource matching operation.
For example, in the network order, the scheduling module completes the resource matching operation, and returns the resource matching result, namely, the driver matched with the corresponding order; and after the data storage module finishes storing the corresponding order data, operations such as order allocation to a driver, pushing the driver and vehicle information thereof to a user, updating the state of the corresponding order and the like can be performed.
The order data has more data tables and more fields. For example, the order data of the order for the vehicle in the network may include, but is not limited to, user related information, user wind control information, start-stop position information, longitude and latitude information, vehicle type information, estimated price/estimated mileage information, preferential information, etc., so that the storing operation of the order data takes a long time.
In addition, resource matching of orders involves cumbersome resource matching strategies. For example, in resource matching of network taxi orders, considerations include, but are not limited to, road conditions, real-time distance between driver and passenger, and the like. In summary, performing the resource matching operation of an order is also time consuming.
In fact, when the order data is in a safe state, the data storage module may be performing the storage operation simultaneously with the scheduling module performing the resource matching operation, without conflict. For example, in the processing of a network taxi order, the system may perform driver matching while storing order data (which may include, but is not limited to, user start point location information, vehicle type information, estimated price/estimated mileage information, etc.) for the received order. Thus, the parallel execution of the resource matching operation and the storage operation for the same order may reduce the time required to place an order from a user.
Fig. 2 shows a schematic flow chart of an order management method according to another embodiment of the present disclosure.
The order management method shown in fig. 2 is basically the same as the order management method described above with reference to fig. 1, except that after receiving the order at step S110 described above, the order data is also checked at step S120.
After receiving the order, the order data is checked before sending the order data to the data storage module and sending the resource matching request to the scheduling module. In this way, missing or missing of order information for executing resource matching operation after the data storage module stores data and sends a resource matching request to the scheduling module can be avoided. The verification of the order data may include, but is not limited to, verification of whether the necessary items of the order data for resource matching are absent, verification of whether the received order data are consistent with the transmitted order data, and the like.
For example, in a network order, the lack of requisite order data may make the dispatch module appear to fail to match the driver, while an inconsistent transmission and receipt of order data may make the subsequent storage operation meaningless to the matching operation, etc. Therefore, after the order data verification is completed, the order data can be stored and the subsequent order state can be updated.
In one possible embodiment according to the present disclosure, in a case where a resource matching operation for an order has been completed and a storage operation for the order has not been completed, information of a resource selected by the resource matching operation is saved and the completion of the storage operation is waited.
When resource matching operations and storage operations for the same order are performed in parallel, it may occur that the resource matching operations of the order have been completed, while the storage operations of the order have not been completed. For example, in a network order, the driver's matching is faster than the order data is stored, which can cause problems in that the order data does not exist when the order system allocates the order to the resource selected by the resource matching operation. Thus, the order system saves information of the resource selected by the resource matching operation and waits for the completion of the storing operation, thereby avoiding the occurrence of the above-described problem.
FIG. 3 illustrates a schematic flow diagram of an order system requesting a resource match, allocation order, according to one embodiment of the present disclosure. The order management method may be performed by an order system of the platform.
Referring to FIG. 3, in step 310, the order system, in response to the received order data, sends a resource matching request to the scheduling module.
In step 320, it is determined whether the scheduling module is a scheduling system of the platform, and if the determination result is yes, step 331 is executed; if the determination result is negative, step 332 is executed.
Here, the existing order management system basically only relates to order management of a single platform, and the present disclosure adopts a corresponding faster and simpler order management method for multi-platform management related to a third party, thereby avoiding resource waste to a certain extent.
In step 331, when the scheduling module is a scheduling system of the platform, the order system sends a resource matching request to the scheduling system based on the nio long link, and waits for a resource matching result.
At this time, the order system and the scheduling module are located in the same platform and the same intranet environment, and the servers can be directly accessed through ip direct connection. The order system directly uses the nio long link request scheduling platform scheduling system to execute the resource matching operation, so that the time for creating links, address routing and closing links when the traditional rpc method is used is saved.
Here, nio, non-blocking I/O, also known as New I/O in the Java domain, is a synchronous Non-blocking I/O model, which is also the basis of I/O multiplexing, has been increasingly applied to large application servers, becoming an effective way to solve the problem of high concurrency and massive connection, I/O processing.
rpc, remote Procedure Call, remote procedure call is a protocol that requests services from a remote computer program over a network without requiring knowledge of the underlying network technology.
Furthermore, based on the nio long link model, data can be read or written to a buffer, so that flexible processing is performed. Also, the non-blocking nature of the nio long links allows the order system to utilize the nio idle time to perform I/O on other channels.
Thereby realizing the technical effect of improving the response speed while simplifying the application program interface.
In step 341, the scheduling system returns a resource matching result through the nio long link response order system.
In step 332, when the scheduling module is a scheduling system of a third party, the order system sends a resource matching request to the scheduling system of the third party based on the http protocol.
In step 342, the scheduling system responds to the order system based on the http protocol, returning a resource matching result.
When the dispatching module is a dispatching system of a third party, the order system and the dispatching module are not in the same platform and the same intranet environment, and a nio long-chain connection mode cannot be used between servers. At the moment, the order system sends a resource matching request to the dispatching system of the third party based on an http protocol, and receives a resource matching result from the dispatching system of the third party based on the http protocol.
In step 350, it is determined whether the storage operation of the order data corresponding to the order is completed, and if the determination result is yes, step 370 is executed; if the determination result is negative, step 360 is executed.
In step 360, the resource matching result is saved, and the storage operation of the order data is waited for to be completed, and after the storage operation is completed, the process proceeds to step 370.
When resource matching operations and storage operations for the same order are performed in parallel, it may occur that the resource matching operations of the order have been completed, while the storage operations of the order have not been completed. For example, in a network order, the driver's matching is faster than the order data is stored, which can cause problems in that the order data does not exist when the order system allocates the order to the resource selected by the resource matching operation.
The existing order management method generally calls the dispatching system to match drivers based on one time rpc after the data storage module finishes the storage of order data, and then adopts one time rpc to call back the matching result given by the dispatching system.
Here, when the scheduling module is a platform scheduling system, the order system of the present disclosure may request the scheduling module to wait for a resource matching result based on the nio long link model and the IP direct connection mode, so that the time for creating a link, address routing, and closing the link when the conventional rpc method is used is omitted, and thus the response speed is faster.
Thus, the order system saves information of the resource selected by the resource matching operation and waits for the completion of the storing operation, thereby avoiding the occurrence of the above-described problem.
At step 370, the corresponding order is assigned based on the resource matching result. For example, in a network order, specific operations for assigning orders may include, but are not limited to, saving driver and his vehicle information, driver/vehicle location information that the order matches, assigning orders to drivers, pushing driver and his vehicle information to users, updating order status, and so forth.
In accordance with one possible embodiment of the present disclosure, the order management method further includes determining whether a storage operation for an order is complete based on whether the storage operation is complete with a set identifier based on the identifier corresponding to the order. For example, the data storage module may set an identifier after the order data is saved, to identify whether the order data is successfully saved.
In addition, for a plurality of orders, the stored plurality of resource matching results for the plurality of orders are polled for the corresponding identifications to determine whether the store operation for each order is complete.
The data storage module may set the identifier in a local memory. At this time, the location of the identifier and the dispatch system of the platform are located in the same network environment. And the order system sends a resource matching request to the scheduling system based on the nio long link and waits for a resource matching result. And the scheduling system returns a resource matching result through the nio long-chain order receiving response order system. After receiving the response, the order system checks the identification in the local memory, and if the identification exists, the order is distributed; the identification of one or more corresponding orders is quickly polled if no identification exists to determine if the store operation for each order is complete.
For example, in a network vehicle order, after the dispatching system of the platform completes matching of drivers of a plurality of orders, a matching result is returned through a nio long link, after the order system receives the matching result, the identification arranged in the memory is polled, so that the quick response is performed when the storage operation is completed, that is, the identification exists, and the allocation of the orders is immediately performed.
In addition, the identification may also be located in redis. The redis, REmote Dictionary Server, remote dictionary service can provide a plurality of dictionaries for storing data, can also provide data sharing for different platforms, and is an application program interface supporting various data structures and supporting networks.
The third party's dispatch system and platform are not in the same network environment. And redis is used as a remote data dictionary which holds various data structures and supports a network, and can provide data sharing service for a dispatching system of a third party.
After the data storage module finishes the order data storage, an identifier is added in the redis to identify whether the order data is successfully stored. For example, after the third party scheduling system successfully matches the resource, the scheduling module calls back the resource matching result through the http interface, and the order system checks the identifier in redis after receiving the response. And if the identification exists, carrying out subsequent rotation of the order state, and if the identification does not exist, carrying out polling on the identification of the corresponding order in the redis, and waiting for the completion of the data storage of the order.
Any of the above methods is executed by the order system of the platform, and the method and the system can perform resource matching according to different modes selected by the scheduling module, so that the order system can rapidly output outwards and access to the standard, and further order transaction can be completed efficiently.
Fig. 4 shows a schematic block diagram of an order management device according to one embodiment of the present disclosure.
The order management device 400 shown in fig. 4 may be used to implement the order management methods shown in fig. 1, 2 and 3, and only the functional devices that the order management device 400 may have and the operations that the functional devices may perform will be briefly described below, and details related thereto may be referred to the above description in connection with fig. 1-3, which is not repeated herein.
As shown in fig. 4, the order management apparatus 400 may include an order receiving apparatus 410, a storage requesting apparatus 431, a scheduling requesting apparatus 432, and an order distributing apparatus 460.
Order receiving device 410 may be used to receive orders from a customer side. Here, the user may be a user who places an order from the platform, or may be a user who places an order from a third party.
The storage request device 431 may be configured to send order data of an order to the data storage module, so that the data storage module performs a storage operation to store order data corresponding to the order. In the network vehicle-restraining order, the order data may include, but is not limited to, user related information, user wind control information, starting point position information, longitude and latitude information, vehicle type information, estimated price/estimated mileage information, preferential information, and the like.
The scheduling request means 432 may be adapted to send a resource matching request to the scheduling module for the scheduling module to perform a resource matching operation, selecting resources to provide the service requested by the corresponding order. Here, the scheduling module may be a platform scheduling system or a third party scheduling system.
Wherein the resource matching operation and the storage operation for the same order are performed in parallel.
The order allocation device 460 may be configured to allocate an order to a resource selected by a resource matching operation for the order if the resource matching operation has been completed and a storage operation for the order has also been completed.
Optionally, the order management device 400 may further comprise an order checking device 420 for checking the order data before sending the order data to the data storage module and the scheduling module.
Optionally, the order management device 400 may further comprise a save waiting device 450, configured to save information of a resource selected by the resource matching operation and wait for the completion of the storage operation, in a case that the resource matching operation for an order has been completed and the storage operation for the order has not been completed.
Optionally, the order management device 400 may further comprise a determining device 440 for determining whether a storage operation for an order is completed based on an identification corresponding to the order, the identification being set based on whether the storage operation is completed. Here, the identifier may be set in the local memory or in the redis.
Optionally, the determining device 440 may further include a polling device 441 configured to poll the saved multiple resource matching results for multiple orders for a corresponding identifier to determine whether the storage operation for each order is completed.
Fig. 5 shows a schematic block diagram of an order management system according to one embodiment of the present disclosure.
Referring to FIG. 5, order management system 500 includes an order system 510, a scheduling system 520, and a database 530.
Order system 510 receives an order, sends order data for the order to a data storage module, and sends a resource matching request to a scheduling module.
The data storage module performs a storage operation to store the order data to database 530.
The scheduling system 520 performs a resource matching operation, selecting resources to provide the service requested by the order, where the scheduling system may belong to a platform or may belong to a third party.
Wherein the resource matching operation and the storage operation for the same order are performed in parallel.
In addition, the order system 510 allocates an order to a resource selected by a resource matching operation for the order if the resource matching operation has been completed and a storage operation for the order has also been completed.
Optionally, in order management system 500, order system 510 saves information of the resource selected by the resource matching operation and waits for the completion of the storage operation if the resource matching operation for the order has been completed and the storage operation for the order has not been completed.
In the technical scheme of the disclosure, an order can be allocated to a resource selected by a resource matching operation only when the resource matching operation for the order is completed and a storage operation for the order is completed.
FIG. 6 illustrates a schematic diagram of a computing device that may be used to implement the order management methods described above, according to one embodiment of the present disclosure.
Referring to fig. 6, a computing device 600 includes a memory 610 and a processor 620.
Processor 620 may be a multi-core processor or may include multiple processors. In some embodiments, processor 620 may include a general-purpose host processor and one or more special coprocessors, such as a Graphics Processor (GPU), digital Signal Processor (DSP), etc. In some embodiments, the processor 620 may be implemented using custom circuitry, for example, an application specific integrated circuit (ASIC, application Specific Integrated Circuit) or a field programmable gate array (FPGA, field Programmable Gate Arrays).
Memory 610 may include various types of storage units, such as system memory, read Only Memory (ROM), and persistent storage. Where the ROM may store static data or instructions that are required by the processor 620 or other modules of the computer. The persistent storage may be a readable and writable storage. The persistent storage may be a non-volatile memory device that does not lose stored instructions and data even after the computer is powered down. In some embodiments, the persistent storage device employs a mass storage device (e.g., magnetic or optical disk, flash memory) as the persistent storage device. In other embodiments, the persistent storage may be a removable storage device (e.g., diskette, optical drive). The system memory may be a read-write memory device or a volatile read-write memory device, such as dynamic random access memory. The system memory may store instructions and data that are required by some or all of the processors at runtime. Furthermore, memory 610 may include any combination of computer-readable storage media including various types of semiconductor memory chips (DRAM, SRAM, SDRAM, flash memory, programmable read-only memory), magnetic disks, and/or optical disks may also be employed. In some implementations, memory 610 may include readable and/or writable removable storage devices such as Compact Discs (CDs), digital versatile discs (e.g., DVD-ROMs, dual-layer DVD-ROMs), blu-ray discs read only, super-density discs, flash memory cards (e.g., SD cards, min SD cards, micro-SD cards, etc.), magnetic floppy disks, and the like. The computer readable storage medium does not contain a carrier wave or an instantaneous electronic signal transmitted by wireless or wired transmission.
The memory 610 has stored thereon executable code that, when processed by the processor 620, causes the processor 620 to perform the order management methods described above.
The order management method, the order management device, and the order management system according to the present disclosure have been described in detail above with reference to the accompanying drawings.
Furthermore, the method according to the present disclosure may also be implemented as a computer program or computer program product comprising computer program code instructions for performing the above steps defined in the above method of the present invention.
Alternatively, the present disclosure may also be implemented as a non-transitory machine-readable storage medium (or computer-readable storage medium, or machine-readable storage medium) having stored thereon executable code (or computer program, or computer instruction code) that, when executed by a processor of an electronic device (or computing device, server, etc.), causes the processor to perform the steps of the above-described method according to the present disclosure.
Those of skill would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the disclosure herein may be implemented as electronic hardware, computer software, or combinations of both.
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems and methods according to various embodiments of the present disclosure. 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 and/or flowchart illustration, and combinations of blocks in the block diagrams and/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 foregoing description of the embodiments of the present disclosure has been presented for purposes of illustration and description, and is not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the various embodiments described. The terminology used herein was chosen in order to best explain the principles of the embodiments, the practical application, or the improvement of technology in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.

Claims (9)

1. An order management method, comprising:
receiving an order;
sending order data of the order to a data storage module so that the data storage module executes storage operation and stores the order data;
sending a resource matching request to a scheduling module so that the scheduling module executes a resource matching operation, and selecting resources to provide services requested by the orders, wherein the resource matching operation and the storage operation for the same order are executed in parallel;
in the event that a resource matching operation for an order has been completed, and a storage operation for the order has also been completed, the order is allocated to the resource selected by the resource matching operation,
wherein the method is performed by an order system of the platform,
the scheduling module is a scheduling system of the platform, the order system sends a resource matching request to the scheduling system based on the nio long link and waits for a resource matching result, or
The scheduling module is a scheduling system of a third party, the order system sends a resource matching request to the scheduling system of the third party based on an http protocol, receives a resource matching result from the scheduling system of the third party based on the http protocol,
the method further comprises the steps of:
in the case that the resource matching operation for the order is completed and the storage operation of the order is not completed, saving the information of the resource selected by the resource matching operation;
and polling corresponding identifiers for the saved multiple resource matching results for multiple orders to determine whether the storage operation for each order is completed, wherein the identifiers are set based on whether the storage operation is completed.
2. The method of claim 1, wherein,
the identifier is located in a local memory; or alternatively
The identity is located in redis.
3. The method of claim 1, further comprising:
the order data is checked before sending the order data to the data storage module and the scheduling module.
4. A method according to any one of claim 1 to 3, wherein,
the method is applied to a network vehicle order system, wherein the order is a network vehicle order.
5. An order management device, comprising:
an order receiving device for receiving an order;
the storage request device is used for sending the order data of the order to the data storage module so that the data storage module can execute storage operation and store the order data;
a scheduling request device, configured to send a resource matching request to a scheduling module, so that the scheduling module performs a resource matching operation, and selects a resource to provide a service requested by the order, where the resource matching operation and the storage operation for the same order are performed in parallel;
an order allocation means for allocating an order to a resource selected by a resource matching operation for the order, in a case where the resource matching operation for the order has been completed and a storage operation for the order has also been completed,
the order management device is an order system of a platform,
the scheduling module is a scheduling system of the platform, the order system sends a resource matching request to the scheduling system based on the nio long link and waits for a resource matching result, or
The scheduling module is a scheduling system of a third party, the order system sends a resource matching request to the scheduling system of the third party based on an http protocol, receives a resource matching result from the scheduling system of the third party based on the http protocol,
the apparatus further comprises:
a saving module, configured to save information of a resource selected by a resource matching operation for an order, where the resource matching operation for the order has been completed and the storage operation for the order has not been completed;
and the polling module is used for polling corresponding identifiers for the saved multiple resource matching results for multiple orders to determine whether the storage operation for each order is completed or not, wherein the identifiers are set based on whether the storage operation is completed or not.
6. An order management system comprises an order system, a dispatching system and a database,
the order system receives orders, sends order data of the orders to a database, and sends a resource matching request to a scheduling module;
the database executes a storage operation and stores the order data;
the scheduling system performs a resource matching operation, selects a resource to provide the service requested by the order, wherein the resource matching operation and the storage operation for the same order are performed in parallel;
the order system allocates the order to the resource selected by the resource matching operation if the resource matching operation for the order has been completed, and the storage operation for the order has also been completed,
the order system is that of a platform,
the scheduling system is a scheduling system of the platform, the order system sends a resource matching request to the scheduling system based on the nio long link and waits for a resource matching result, or
The scheduling system is a scheduling system of a third party, the order system sends a resource matching request to the scheduling system of the third party based on an http protocol, receives a resource matching result from the scheduling system of the third party based on the http protocol,
the order system stores information of resources selected by the resource matching operation when the resource matching operation for the order is completed and the storage operation for the order is not completed, and polls a corresponding identifier for a plurality of stored resource matching results for a plurality of orders to determine whether the storage operation for each order is completed or not, wherein the identifier is set based on whether the storage operation is completed or not.
7. A network vehicle restraint system comprising the order management system of claim 6.
8. A computing device, comprising:
a processor; and
a memory having executable code stored thereon, which when executed by the processor causes the processor to perform the method of any of claims 1 to 4.
9. A non-transitory machine-readable storage medium having stored thereon executable code, which when executed by a processor of an electronic device, causes the processor to perform the method of any of claims 1 to 4.
CN202010272492.5A 2020-04-09 2020-04-09 Order management method, order management device and order management system Active CN111523692B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010272492.5A CN111523692B (en) 2020-04-09 2020-04-09 Order management method, order management device and order management system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010272492.5A CN111523692B (en) 2020-04-09 2020-04-09 Order management method, order management device and order management system

Publications (2)

Publication Number Publication Date
CN111523692A CN111523692A (en) 2020-08-11
CN111523692B true CN111523692B (en) 2023-07-14

Family

ID=71902467

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010272492.5A Active CN111523692B (en) 2020-04-09 2020-04-09 Order management method, order management device and order management system

Country Status (1)

Country Link
CN (1) CN111523692B (en)

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150227890A1 (en) * 2014-02-07 2015-08-13 Kristin Kaye Bednarek Communications system and smart device apps supporting segmented order distributed distribution system
US10291548B2 (en) * 2014-08-08 2019-05-14 Oracle International Corporation Contribution policy-based resource management and allocation system
CN106373387A (en) * 2016-10-25 2017-02-01 先锋智道（北京）科技有限公司 Vehicle scheduling, apparatus and system
CN109284880B (en) * 2017-07-20 2021-09-07 北京嘀嘀无限科技发展有限公司 Data processing method, device, server, mobile terminal and readable storage medium
CN108009651A (en) * 2017-08-16 2018-05-08 北京嘀嘀无限科技发展有限公司 Order processing method, apparatus, terminal device and computer-readable recording medium
CN110110871B (en) * 2018-02-01 2022-08-19 北京嘀嘀无限科技发展有限公司 Order allocation method and system
CN110191140B (en) * 2018-02-22 2022-07-22 北京嘀嘀无限科技发展有限公司 Service processing method and device and server
CN110245764A (en) * 2019-05-13 2019-09-17 特斯联（北京）科技有限公司 A kind of about vehicle traveling method based on distributed storage database

Also Published As

Publication number Publication date
CN111523692A (en) 2020-08-11

Similar Documents

Publication Publication Date Title
US20200007459A1 (en) Background processes in update load balancers of an auto scaling group
WO2019080415A1 (en) Client incoming call assignment method and system, computer device and storage medium
CN110968586A (en) Distributed transaction processing method and device
US8832215B2 (en) Load-balancing in replication engine of directory server
CN110287146A (en) Using the method, equipment and computer storage medium of downloading
WO2019080416A1 (en) Customer incoming call allocation method and system, computer device and storage medium
CN112256414A (en) Method and system for connecting multiple computing storage engines
CN111343262A (en) Distributed cluster login method, device, equipment and storage medium
CN110659104B (en) Service monitoring method and related equipment
CN112686528A (en) Method, apparatus, server and medium for allocating customer service resources
CN112286688A (en) Memory management and use method, device, equipment and medium
CN105373563B (en) Database switching method and device
CN109801425B (en) Queue polling prompting method, device, equipment and storage medium in surface tag service
CN111177032A (en) Cache space application method, system, device and computer readable storage medium
CN111523692B (en) Order management method, order management device and order management system
CN111835809B (en) Work order message distribution method, work order message distribution device, server and storage medium
CN110175078B (en) Service processing method and device
CN111813541A (en) Task scheduling method, device, medium and equipment
JP2001229058A (en) Data base server processing method
JP4238258B2 (en) Task management apparatus and task management method for in-vehicle electronic control unit
CN107729158B (en) Method for simplifying application program register, storage medium and electronic equipment
CN111724262B (en) Subsequent package query system of application server and working method thereof
CN113190624A (en) Asynchronous-to-synchronous calling method and device based on distributed cross-container
CN115934286A (en) Spark job submission method and system for light client
CN111258775A (en) Message processing method, device, equipment and storage medium

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