CN114881728A - Carpooling method and device - Google Patents

Carpooling method and device Download PDF

Info

Publication number
CN114881728A
CN114881728A CN202210461842.1A CN202210461842A CN114881728A CN 114881728 A CN114881728 A CN 114881728A CN 202210461842 A CN202210461842 A CN 202210461842A CN 114881728 A CN114881728 A CN 114881728A
Authority
CN
China
Prior art keywords
order
special
car
passenger
special vehicle
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
CN202210461842.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.)
Guangzhou Chenqi Travel Technology Co Ltd
Original Assignee
Guangzhou Chenqi Travel 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 Guangzhou Chenqi Travel Technology Co Ltd filed Critical Guangzhou Chenqi Travel Technology Co Ltd
Priority to CN202210461842.1A priority Critical patent/CN114881728A/en
Publication of CN114881728A publication Critical patent/CN114881728A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/06Buying, selling or leasing transactions
    • G06Q30/0601Electronic shopping [e-shopping]
    • G06Q30/0633Lists, e.g. purchase orders, compilation or processing
    • G06Q30/0635Processing of requisition or of purchase orders
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/06Buying, selling or leasing transactions
    • G06Q30/0601Electronic shopping [e-shopping]
    • G06Q30/0639Item locations
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40Business processes related to the transportation industry

