CN116523592A

CN116523592A - Network about vehicle order processing method and device and electronic equipment

Info

Publication number: CN116523592A
Application number: CN202310436359.2A
Authority: CN
Inventors: 赵东辉
Original assignee: Shouyue Technology Beijing Co Ltd
Current assignee: Shouyue Technology Beijing Co Ltd
Priority date: 2023-04-21
Filing date: 2023-04-21
Publication date: 2023-08-01

Abstract

The disclosure relates to the technical field of network taxi ordering, in particular to a network taxi ordering processing method, a network taxi ordering processing device and electronic equipment. The network appointment vehicle order processing method comprises the following steps: acquiring an order to be paid, the creation time of which is within a preset range, and the state of the order, and the information of the cooperators of each order; inquiring the order payment state of the partner of the order, and if the order payment state of the partner is successful, updating the state of the order to be completed. According to the invention, the completion state of the order of the network taxi company is modified according to the order payment state of the partner at regular time, so that the problem that the order is in a state to be paid for a long time under abnormal conditions is solved, network taxi service can be continuously provided for passengers, and the customer satisfaction is improved.

Description

Network about vehicle order processing method and device and electronic equipment

Technical Field

The disclosure relates to the technical field of network taxi ordering, in particular to a network taxi ordering processing method, a network taxi ordering processing device and electronic equipment.

Background

With the development of the internet about market, about services of internet about companies are increasingly embedded into partner platforms, such as hundred degrees, germany and the like. In this mode, passengers get on and off the order and pay at the taxi taking App of the partner, and the network taxi taking company provides passenger receiving and delivering services. The order state of the network about car company becomes to be paid after the passenger arrives at the destination, the network about car company is notified after the partner receives the payment of the passenger, and then the network about car company modifies the order state to be completed.

However, if an order actually paid by a partner cannot be modified to be completed in time in the network about vehicle company system due to various reasons (such as failure of calling a service interface caused by network abnormality, failure of notifying the network about vehicle company in time after passenger payment caused by problem of the system of the partner, failure of updating the order state to be completed, etc.), the order in the network about vehicle company system is in a state to be paid for a long time. Because the system design when there is an unpaid order, the passenger must pay the previous order before a new order can be placed. Therefore, when the order is in a state to be paid for a long time, the network-bound vehicle company cannot continue to provide the network-bound vehicle service to the passenger.

Disclosure of Invention

The embodiment of the disclosure provides an order processing scheme of a network about vehicle, which aims to solve the problem that an order is in a state to be paid for a long time under an abnormal condition in the prior art.

A first aspect of an embodiment of the present disclosure provides a method for processing an order of a network appointment vehicle, including:

acquiring an order to be paid, the creation time of which is within a preset range, and the state of the order, and the information of the cooperators of each order;

inquiring the order payment state of the partner of the order, and if the order payment state of the partner is successful, updating the state of the order to be completed.

In some embodiments, the method further comprises:

if the partner order payment status is not payment success, the status of the order is kept unchanged.

In some embodiments, the acquiring the creation time is within a preset range, and the order state is an order to be paid includes:

calculating inquiry starting time and inquiry ending time;

the order state is obtained from the database to be paid, and meanwhile, the order with the creation time not earlier than the inquiry starting time and earlier than the inquiry ending time is satisfied.

In some embodiments, the calculating the query start time and the query end time includes:

executing a timing task, wherein the timing task acquires a preset range and a preset interval from a configuration file;

acquiring the current time of a server;

calculating the query start time and the query end time based on the server current time, wherein,

query start time = server current time-preset range,

query end time = server current time-preset interval;

in some embodiments, the retrieving the order status from the database as to be paid while satisfying the order with a creation time not earlier than a query start time and earlier than a query end time comprises:

inquiring the order state from the database to be paid, and simultaneously meeting the total number of orders with the creation time not earlier than the inquiry start time and earlier than the inquiry end time;

calculating paging inquiry times;

and acquiring the order from the database for multiple times according to the paging query times.

In some embodiments, the number of page queries =% of the total number of orders preset the optimal number of concurrent queries.

In some embodiments, obtaining the partner information for each of the orders includes:

for each order, acquiring a channel number of the order from an order attribute of the order;

and inquiring the information of the partner of the order through the channel number.

In some embodiments, the querying the partner order payment status of the order includes:

invoking a partner order payment state query interface, wherein the query interface is used for obtaining the payment state of the order in a partner system through request parameters, and the request parameters of the query interface at least comprise a invoking time stamp and an order number;

and acquiring and analyzing the return value of the partner order payment state query interface.

A second aspect of an embodiment of the present disclosure provides an online-to-about vehicle order processing apparatus, including:

