CN116187487A - Appointment list matching method, device and equipment - Google Patents

Appointment list matching method, device and equipment Download PDF

Info

Publication number
CN116187487A
CN116187487A CN202310294169.1A CN202310294169A CN116187487A CN 116187487 A CN116187487 A CN 116187487A CN 202310294169 A CN202310294169 A CN 202310294169A CN 116187487 A CN116187487 A CN 116187487A
Authority
CN
China
Prior art keywords
order
matching
type
drivers
driver
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
Application number
CN202310294169.1A
Other languages
Chinese (zh)
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.)
Shouyue Technology Beijing Co Ltd
Original Assignee
Shouyue Technology Beijing 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 Shouyue Technology Beijing Co Ltd filed Critical Shouyue Technology Beijing Co Ltd
Priority to CN202310294169.1A priority Critical patent/CN116187487A/en
Publication of CN116187487A publication Critical patent/CN116187487A/en
Pending legal-status Critical Current

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
    • 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)
  • Tourism & Hospitality (AREA)
  • Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • General Business, Economics & Management (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • Development Economics (AREA)
  • Quality & Reliability (AREA)
  • Operations Research (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)

Abstract

The embodiment of the invention relates to the field of Internet, and particularly provides a reservation list matching method, device and equipment. Acquiring order information, and judging the order type of an order which accords with the order matching condition; storing the order with the order type being the combined order to a database, and ending the order matching; and matching drivers according to the order type for the order with the interpolation order type, and carrying out association binding on the matched drivers and the order. In this way, the partial reservation orders can be divided into different order types, so that different algorithm matching strategies can be used to achieve the most reasonable pick-up quantity and pick-up driving flow lines of the driver, and the experience degree of the driver is improved.

Description

Appointment list matching method, device and equipment
Technical Field
The present invention relates generally to the field of the internet, and more particularly, to a method, apparatus, and device for matching a reservation list.
Background
At present, two common vehicle types are available in the process of using the network to offer vehicles, namely timely vehicle use and reservation vehicle use, the main technical scheme of the network to offer vehicles at present is that after the user places a list, drivers are screened in a certain radius range near the vehicles, order information is broadcast to the drivers or the order is directly bound to a proper driver, and after the binding is successful, the client driver information is notified.
For orders with longer reservation vehicle time and order time, the following disadvantages exist when the binding party type is used:
1. because the time for the driver to take the vehicle is too late, other orders can be bound, so that the time and the driving distance are far when the driver finishes the previous order and then returns to take the reservation order, and the experience of the driver is affected.
2. In order to avoid long-distance idle running, a driver starts to pick a bill, so that the capacity waste in a certain period is caused, and the bill quantity of a company is influenced.
3. In order to avoid empty driving caused by influencing other orders taken by drivers, the drivers choose to dispatch or cancel the orders, and the experience of passengers is influenced.
Disclosure of Invention
According to the embodiment of the invention, a reservation list matching scheme is provided. According to the scheme, partial reservation orders are divided into different order types, so that different algorithm matching strategies can be used to achieve the most reasonable quantity of drivers and the most reasonable pick-up and delivery driving flow lines, and the experience degree of the drivers is improved.
In a first aspect of the present invention, a method for matching a reservation list is provided. The method comprises the following steps:
acquiring order information, and judging the order type of the order which accords with the order matching condition;
storing the order with the order type being the combined order to a database, and ending the order matching;
and matching drivers according to the order type for the order with the interpolation order type, and carrying out association binding on the matched drivers and the order.
Further, the order matching condition includes:
the city information of the order information belongs to the configured city information; a kind of electronic device with high-pressure air-conditioning system
The order channel number of the order information belongs to the configured order channel number; a kind of electronic device with high-pressure air-conditioning system
The order service type of the order information belongs to the configured order service type; a kind of electronic device with high-pressure air-conditioning system
The order time of the order information is before a preset time of one day before the reserved vehicle use time.
Further, the combined order is an order which is in the preset time of the day before the reserved vehicle use time and meets the order matching condition;
the interpolation order is an order which is in line with the matching condition of the order after the preset time of the day before the reserved vehicle time in order placing time.
Further, after the order with the order type of the combined order is stored in a database, returning the order state to be the received order;
and regularly acquiring drivers matched with the combined order, associating and binding the drivers with the orders of the combined order, and marking the combined order as the completion of calculation.
Further, before the driver is matched according to the order type, judging whether the calculation of the combined order of the time date of the reserved vehicle is completed or not, if yes, matching the driver according to the order type; otherwise, finishing order matching.
Further, after the drivers are matched according to the order types, judging whether the drivers are matched, if so, carrying out association binding on the matched drivers and the orders; otherwise, finishing order matching.
Further, after the matched drivers and the orders are associated and bound, judging whether the associated and bound is successful, if so, sending a successful binding notification to the driver side and the passenger side, and otherwise, ending the order arrangement matching.
In a second aspect of the present invention, a reservation sheet matching apparatus is provided. The device comprises:
the judging module is used for acquiring order information and judging the order type of the order which accords with the order matching condition;
the storage module is used for storing the orders with the order types of the combination orders into the database and finishing the order matching;
and the matching module is used for matching the driver according to the order type for the order with the interpolation order type, and carrying out association binding on the matched driver and the order.
In a third aspect of the invention, an electronic device is provided. At least one processor of the electronic device; and a memory communicatively coupled to the at least one processor; the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of the first aspect of the invention.
In a fourth aspect of the invention, there is provided a non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the method of the first aspect of the invention.
It should be understood that the description in this summary is not intended to limit the critical or essential features of the embodiments of the invention, nor is it intended to limit the scope of the invention. Other features of the present invention will become apparent from the description that follows.
Drawings
The above and other features, advantages and aspects of embodiments of the present invention will become more apparent by reference to the following detailed description when taken in conjunction with the accompanying drawings. In the drawings, wherein like or similar reference numerals denote like or similar elements, in which:
FIG. 1 illustrates a flow chart of a method of matching a reservation list of an embodiment of the present invention;
FIG. 2 shows a block diagram of a reservation sheet matching device in accordance with an embodiment of the present invention;
FIG. 3 illustrates a block diagram of an exemplary electronic device capable of implementing embodiments of the invention;
wherein 300 is an electronic device, 301 is a computing unit, 302 is a ROM, 303 is a RAM, 304 is a bus, 305 is an I/O interface, 306 is an input unit, 307 is an output unit, 308 is a storage unit, 309 is a communication unit.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the embodiments of the present invention more apparent, the technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention, and it is apparent that the described embodiments are some embodiments of the present invention, but not all embodiments of the present invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
In addition, the term "and/or" herein is merely an association relationship describing an association object, and means that three relationships may exist, for example, a and/or B may mean: a exists alone, A and B exist together, and B exists alone. In addition, the character "/" herein generally indicates that the front and rear associated objects are an "or" relationship.
The invention aims to solve the problem that orders with long reservation time are far away from ordering time and cause adverse effects on drivers and companies, and considers that passengers of the reservation vehicle do not need to be immediately bound to the drivers, and only the drivers can be bound to the passengers before the reservation vehicle is used (generally 30 minutes before the reservation vehicle is used), so that the partial orders are stored into an order pool, the information of the received orders is returned to the passenger side, meanwhile, a batch of high-quality drivers are selected, algorithm matching is carried out on reservation orders with open-sky vehicle time at 21 points per day, and the optimal combination of the drivers and the orders is calculated.
Fig. 1 shows a flowchart of a reservation list matching method according to an embodiment of the present invention.
The method comprises the following steps:
s101, order information is acquired, and order arrangement type judgment is carried out on orders meeting order arrangement matching conditions.
In this embodiment, the network taxi platform entry user orders, the platform proxy layer composes the order information to request the order system to generate an order number, and then invokes the order dispatching system to assemble order dispatching parameters including: the network contract vehicle platform order number, city, order service type, longitude and latitude of getting on and off, reservation time, basic information of passengers and order amount information.
In this embodiment, the configuration center is preconfigured with the city id, the order channel number, and the order service type to determine whether the order hits the order matching condition. Wherein the configuration center may be a Nacos configuration center.
The order matching conditions include:
the city information of the order information belongs to the configured city information; a kind of electronic device with high-pressure air-conditioning system
The order channel number of the order information belongs to the configured order channel number; a kind of electronic device with high-pressure air-conditioning system
The order service type of the order information belongs to the configured order service type; a kind of electronic device with high-pressure air-conditioning system
The order time of the order information is before a preset time of one day before the reserved vehicle use time.
Specifically, the order matching condition is met on the premise that four conditions in the conditions are met.
In general, the preset time of the day before the reservation of the vehicle use time is set to 21 points, namely if the first three conditions are met and the ordering time is before the 21 points of the day before the reservation of the vehicle use time, the ordering matching condition is met.
In this embodiment, the types of the orders are divided into two major categories, namely, a combined order and an interpolation order, wherein the interpolation order further includes an empty order and a complementary order.
As one embodiment of the invention, the combined order is an order which is placed at the preset time of the day before the reserved vehicle time and meets the order matching condition.
In the above embodiment, the combined order specifically refers to a reservation order that is configured before 21:00 of a day before the reserved time, and the order has an optimal combined calculation that the algorithm-side timing task is 21:00 of a night of the day before the reserved time and the time is the next day.
As an embodiment of the invention, the interpolation order is an order which is placed after a preset time of a day before the reservation vehicle time and meets the order matching condition.
In the above embodiment, the blank arrangement refers to a reservation order that is configured after 21:00 a day before the reservation time, and the order is inserted into the blank period of the driver by a real-time calling algorithm after the combination arrangement calculation is completed. The order supplement is to supplement the order to the driver with lower running current driver by the real-time calling algorithm after the completion of the combined order calculation.
In this embodiment, if the order meets the order matching condition, determining the order type of the order; and if the order matching condition is not met, ending the order matching logic.
And carrying out subsequent judgment logic execution by judging whether the order type of the order is the combined order.
S102, storing the order with the order type being the combined order into a database, and ending the order matching.
In this embodiment, for an order with a combined order type, after storing the order with the combined order type in the database, returning the order status to the order received; and regularly acquiring drivers matched with the combined order, associating and binding the drivers with the orders of the combined order, and marking the combined order as the completion of calculation. Wherein, the timing acquisition can be realized by adding timing tasks.
The database may be MySQL.
S103, matching drivers according to the order types for orders with the interpolation order types, and carrying out association binding on the matched drivers and the orders.
In the embodiment, before the order types are matched with the drivers, judging whether the calculation of the combined order of the time and date of the reserved vehicle is completed or not, if yes, calling an algorithm interface, transmitting the corresponding order types, and acquiring the optimal drivers matched with the algorithm according to the order types; otherwise, the fact that the optimal combined order calculation is not carried out on the same day in the vehicle time is indicated, the empty order or the supplementary order cannot be matched with a driver, and order matching is finished.
In this embodiment, after the drivers are matched according to the order types, whether the drivers are matched is determined, if yes, the matched drivers and the orders are associated and bound; otherwise, finishing order matching.
Specifically, a timing task at an algorithm side triggers the combination order calculation of the reservation list order matching, whether the combination order is successful or not is calculated, if yes, an order dispatching interface is called through an http request, the optimal order and driver combination of the combination order production is informed to an order dispatching system in batches, and each http request parameter comprises an order number and a driver id; otherwise, the timing task is ended. The order sending system receives the order pushed by the algorithm and combines the order with the driver. And binding the driver to the corresponding order, informing the drivers and passengers that the binding is successful, and ending the binding. The response rate of the part of orders can be improved and the experience of passengers can be improved by appointing the part of drivers to receive the order of the reserved orders.
After the matched drivers are associated and bound with the orders, judging whether the association and the binding are successful, if so, sending a successful binding notification to the driver side and the passenger side, and otherwise, ending the order arrangement matching.
According to the embodiment of the invention, after a user places a bill, whether an order hits a bill matching logic is judged according to the city id, the order channel number and the order service type configured by a configuration center, if the order hits the bill matching logic, the order is directly saved into a database according to the type of the combination bill hit, the information of the received bill and the bill is returned to a passenger, 21 points in the day before the reservation vehicle time are waited, the combination bill calculation is initiated by an algorithm, the order and a driver form an optimal combination, then a binding system is called to bind the driver and the order, and meanwhile, the completion mark of the combination bill calculation of the day is cached; if the combination order is not the combination order type, judging whether the combination order on the current day of the reserved time is calculated, if so, calling an algorithm interface in real time, returning the optimal empty insertion or supplementary driver combination matched with the order by the algorithm, and binding the driver returned by the algorithm to the order by the order dispatching system to complete the order binding action. By dividing partial reservation orders into different order types, different algorithm matching strategies can be used to achieve the most reasonable pick-up quantity and pick-up driving flow lines of drivers, and the experience degree of the drivers is improved. The response rate of the part of orders can be improved and the experience of passengers can be improved by appointing the part of drivers to receive the order of the reserved orders.
It should be noted that, for simplicity of description, the foregoing method embodiments are all described as a series of acts, but it should be understood by those skilled in the art that the present invention is not limited by the order of acts described, as some steps may be performed in other orders or concurrently in accordance with the present invention. Further, those skilled in the art will also appreciate that the embodiments described in the specification are alternative embodiments, and that the acts and modules referred to are not necessarily required for the present invention.
The above description of the method embodiments further describes the solution of the present invention by means of device embodiments.
As shown in fig. 2, the apparatus 200 includes:
the judging module 210 is configured to obtain order information, and judge a ranking type of an order that meets a ranking matching condition;
a saving module 220, configured to save an order with a ranking type of a combined ranking to a database, and end ranking matching;
and the matching module 230 is configured to match drivers according to the order types for orders with the interpolation order types, and associate and bind the matched drivers with the orders.
It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the described modules may refer to corresponding procedures in the foregoing method embodiments, which are not described herein again.
In the technical scheme of the invention, the acquisition, storage, application and the like of the related user personal information all conform to the regulations of related laws and regulations, and the public sequence is not violated.
According to an embodiment of the present invention, the present invention also provides an electronic device and a readable storage medium.
Fig. 3 shows a schematic block diagram of an electronic device 300 that may be used to implement an embodiment of the invention. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the inventions described and/or claimed herein.
The device 300 comprises a computing unit 301 that may perform various suitable actions and processes in accordance with a computer program stored in a Read Only Memory (ROM) 302 or loaded from a storage unit 308 into a Random Access Memory (RAM) 303. In the RAM 303, various programs and data required for the operation of the device 300 may also be stored. The computing unit 301, the ROM 302, and the RAM 303 are connected to each other by a bus 304. An input/output (I/O) interface 305 is also connected to bus 304.
Various components in device 300 are connected to I/O interface 305, including: an input unit 306 such as a keyboard, a mouse, etc.; an output unit 307 such as various types of displays, speakers, and the like; a storage unit 308 such as a magnetic disk, an optical disk, or the like; and a communication unit 309 such as a network card, modem, wireless communication transceiver, etc. The communication unit 309 allows the device 300 to exchange information/data with other devices via a computer network such as the internet and/or various telecommunication networks.
The computing unit 301 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of computing unit 301 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, etc. The computing unit 301 performs the respective methods and processes described above, for example, the methods S101 to S103. For example, in some embodiments, methods S101-S103 may be implemented as a computer software program tangibly embodied on a machine-readable medium, such as storage unit 308. In some embodiments, part or all of the computer program may be loaded and/or installed onto the device 300 via the ROM 302 and/or the communication unit 309. When the computer program is loaded into the RAM 303 and executed by the computing unit 301, one or more steps of the methods S101 to S103 described above may be performed. Alternatively, in other embodiments, the computing unit 301 may be configured to perform the methods S101-S103 by any other suitable means (e.g. by means of firmware).
Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuit systems, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems On Chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.
Program code for carrying out methods of the present invention may be written in any combination of one or more programming languages. These program code may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus such that the program code, when executed by the processor or controller, causes the functions/operations specified in the flowchart and/or block diagram to be implemented. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.
In the context of the present invention, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. The machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and pointing device (e.g., a mouse or trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.
The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), and the internet.
The computer system may include a client and a server. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server may be a cloud server, a server of a distributed system, or a server incorporating a blockchain.
It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps described in the present invention may be performed in parallel, sequentially, or in a different order, so long as the desired results of the technical solution of the present invention are achieved, and the present invention is not limited herein.
The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives are possible, depending on design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.

Claims (10)

1. The reservation list matching method is characterized by comprising the following steps of:
acquiring order information, and judging the order type of the order which accords with the order matching condition;
storing the order with the order type being the combined order to a database, and ending the order matching;
and matching drivers according to the order type for the order with the interpolation order type, and carrying out association binding on the matched drivers and the order.
2. The method of claim 1, wherein the order matching condition comprises:
the city information of the order information belongs to the configured city information; a kind of electronic device with high-pressure air-conditioning system
The order channel number of the order information belongs to the configured order channel number; a kind of electronic device with high-pressure air-conditioning system
The order service type of the order information belongs to the configured order service type; a kind of electronic device with high-pressure air-conditioning system
The order time of the order information is before a preset time of one day before the reserved vehicle use time.
3. The method of claim 2, wherein the combined order is an order whose order placement time is a preset time of day before the scheduled vehicle time and meets an order matching condition;
the interpolation order is an order which is in line with the matching condition of the order after the preset time of the day before the reserved vehicle time in order placing time.
4. The method of claim 1, wherein after storing an order of a combined order of an order type in a database, returning the order status to an accepted order;
and regularly acquiring drivers matched with the combined order, associating and binding the drivers with the orders of the combined order, and marking the combined order as the completion of calculation.
5. The method of claim 1, wherein before the driver is matched according to the order type, judging whether the calculation of the combined order of the time and date of the reserved vehicle is completed or not, if yes, matching the driver according to the order type; otherwise, finishing order matching.
6. The method of claim 1, wherein after the matching of the drivers according to the order types, determining whether the drivers are matched, if so, performing association binding on the matched drivers and the orders; otherwise, finishing order matching.
7. The method of claim 1, wherein after the matched driver is associated with the order, whether the associated binding is successful is determined, if so, a successful binding notification is sent to the driver side and the passenger side, and otherwise, order matching is ended.
8. A reservation list matching device, comprising:
the judging module is used for acquiring order information and judging the order type of the order which accords with the order matching condition;
the storage module is used for storing the orders with the order types of the combination orders into the database and finishing the order matching;
and the matching module is used for matching the driver according to the order type for the order with the interpolation order type, and carrying out association binding on the matched driver and the order.
9. An electronic device comprising at least one processor; and
a memory communicatively coupled to the at least one processor; it is characterized in that the method comprises the steps of,
the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-7.
10. A non-transitory computer readable storage medium storing computer instructions for causing the computer to perform the method of any one of claims 1-7.
CN202310294169.1A 2023-03-23 2023-03-23 Appointment list matching method, device and equipment Pending CN116187487A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202310294169.1A CN116187487A (en) 2023-03-23 2023-03-23 Appointment list matching method, device and equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202310294169.1A CN116187487A (en) 2023-03-23 2023-03-23 Appointment list matching method, device and equipment

Publications (1)

Publication Number Publication Date
CN116187487A true CN116187487A (en) 2023-05-30

Family

ID=86440520

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202310294169.1A Pending CN116187487A (en) 2023-03-23 2023-03-23 Appointment list matching method, device and equipment

Country Status (1)

Country Link
CN (1) CN116187487A (en)

Similar Documents

Publication Publication Date Title
CN106919994A (en) Order method for pushing and device
CN106919993A (en) A kind of high accuracy acquiescence destination Forecasting Methodology and device based on historical data
CN106997577A (en) A kind of order strategy dynamic adjusting method and device
CN110633815A (en) Car pooling method and device, electronic equipment and storage medium
CN115860300A (en) Battery replacement scheduling method and device for vehicle, electronic equipment and storage medium
WO2023237033A1 (en) Updating installation package releasing method and apparatus, device and storage medium
CN116187487A (en) Appointment list matching method, device and equipment
CN114221960B (en) Data pushing method based on automatic driving bus and automatic driving bus
CN114880007A (en) Upgrading method, device, equipment and storage medium
CN114166236A (en) Navigation path planning method, device and system
CN116050549A (en) Method and equipment for reminding network about vehicle order delay
CN108171355A (en) For resource allocation and for vehicles scheduling method and its device
CN106779112A (en) A kind of intelligent taxi take system
CN112819585A (en) Freight order processing method, system, equipment and storage medium
CN113191512A (en) Vehicle reservation method and device
CN107230095A (en) A kind of method for information display and device
CN117422250A (en) Order receiving method, device and apparatus based on intelligent perception and storage medium
CN111861182A (en) Schedule creating method, device and system
CN116258359B (en) Expense objection marking method, device and equipment
CN117291393A (en) Method, equipment, device and storage medium for dispatching network appointment vehicle relay bill
CN114285894B (en) Travel platform task processing method, device, equipment and medium
CN116796867A (en) Method, device, equipment and storage medium for degrading dispatch service
CN118211792A (en) Vehicle operation and maintenance scheduling method, device, equipment and storage medium
CN117611154A (en) Service request processing method and device, electronic equipment and storage medium
CN116700758A (en) Whole vehicle version management 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