Landscapes

  • Business, Economics & Management (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • General Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Marketing (AREA)
  • Strategic Management (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Economics (AREA)
  • Development Economics (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Human Resources & Organizations (AREA)
  • Primary Health Care (AREA)
  • Tourism & Hospitality (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a carpooling method and a device, comprising the following steps: acquiring a special car order request of a passenger terminal, and creating a special car order; classifying the special vehicle orders based on a preset classification rule; sending a order-sharing request to a passenger side belonging to the same type of special vehicle orders; and converting the special car order which receives the order combination request into a car combination order. For the passengers with the same riding requirements, based on the existing riding mode, the passenger terminals with the same riding requirements are identified through the preset classification rules, the special vehicle orders of the passenger terminals are collected, the order combining request is sent to the passenger terminals, the special vehicle orders receiving the order combining request are converted into the order combining order, the carrying capacity of network car sharing can be saved, more income is brought to drivers, and the riding cost of each passenger is saved.

Description

Carpooling method and device
Technical Field
The invention belongs to the technical field of network taxi booking, and particularly relates to a taxi sharing method and device.
Background
In daily life, the net taxi has two taxi taking modes, one mode is a special taxi trip, and the other mode is a taxi sharing trip. When a passenger terminal initiates a special vehicle order request in a special vehicle trip, a network appointment system creates a special vehicle order for the passenger terminal, searches for a driver terminal near the passenger terminal, designates a special vehicle of the driver terminal to pick up the passenger, and the driver terminal does not receive other orders in the process of picking up the passenger; in the car sharing trip, the passenger terminal initiates a car sharing order request, the driver terminal goes to the starting point of the car sharing order, and in the process that the driver terminal drives the motor vehicle to go to the starting point of the car sharing order, the driver terminal can receive the car sharing orders of other passengers and can also receive the car sharing orders of other passengers on the way of the driver terminal delivering the passenger terminal.
Generally, for a passenger end, a special car takes shorter time for traveling, the amount of money spent for carpooling traveling is less, and for passengers who catch up time, the special car is more likely to be selected for traveling. For the driver end, in order to save cost, more carpool orders can be received at one time until the threshold of the number of passengers is reached.
In order to avoid the problem of waiting and detouring during car sharing, even if the time is sufficient, many passengers prefer to select a special car for going out instead of the car sharing. In fact, a large number of passengers with the same requirements exist near the passengers, the starting points and the end points of the passengers are not far away, but each passenger end needs to be provided with a corresponding driver end, so that the waste of the network traffic capacity is caused at the present stage, and particularly, traffic jam is easily caused during the peak riding period.
Disclosure of Invention
The invention aims to solve the technical problems and provides a car pooling method and a car pooling device.
In order to solve the problems, the invention is realized according to the following technical scheme:
in a first aspect, the invention provides a car pooling method, which comprises the following steps:
acquiring a special car order request of a passenger terminal, and creating a special car order;
classifying the special vehicle orders based on a preset classification rule;
sending a order-sharing request to a passenger side belonging to the same type of special vehicle orders;
and converting the special car order which receives the order combination request into a car combination order.
With reference to the first aspect, the present invention further provides a method in the first aspect, in which after the special car order that receives the order splicing request is converted into a car pooling order, the method further includes:
acquiring a passenger number threshold value at a driver end;
and counting the total number of passengers of the carpooling order, and matching the corresponding driver terminal according to the total number of the passengers of the carpooling order.
With reference to the first aspect, the present invention further provides a second implementation manner of the first aspect, further including:
acquiring a passenger number threshold value at a driver end;
counting the total number of passengers in the same type of special vehicle orders, matching the corresponding driver side according to the total number of the passengers in the same type of special vehicle orders, and setting the matching state of the special vehicle orders as a pre-matching state.
With reference to the first aspect, the present invention further provides embodiment 3 of the first aspect, further including:
converting the matching state of the carpool order into a matched state, and distributing a corresponding driver end according to the pre-matching state;
and converting the matching state of the special order which is not converted into the carpool order into the unmatched state, and redistributing the driver end to the special order.
With reference to the first aspect, the present invention further provides a 4 th implementation manner of the first aspect, where classifying the special car order based on the preset classification rule specifically includes:
acquiring starting point data and end point data of a special vehicle order, and mapping the starting point data and the end point data into a grid map; the grid map divides the map into a plurality of grids;
the special vehicle orders with the starting point and the ending point positioned on the same grid in the grid map are classified into the same type, and a category data set is established.
In a first aspect, the present invention provides a car pooling device, comprising:
the order creating module is used for acquiring a special car order request of a passenger terminal and creating a special car order;
the order classification module is used for classifying the special vehicle orders based on a preset classification rule;
the order-sharing request sending module is used for sending order-sharing requests to passenger terminals belonging to the same type of special vehicle orders;
and the order conversion module is used for converting the special car order which receives the order sharing request into the car sharing order.
With reference to the second aspect, the present invention further provides embodiment 1 of the second aspect, further including:
the first acquisition module is used for acquiring a passenger number threshold value at a driver end;
and the matching module is used for counting the total number of passengers of the carpooling order and matching the corresponding driver terminal according to the total number of the passengers of the carpooling order.
With reference to the second aspect, the present invention further provides a second embodiment 2 of the second aspect, further including:
the second acquisition module is used for acquiring the passenger number threshold value of the driver end;
and the matching state setting module is used for counting the total number of passengers in the same type of special vehicle orders, matching the corresponding driver side according to the total number of the passengers in the same type of special vehicle orders, and setting the matching state of the special vehicle orders as a pre-matching state.
With reference to the second aspect, the present invention further provides embodiment 3 of the second aspect, further including:
the first conversion module is used for converting the matching state of the carpool order into a matched state and distributing a corresponding driver terminal according to the pre-matching state;
and the second conversion module is used for converting the matching state of the special car order which is not converted into the carpool order into the unmatched state and redistributing the driver end to the special car order.
With reference to the second aspect, the present invention further provides a 4 th implementation manner of the second aspect, wherein the order classification module includes:
the system comprises a mapping unit, a grid map and a processing unit, wherein the mapping unit is used for acquiring starting point data and end point data of a special vehicle order and mapping the starting point data and the end point data into the grid map; the grid map divides the map into a plurality of grids;
and the dividing unit is used for dividing the special vehicle orders with the starting points and the end points positioned on the same grid in the grid map into the same type and establishing a category data set.
Compared with the prior art, the invention has the beneficial effects that:
in this embodiment, for the passengers with the same riding requirements, based on the existing riding mode, the passenger terminals with the same riding requirements are identified through the preset classification rules, the special car orders of the passenger terminals are collected, the order combining request is sent to the passenger terminals, the special car orders receiving the order combining request are converted into the car combining orders, the transport capacity of network car sharing can be saved, more income is brought to drivers, and the riding cost of each passenger is saved.
Drawings
Embodiments of the invention are described in further detail below with reference to the attached drawing figures, wherein:
FIG. 1 is a schematic flow diagram of a carpooling method of the present invention;
fig. 2 is a schematic structural diagram of the carpooling device of the invention.
Detailed Description
The preferred embodiments of the present invention will be described in conjunction with the accompanying drawings, and it will be understood that they are described herein for the purpose of illustration and explanation and not limitation.
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 term "including" and variations thereof as used herein is intended to be open-ended, i.e., "including but not limited to". Unless specifically stated otherwise, the term "or" means "and/or". The term "based on" means "based at least in part on". The terms "one example embodiment" and "one embodiment" mean "at least one example embodiment". The term "another embodiment" means "at least one additional embodiment". The terms "first," "second," and the like may refer to different or the same object. Other explicit and implicit definitions are also possible below.
The carpooling mode of the existing network taxi booking is generally as follows: the first passenger initiates a car sharing order A, the driver receives the car sharing order A and drives the car to the starting position of the order A to pick up the first passenger, and when the car sharing order A is established, other car sharing orders B initiated by other passengers nearby the starting position or car sharing orders C on the way to the first passenger are searched. In this ride share mode, waiting and picking up other passengers can waste a significant amount of time. When the time is sufficient, people are willing to choose a 'car sharing' scheme to save riding cost, but when the passengers catch time, special cars are usually chosen to pick up and send, and the time for waiting to pick up other passengers is avoided.
In life, more and more passengers choose to give up a car sharing mode and choose to pick up and send special cars, and each passenger occupies one network car reservation. However, the starting point and the terminal point of a part of passengers in life are relatively close, so that the capacity of the taxi booking platform is easy to be insufficient when a special taxi is selected for pick-up, and traffic jam is also easy to be caused particularly in the riding peak period. For example, when going off duty, a passenger a and a passenger b in the same building respectively select a special car to pick up to go to the same subway station to pick up to go home, and actually, the passenger a and the passenger b only need one network to make an appointment, and the respective selection of the special car to pick up causes the waste of the transportation capacity of the network appointment.
Example 1
As shown in fig. 1, the carpooling method of the present invention includes the following steps:
step S1: acquiring a special car order request of a passenger terminal, and creating a special car order;
step S2: classifying the special vehicle orders based on a preset classification rule;
step S3: sending a order-sharing request to a passenger side belonging to the same type of special vehicle orders;
step S4: and converting the special car order which receives the order combination request into a car combination order.
In the embodiment, for the passengers with the same riding requirements, the passenger terminals with the same riding requirements are identified through the preset classification rules based on the existing riding modes, the special car orders of the passenger terminals are collected and sent to the passenger terminals, and the special car orders receiving the order combination requests are converted into the car combination orders, so that the transport capacity of network car reservation can be saved, more income can be brought to drivers, and the riding cost of each passenger can be saved.
Step S1: and acquiring a special car order request of the passenger terminal, and creating a special car order.
In the mode, the passenger end generates a special car order in a normal special car mode, before the special car order is established, passengers need to fill in riding requirements including data of a riding starting point, a riding terminal point, the number of passengers and the like, and the network appointment system generates the special car order according to the riding requirements.
Step S2: and classifying the special vehicle orders based on preset classification rules.
Through presetting classification rules, the passengers with the same riding requirements in the special vehicle orders are identified, and the riding requirements are the same and can be expressed as: the special vehicle orders with the same riding requirements are assigned to the same class and set up on the same driving track, so that the drivers of the vehicles are convenient to appoint on the same configuration network.
In a preferred embodiment, classifying the special vehicle order based on the preset classification rule specifically includes:
step S201: acquiring starting point data and end point data of a special vehicle order, and mapping the starting point data and the end point data into a grid map; the grid map divides the map into a plurality of grids;
step S202: the special vehicle orders with the starting point and the ending point positioned on the same grid in the grid map are classified into the same type, and a category data set is established.
In steps S201 to S202, a grid map is created for the selected city, the polygonal grid is overlaid on the selected city map according to the hierarchical grid system, the longitude and latitude are encoded according to the real-time road condition information, the codes with different digits are changed into the codes with different digits according to different grid sending precisions, and the codes of the longitude and latitude coordinates in the same polygonal grid are the same. If the starting point code and the ending point code of the two special vehicle orders are the same, the riding requirements of the passenger ends of the two special vehicle orders are the same, and the two special vehicle orders can belong to the same class. The width of the polygonal mesh can be flexibly adjusted according to the actual riding conditions, such as: in the working and off-duty time periods of the normal working day, the width of the polygonal grid is smaller, the starting position and the end position belonging to the same polygonal grid are closer, and the riding requirements of the passenger end are closer; during holidays, the passengers mostly travel shopping or shopping, and the width of the polygonal mesh can be increased a little at the moment. In the embodiment, the polygonal meshes are preferably hexagonal meshes, the sample deviation caused by the boundary effect of the mesh shape can be reduced due to the fact that the area perimeter of each hexagon is relatively low, the distances of centroids between the hexagonal meshes and surrounding meshes are equal, and no gap exists after the hexagonal meshes are paved in the whole space-time area.
In a preferred embodiment, the longitude and latitude coordinates belonging to the same street are set to have the same code according to the real-time road condition, and the width of the polygonal grid is set and cannot be changed along with the real-time road condition, so that the same street may be divided into two polygonal grids or even more polygonal grids. And a large number of one-way roads exist in real-time road conditions, a driver needs to run the whole street when driving, the problem of detour of another person is solved, and even if the two longitude and latitude coordinates are respectively positioned in two different polygonal grids, the driving track of one order is a continuation road section of the driving track of another order, the two special vehicle orders are also divided into the same type.
In a preferred embodiment, the present embodiment is only directed to short-distance special car orders on a preset route. For example, user a and user B both start and end points are within the same grid, and the order legs are within 2.5 KM.
Step S3: and sending a order-sharing request to a passenger terminal belonging to the same type of special vehicle orders.
Step S4: and converting the special car order which receives the order combination request into a car combination order.
In steps S3 to S4, when two or more special car orders belong to the same category, a order-sharing request is sent to the passenger side through the passenger side app, and other passenger information for sharing is indicated in the order-sharing request, if the passenger agrees with the order-sharing request, the passenger' S special car order is converted into a car-sharing order, and if the passenger disagrees with the car-sharing order, the passenger is matched with other driver sides.
In an embodiment, after the special car order accepting the order-sharing request is converted into a car-sharing order, the method further includes:
step S5: and acquiring a passenger number threshold value at the driver end.
Step S6: and counting the total number of passengers of the carpooling order, and matching the corresponding driver terminal according to the total number of the passengers of the carpooling order.
In steps S5-S6, in this embodiment, the passenger terminals receiving the order-sharing request are matched, and then the corresponding driver terminals are matched for the passengers. When a driver registers a network car booking platform as a driver of the network car booking platform, the driver needs to upload relevant information corresponding to the network car booking, wherein the relevant information comprises the total number of seats of the network car booking, a general network car booking driver occupies one driver seat, the rest of the drivers are used as seats of passengers, and the number of the seats of the general network car booking is 3-5. And counting the total number of people belonging to the same type of carpool orders, and distributing an operator end to the carpool orders according to the number of seats at the operator end, so as to ensure that each passenger after carpooling can seat when taking the network appointment.
In a preferred embodiment, if the number of the special car orders of the passenger side exceeds 3, the car sharing request is not sent to the passenger side any more, and because the total number of the passengers of the special car orders meets the number of the passengers on the network car reservation, the passengers can be prevented from sitting without seats, meanwhile, the economic loss brought to the driver is avoided, and the benefit of the driver side is ensured.
In another embodiment, further comprising:
step S7: and acquiring a passenger number threshold value at the driver end.
Step S8: counting the total number of passengers in the same type of special vehicle orders, matching the corresponding driver side according to the total number of the passengers in the same type of special vehicle orders, and setting the matching state of the special vehicle orders as a pre-matching state.
Step S9: converting the matching state of the carpool order into a matched state, and distributing a corresponding driver end according to the pre-matching state;
step S10: and converting the matching state of the special car order which is not converted into the carpool order into the unmatched state, and redistributing the driver end to the special car order.
In steps S7 to S10, in this embodiment, a matching status label is added to the order, the corresponding driver side is matched according to the total number of passengers in the same type of special car order, and the matching status of the special car order is set to be a pre-matching status. If other special vehicle orders with the same riding requirements exist in the set time, a vehicle sharing request is sent to a user who establishes the special vehicle order at the earliest time, then the vehicle sharing request is sent to the passenger end, if the passenger receives the vehicle sharing request, the special vehicle order of the passenger is converted into the vehicle sharing order, the state of the vehicle sharing order is converted into a matched state, and if other passengers also receive the vehicle sharing request, the special vehicle orders of other passengers are converted into the vehicle sharing order and the state of the vehicle sharing order is converted into the matched state. And if the first passenger side does not agree with the car sharing request or other special car orders with the same riding requirements do not exist within the set time, converting the special car order from a pre-matching state into an unmatched state, and distributing a special car driver side for the special car order.
In summary, when the method of the present invention is executed, on one hand, the passenger terminals with the same riding requirements are identified by the preset classification rules, the special car orders of the passenger terminals are collected, the order-sharing request is sent to the passenger terminals, and the special car orders receiving the order-sharing request are converted into the order-sharing order, so that the transportation capacity of the networked car reservation can be saved, more income is brought to the driver, and the riding cost is saved for each passenger. On the other hand, the grid map established by the polygonal grid can flexibly adjust the width of the polygon, and codes the longitude and latitude by combining the real-time road condition information, so that passenger terminals with the same riding requirements can be accurately inquired.
Other steps of the carpooling method of the present invention are referred to the prior art.
Example 2
In a second aspect, as shown in fig. 2, the invention discloses a car pooling device, which comprises an order creating module M1, an order sorting module M2, an order pooling request sending module M3 and an order conversion module M4.
The order creating module M1 is configured to obtain a special car order request from a passenger end, and create a special car order;
the order classification module M2 is used for classifying the special vehicle orders based on preset classification rules;
the order-sharing request sending module M3 is used for sending order-sharing requests to passenger terminals belonging to the same type of special vehicle orders;
the order conversion module M4 is configured to convert the special car order that receives the order splicing request into a car splicing order.
Aiming at the second aspect, the method also comprises the 1 st preferred implementation, and further comprises a first obtaining module M5 and a matching module M6.
The first obtaining module M5 is used for obtaining a passenger number threshold value at a driver end;
the matching module M6 is used for counting the total number of passengers of the car sharing order and matching the corresponding driver terminal according to the total number of the passengers of the car sharing order.
The second aspect further includes a second acquiring module M7 and a matching state setting module M8 according to the second preferred embodiment.
The second obtaining module M7 is used for obtaining the passenger number threshold value at the driver end;
the matching state setting module M8 is configured to count the total number of passengers in the same type of special car order, match the corresponding driver end according to the total number of passengers in the same type of special car order, and set the matching state of the special car order to be a pre-matching state.
Aiming at the second aspect, the system also comprises a 3 rd preferred implementation, and further comprises a first conversion module M9 and a second conversion module M10.
The first conversion module M9 is used for converting the matching state of the car pooling order into a matched state and distributing a corresponding driver terminal according to the pre-matching state;
the second conversion module M10 is configured to convert the matching status of the special car order that is not converted into the carpool order into an unmatched status, and redistribute the driver end to the special car order.
For the second aspect, further including the 4 th preferred implementation, the order classification module M2 includes:
the system comprises a mapping unit, a grid map and a processing unit, wherein the mapping unit is used for acquiring starting point data and end point data of a special vehicle order and mapping the starting point data and the end point data into the grid map; the grid map divides the map into a plurality of grids;
and the dividing unit is used for dividing the special vehicle orders with the starting points and the end points positioned on the same grid in the grid map into the same type and establishing a category data set.
In summary, when the apparatus of this embodiment is operated, all steps of the order combining method described in embodiment 1 can be implemented, so as to achieve the technical effect achieved in embodiment 1.
Other structures of the sheet splicing device described in the embodiment are referred to in the prior art.
Example 3
The invention also discloses an electronic device, at least one processor and a memory communicatively connected with the at least one processor, wherein the memory stores instructions executable by the at least one processor, the instructions are executed by the at least one processor, and when the at least one processor executes the instructions, the following steps are specifically realized:
acquiring a special car order request of a passenger terminal, and creating a special car order;
classifying the special vehicle orders based on a preset classification rule;
sending a order-sharing request to a passenger side belonging to the same type of special vehicle orders;
and converting the special car order which receives the order combination request into a car combination order.
Example 4
The invention also discloses a storage medium, which stores a computer program, and when the computer program is executed by a processor, the following steps are concretely realized:
acquiring a special car order request of a passenger terminal, and creating a special car order;
classifying the special vehicle orders based on a preset classification rule;
sending a order-sharing request to a passenger side belonging to the same type of special vehicle orders;
and converting the special car order which receives the order sharing request into a car sharing order.
The present disclosure may be methods, apparatus, systems, and/or computer program products. The computer program product may include a computer-readable storage medium having computer-readable program instructions embodied thereon for carrying out various aspects of the present disclosure.
The computer readable storage medium may be a tangible device that can hold and store the instructions for use by the instruction execution device. The computer readable storage medium may be, for example, but not limited to, an electronic memory device, a magnetic memory device, an optical memory device, an electromagnetic memory device, a semiconductor memory device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: 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), a Static Random Access Memory (SRAM), a portable compact disc read-only memory (CD-ROM), a Digital Versatile Disc (DVD), a memory stick, a floppy disk, a mechanical coding device, such as punch cards or in-groove projection structures having instructions stored thereon, and any suitable combination of the foregoing. Computer-readable storage media as used herein is not to be construed as transitory signals per se, such as radio waves or other freely propagating electromagnetic waves, electromagnetic waves propagating through a waveguide or other transmission medium (e.g., optical pulses through a fiber optic cable), or electrical signals transmitted through electrical wires.
The computer-readable program instructions described herein may be downloaded from a computer-readable storage medium to a respective computing/processing device, or to an external computer or external storage device via a network, such as the internet, a local area network, a wide area network, and/or a wireless network. The network may include copper transmission cables, fiber optic transmission, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers. The network adapter card or network interface in each computing/processing device receives computer-readable program instructions from the network and forwards the computer-readable program instructions for storage in a computer-readable storage medium in the respective computing/processing device.
The computer program instructions for carrying out operations of the present disclosure may be assembler instructions, Instruction Set Architecture (ISA) instructions, machine-related instructions, microcode, firmware instructions, state setting data, or source or object code written in any combination of one or more programming languages, including an object oriented programming language such as Smalltalk, C + +, Java, or the like, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The computer readable program instructions may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider). In some embodiments, the electronic circuitry that can execute the computer-readable program instructions implements aspects of the present disclosure by utilizing the state information of the computer-readable program instructions to personalize the electronic circuitry, such as a programmable logic circuit, a Field Programmable Gate Array (FPGA), or a Programmable Logic Array (PLA).
Having described embodiments of the present disclosure, the foregoing description is intended to be exemplary, not exhaustive, and not limited to the disclosed embodiments. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen in order to best explain the principles of the embodiments, the practical application, or improvements to the technology in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.

Claims (10)

1. A method of carpooling, comprising:
acquiring a special car order request of a passenger terminal, and creating a special car order;
classifying the special vehicle orders based on a preset classification rule;
sending a order-sharing request to a passenger side belonging to the same type of special vehicle orders;
and converting the special car order which receives the order combination request into a car combination order.
2. The car pooling method of claim 1, wherein after converting the special car order accepting the order pooling request into a car pooling order, further comprising:
acquiring a passenger number threshold value at a driver end;
and counting the total number of passengers of the carpooling order, and matching the corresponding driver terminal according to the total number of the passengers of the carpooling order.
3. The carpooling method of claim 1, further comprising:
acquiring a passenger number threshold value at a driver end;
counting the total number of passengers in the same type of special vehicle orders, matching the corresponding driver side according to the total number of the passengers in the same type of special vehicle orders, and setting the matching state of the special vehicle orders as a pre-matching state.
4. A carpooling method according to claim 3, further comprising:
converting the matching state of the carpool order into a matched state, and distributing a corresponding driver end according to the pre-matching state;
and converting the matching state of the special car order which is not converted into the carpool order into the unmatched state, and redistributing the driver end to the special car order.
5. The carpooling method according to claim 1, wherein classifying the special car orders based on a preset classification rule specifically comprises:
acquiring starting point data and end point data of a special vehicle order, and mapping the starting point data and the end point data into a grid map; the grid map divides the map into a plurality of grids;
the special vehicle orders with the starting point and the ending point positioned on the same grid in the grid map are classified into the same type, and a category data set is established.
6. A ride share device, comprising:
the order creating module is used for acquiring a special car order request of a passenger terminal and creating a special car order;
the order classification module is used for classifying the special vehicle orders based on a preset classification rule;
the order-sharing request sending module is used for sending order-sharing requests to passenger terminals belonging to the same type of special vehicle orders;
and the order conversion module is used for converting the special car order which receives the order sharing request into the car sharing order.
7. The ride share device of claim 6, further comprising:
the first acquisition module is used for acquiring a passenger number threshold value at a driver end;
and the matching module is used for counting the total number of passengers of the carpooling order and matching the corresponding driver terminal according to the total number of the passengers of the carpooling order.
8. The ride share device of claim 6, further comprising:
the second acquisition module is used for acquiring the passenger number threshold value of the driver end;
and the matching state setting module is used for counting the total number of passengers in the same type of special vehicle orders, matching the corresponding driver side according to the total number of the passengers in the same type of special vehicle orders, and setting the matching state of the special vehicle orders as a pre-matching state.
9. The ride share device of claim 8, further comprising:
the first conversion module is used for converting the matching state of the carpool order into a matched state and distributing a corresponding driver terminal according to the pre-matching state;
and the second conversion module is used for converting the matching state of the special car order which is not converted into the carpool order into the unmatched state and redistributing the driver end to the special car order.
10. The car pooling method of claim 6, wherein said order classification module comprises:
the system comprises a mapping unit, a grid map and a processing unit, wherein the mapping unit is used for acquiring starting point data and end point data of a special vehicle order and mapping the starting point data and the end point data into the grid map; the grid map divides the map into a plurality of grids;
and the dividing unit is used for dividing the special vehicle orders with the starting points and the end points positioned on the same grid in the grid map into the same type and establishing a category data set.
CN202210461842.1A 2022-04-28 2022-04-28 Carpooling method and device Pending CN114881728A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210461842.1A CN114881728A (en) 2022-04-28 2022-04-28 Carpooling method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210461842.1A CN114881728A (en) 2022-04-28 2022-04-28 Carpooling method and device

Publications (1)

Publication Number Publication Date
CN114881728A true CN114881728A (en) 2022-08-09

Family

ID=82671102

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210461842.1A Pending CN114881728A (en) 2022-04-28 2022-04-28 Carpooling method and device

Country Status (1)

Country Link
CN (1) CN114881728A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110633424A (en) * 2018-05-30 2019-12-31 广州汽车集团股份有限公司 Stroke matching method and system
CN111833090A (en) * 2020-01-20 2020-10-27 北京嘀嘀无限科技发展有限公司 Method, device and equipment for processing car sharing order and storage medium
CN111860929A (en) * 2020-03-18 2020-10-30 北京嘀嘀无限科技发展有限公司 Car-sharing order-form-piecing-rate estimation method and system
CN111860902A (en) * 2019-05-20 2020-10-30 北京嘀嘀无限科技发展有限公司 Order processing method, device, equipment and computer readable storage medium

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110633424A (en) * 2018-05-30 2019-12-31 广州汽车集团股份有限公司 Stroke matching method and system
CN111860902A (en) * 2019-05-20 2020-10-30 北京嘀嘀无限科技发展有限公司 Order processing method, device, equipment and computer readable storage medium
CN111833090A (en) * 2020-01-20 2020-10-27 北京嘀嘀无限科技发展有限公司 Method, device and equipment for processing car sharing order and storage medium
CN111860929A (en) * 2020-03-18 2020-10-30 北京嘀嘀无限科技发展有限公司 Car-sharing order-form-piecing-rate estimation method and system

Similar Documents

Publication Publication Date Title
US8886453B2 (en) System and method for efficient routing on a network in the presence of multiple-edge restrictions and other constraints
US11386359B2 (en) Systems and methods for managing a vehicle sharing facility
US10749734B2 (en) Management of events and moving objects
US11392861B2 (en) Systems and methods for managing a vehicle sharing facility
US20200210905A1 (en) Systems and Methods for Managing Networked Vehicle Resources
CN109596132A (en) Vehicle dispatching method and device
US20210073734A1 (en) Methods and systems of route optimization for load transport
CN103198652B (en) Taxi operation business management system and method based on mobile internet
CN105279955A (en) Carpooling method and device
CN111882107B (en) Driver and passenger matching method based on automatic driving shared taxi system
CN111144684A (en) Vehicle scheduling system, server and information processing method
US8855920B2 (en) Automatic assistance for route planning
CN112906949A (en) Route planning method and device, electronic equipment and readable storage medium
CN113642761A (en) Robotaxi automatic driving shared network car booking resource allocation method
CN114881728A (en) Carpooling method and device
US20220319243A1 (en) Information processing device and information processing method
CN114881692A (en) Network appointment scheduling method and device, electronic equipment and storage medium
Howell et al. New mobility in the right-of-way
US20210166175A1 (en) Determining at least one schedule for at least one transport from a plurality of transport
JP7540422B2 (en) Traffic management device, system, and traffic management method
CN114841716B (en) Individual user oriented Robotaxi implementation method, server and system
CN114004546A (en) Network appointment vehicle distribution method and device, electronic equipment and storage medium
US20240289707A1 (en) Method and system to track and optimize vehicle operators performance
JP2017134757A (en) Operation vehicle specifying device, vehicle management server, and management terminal
Ji et al. Urban passenger-and-package sharing transportation by e-hailing taxis: A simulation-based pricing analysis in shanghai

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