the acquisition module is used for acquiring an order to be paid and the partner information of each order, wherein the creation time is in a preset range;

and the updating module is used for inquiring the payment state of the order of the partner, and updating the state of the order to be completed if the payment state of the order of the partner is successful.

A third aspect of the disclosed embodiments provides an electronic device, comprising a memory and a processor,

the memory is used for storing a computer program;

the processor is configured to implement the method according to the first aspect of the present disclosure when executing the computer program.

A fourth aspect of the disclosed embodiments provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements a method according to the first aspect of the disclosure.

A fifth aspect of the disclosed embodiments provides a computer program product comprising a computer program, instructions which, when executed by a processor, implement a method according to the first aspect of the disclosure.

In summary, the method, the device, the electronic equipment, the computer readable storage medium and the computer program product for processing the order of the network taxi provided by the embodiments of the present disclosure solve the problem that the order is in the state to be paid for a long time under the abnormal condition by modifying the completion state of the order of the network taxi company according to the order payment state of the partner at regular time, so that the network taxi service can be continuously provided for passengers, and the customer satisfaction degree is improved.

Drawings

The features and advantages of the present disclosure will be more clearly understood by reference to the accompanying drawings, which are schematic and should not be construed as limiting the disclosure in any way, in which:

FIG. 1 is a schematic diagram of a computer system to which the present disclosure is applicable;

FIG. 2 is a flow chart of a method of order processing for a net appointment vehicle shown in accordance with some embodiments of the present disclosure;

FIG. 3 is a detailed flow chart of a method of order processing for a net jockey vehicle, shown in accordance with further embodiments of the present disclosure;

FIG. 4 is a schematic diagram of an online cart order processing device, according to some embodiments of the present disclosure;

fig. 5 is a schematic diagram of an electronic device shown in some embodiments of the present disclosure.

Detailed Description

In the following detailed description, numerous specific details are set forth by way of examples in order to provide a thorough understanding of the relevant disclosure. However, it will be apparent to one of ordinary skill in the art that the present disclosure may be practiced without these specific details. It should be appreciated that the use of "system," "apparatus," "unit," and/or "module" terms in this disclosure is one method for distinguishing between different parts, elements, portions, or components at different levels in a sequential arrangement. However, these terms may be replaced with other expressions if the other expressions can achieve the same purpose.

It will be understood that when a device, unit, or module is referred to as being "on," "connected to," or "coupled to" another device, unit, or module, it can be directly on, connected to, or coupled to, or in communication with the other device, unit, or module, or intervening devices, units, or modules may be present unless the context clearly indicates an exception. For example, the term "and/or" as used in this disclosure includes any and all combinations of one or more of the associated listed items.

The terminology used in the present disclosure is for the purpose of describing particular embodiments only and is not intended to limit the scope of the present disclosure. As used in the specification and the claims, the terms "a," "an," "the," and/or "the" are not specific to a singular, but may include a plurality, unless the context clearly dictates otherwise. In general, the terms "comprises" and "comprising" are intended to cover only those features, integers, steps, operations, elements, and/or components that are explicitly identified, but do not constitute an exclusive list, as other features, integers, steps, operations, elements, and/or components may be included.

These and other features and characteristics of the present disclosure, as well as the methods of operation, functions of the related elements of structure, combinations of parts and economies of manufacture, may be better understood with reference to the following description and the accompanying drawings, all of which form a part of this specification. It is to be expressly understood, however, that the drawings are for the purpose of illustration and description only and are not intended as a definition of the limits of the disclosure. It will be understood that the figures are not drawn to scale.

Various block diagrams are used in the present disclosure to illustrate various modifications of the embodiments according to the present disclosure. It should be understood that the foregoing or following structures are not intended to limit the present disclosure. The protection scope of the present disclosure is subject to the claims.

FIG. 1 is a schematic diagram of a computer system to which the present disclosure is applicable. As shown in the system of FIG. 1, the network about car company order system is connected with the partner order system through a network, and the network about car company order system periodically modifies the completion state of the network about car company order according to the order payment state of the partner order system.

As with the system shown in fig. 1, passengers purchase network booking services via a partner APP to generate a partner order at a partner order system. The cooperator issues a network about car service request to the network about car company, the network about car company receives the network about car service request, distributes network about cars, provides carrier service, and generates a network about car company order in the network about car company order system. When the network about car service finishes the payment of the passengers, the partner order system modifies the order state to be successful in payment, and simultaneously sends a message that the passengers have paid to the network about car company order system. After receiving the information, the network about car company order system modifies the network about car company order state to be completed.

However, when the order system of the net-about car company does not receive the paid information of the passenger due to the abnormal situation, the order state of the net-about car company is maintained in an unfinished state for a long time, so that the net-about car company cannot continue to provide service to the passenger. Such abnormal conditions include, but are not limited to: network abnormality causes service interface call failure, partner system problem causes failure to inform network about car company in time after passenger payment, network about car company system problem causes failure when updating order state to be completed, etc. In the method, the order system of the network about car company modifies the completion state of the order of the network about car company according to the order payment state of the partner at regular time, so that the problem that the order is in a to-be-paid state for a long time under abnormal conditions is solved, network about car service can be continuously provided for passengers, and customer satisfaction is improved.

The network about car company order system and the partner order system both library can be any of a stand-alone, clustered or distributed database.

Fig. 2 is a flow chart illustrating a method of network approximately vehicle order processing, according to some embodiments of the present disclosure. In some embodiments, the network approximately vehicle order processing method may be performed by the network approximately vehicle company order system shown in fig. 1. As shown in fig. 2, the network about vehicle order processing method includes the following steps:

s201, acquiring an order to be paid and partner information of each order, wherein the creation time is in a preset range, and the order state is the order to be paid.

Specifically, in some embodiments of the present disclosure, the method further comprises maintaining the status of the order unchanged if the partner order payment status is not payment successful.

In some embodiments of the present disclosure, obtaining that the creation time is within a preset range and that the order status is an order to be paid includes:

calculating inquiry starting time and inquiry ending time;

In some embodiments of the present disclosure, the calculating the query start time and the query end time includes:

acquiring the current time of a server;

query start time = server current time-preset range,

query end time = server current time-preset interval.

In some embodiments of the present disclosure, the retrieving the order status from the database as to be paid while satisfying the order with the creation time not earlier than the query start time and earlier than the query end time includes:

calculating paging inquiry times;

In some embodiments of the present disclosure, the number of paging queries =% of the total number of orders preset the optimal number of concurrent queries.

The preset optimal concurrent query number is estimated based on the size of the single piece of data. If the number of the queries is too large, the data volume returned each time is too large, and the system memory, the network bandwidth and the like are occupied too much; if the debugging of each query is too little, the database is frequently queried and the network request is frequently executed.

In some embodiments of the present disclosure, the preset optimal number of concurrent queries is 50.

S202, inquiring the order payment state of the partner of the order, and if the order payment state of the partner is successful, updating the state of the order to be completed.

Specifically, in some embodiments of the present disclosure, the order attribute of the network about vehicle company order includes a channel number, which is the number of the partner company requesting the network about vehicle service.

The obtaining of the partner information of each order includes:

The querying of the partner order payment status of the order includes:

Fig. 3 is a detailed flow chart of a method of order processing for a net jockey vehicle, according to further embodiments of the present disclosure. As shown in fig. 3, the method includes:

the method is that orders in the state to be paid are regularly inquired every day in a timed task mode and a partner order payment state inquiry interface is actively called, so that the order state of the network about car company is updated to be completed in time

The timing tasks in this application start to execute every day 0:00

The precondition of the invention is that the partner is required to have a service interface for inquiring the payment state through the order number. The core entry of the interface is order number, such as: b210121180601591000; the core parameters of the interface are payment state identifiers, such as 0 is to be paid and 1 is paid

The specific execution steps of the timing task are as follows:

step 1: timing task start execution

Step 2: reading periodic configuration from configuration file, denoted N

Examples of configuration files are as follows:

count_period＝3

the meaning of the above configuration example is: the timed task is allowed to process the order creation time within the last 3 days and the status is the order to be paid. The value of N after reading configuration is 3

Step 3: the current time of the server is acquired and is marked as P. The value of P is as follows: 2022-01-1100:00:01

Step 4: the order creation start time is calculated and noted as a. The calculation method is as follows: subtracting period N from the server current time P to obtain order creation start time A

If p=2022-01-1100:00:01, n=3, then a=2022-01-0800:00:01

Step 5: the order creation end time is calculated and noted as B. The calculation method is as follows: subtracting 5 hours from the server current time P to obtain order creation end time B

If p=2022-01-1100:00:01, minus 5 hours, then b=2022-01-1019:00:01

Step 6: inquiring the database that the order creation time is within A, B range, and the order state is the total number of orders to be paid, which is marked as C

Step 7: the number of times the database needs to be paged is counted. The calculation method is as follows: taking the value of C in step 6 to the remainder of 50 to obtain the paging inquiry times

Assuming that the value of C is 118, c50=3, resulting in a number of queries of 3. That is, the timing task needs to process 118 orders in total, and to avoid overlarge database query results, the database query is divided into 3 queries (50 queries each time in the first two times, and 18 queries can be found in the last time)

Step 8: paging and inquiring orders in the state to be paid from a database, and processing each order one by one

Step 9: obtaining channel numbers (the channel numbers are unique legal marks of the partners on the my, such as partner_SM, partner_PPQ and the like) on the orders, and inquiring the information of the partners to which the orders belong from a database through the channel numbers

Step 10: and judging whether the order payment state query interface URL in the partner information is empty or not. If the signal is empty, go to step 16, otherwise go to step 11

Step 11: the organization invokes the request parameters of the partner order payment status query interface. The request parameters include a call timestamp (example value: 1680402609), an order number (example value: B210121180601591000), etc

Step 12: calling partner order payment status query interface

Step 13: and analyzing the return value of the partner order payment state query interface. The return value is exemplified as follows:

{

"code":0,

"msg":"SUCCESS",

"data":{

"payStatus":1// payment status

}

Step 14: and judging whether the payment state in the returned result is successful (1 indicates that the payment is successful). If not, go to step 16, otherwise go to step 15

Step 15: updating the status of the order to completed

Step 16: continuing to process the next order

Step 17: and (5) ending.

Fig. 4 is a schematic diagram of a network appointment vehicle order processing device shown according to some embodiments of the present disclosure. As shown in fig. 4, the network about vehicle order processing device 400 includes an acquisition module 410, an update module 420, and the network about vehicle order processing function may be executed by the network about vehicle company order system in fig. 1. Wherein:

the acquiring module 410 is configured to acquire an order to be paid and partner information of each order, where the creation time is within a preset range;

and the updating module 420 is configured to query a partner order payment status of the order, and update the status of the order to completed if the partner order payment status is successful.

One embodiment of the present disclosure provides an electronic device, the electronic device 500 comprising a memory 520 and a processor 510, the memory 520 for storing a computer program; the processor 510 is configured to implement the methods described in S201-S202 in fig. 2 when executing the computer program.

One embodiment of the present disclosure provides a computer-readable storage medium having a computer program stored thereon, which when executed by a processor, implements the methods described in S201-S202 in fig. 2.

One embodiment of the present disclosure provides a computer program product comprising a computer program, instructions which, when executed by a processor, implement the method described in S201-S202 in fig. 2.

It will be clear to those skilled in the art that, for convenience and brevity of description, the specific operation of the apparatus and modules described above may refer to the corresponding description in the foregoing apparatus embodiments, which is not repeated here.

While the subject matter described herein is provided in the general context of operating systems and application programs that execute in conjunction with the execution of a computer system, those skilled in the art will recognize that other implementations may also be performed in combination with other types of program modules. Generally, program modules include routines, programs, components, data structures, and other types of structures that perform particular tasks or implement particular abstract data types. Those skilled in the art will appreciate that the subject matter described herein may be practiced with other computer system configurations, including hand-held devices, multiprocessor systems, microprocessor-based or programmable consumer electronics, minicomputers, mainframe computers, and the like, as well as distributed computing environments that have tasks performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote memory storage devices.

Those of ordinary skill in the art will appreciate that the elements and method steps of the examples described in connection with the embodiments disclosed herein can be implemented as electronic hardware, or as a combination 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 disclosure.

It is to be understood that the above-described embodiments of the present disclosure are merely illustrative or explanatory of the principles of the disclosure and are not restrictive of the disclosure. Accordingly, any modifications, equivalent substitutions, improvements, or the like, which do not depart from the spirit and scope of the present disclosure, are intended to be included within the scope of the present disclosure. Furthermore, the appended claims of this disclosure are intended to cover all such changes and modifications that fall within the scope and boundary of the appended claims, or the equivalents of such scope and boundary.

Claims

1. A method for processing an order of a network appointment vehicle, comprising:

2. The method as recited in claim 1, further comprising:

3. The method of claim 1, wherein the acquiring the creation time is within a preset range and the order status is an order to be paid comprises:

calculating inquiry starting time and inquiry ending time;

4. The method of claim 3, wherein the calculating a query start time and a query end time comprises:

acquiring the current time of a server;

query start time = server current time-preset range,

query end time = server current time-preset interval.

5. A method according to claim 3, wherein said retrieving from the database the status of the order as to be paid while satisfying the order with a creation time not earlier than the start time of the query and earlier than the end time of the query comprises:

calculating paging inquiry times;

6. The method according to claim 5, wherein:

paging number = order total%preset best concurrent number of queries.

7. The method of claim 1, wherein obtaining partner information for each of the orders comprises:

8. The method of claim 1, wherein said querying the partner order payment status of the order comprises:

9. A network appointment vehicle order processing device, comprising:

10. An electronic device includes a memory and a processor,

the memory is used for storing a computer program;

the processor being adapted to implement the method of any of claims 1-6 when the computer program is executed.