CN109635980B - Method and system for allocating order of vehicle - Google Patents

Method and system for allocating order of vehicle Download PDF

Info

Publication number
CN109635980B
CN109635980B CN201811573541.8A CN201811573541A CN109635980B CN 109635980 B CN109635980 B CN 109635980B CN 201811573541 A CN201811573541 A CN 201811573541A CN 109635980 B CN109635980 B CN 109635980B
Authority
CN
China
Prior art keywords
order
vehicle
vehicles
route information
passengers
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201811573541.8A
Other languages
Chinese (zh)
Other versions
CN109635980A (en
Inventor
陈江
游举国
何其亮
艾旭
张文韬
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing Huwochuxing Network Technology Co ltd
Original Assignee
Chongqing Huwochuxing Network 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 Chongqing Huwochuxing Network Technology Co ltd filed Critical Chongqing Huwochuxing Network Technology Co ltd
Priority to CN201811573541.8A priority Critical patent/CN109635980B/en
Publication of CN109635980A publication Critical patent/CN109635980A/en
Application granted granted Critical
Publication of CN109635980B publication Critical patent/CN109635980B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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
    • G06Q10/00Administration; Management
    • G06Q10/02Reservations, e.g. for tickets, services or events
    • 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
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311Scheduling, planning or task assignment for a person or group
    • 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
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06315Needs-based resource requirements planning or analysis
    • 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
    • YGENERAL 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
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02TCLIMATE CHANGE MITIGATION TECHNOLOGIES RELATED TO TRANSPORTATION
    • Y02T10/00Road transport of goods or passengers
    • Y02T10/10Internal combustion engine [ICE] based vehicles
    • Y02T10/40Engine management systems

Landscapes

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

Abstract

The invention relates to the technical field of network vehicle order allocation, in particular to a vehicle order allocation method, which comprises the following steps: acquiring an order of a user, wherein the order comprises given route information; matching the vehicles marked with the established route information in the vehicles according to the established route information; the order is sent to one or more of the matched vehicles. The invention also discloses a vehicle order distribution system. The invention utilizes the order to carry the information of the established route to orient the distribution of the order, can realize without complex algorithm, have correspondence between vehicle and established route, has facilitated the driver to accept the order of orientation, after this kind of order is oriented, has reduced the probability that is refused to accept the order too, the service supply and demand both sides reach the consensus more easily, has greatly raised the probability that the full load spells up and takes advantage of, it is most beneficial to driver and user.

Description

Method and system for allocating order of vehicle
Technical Field
The invention relates to the technical field of network vehicle order allocation, in particular to a vehicle order allocation method and system.
Background
At present, with the continuous development of internet technology, taxi taking software is more and more popular with people. When a passenger needs to drive, information such as the driving time, the vehicle type which the passenger wants to take, the driving place and the like can be selected through driving software, the information is submitted to the system platform, an order is formed on the system platform and is issued to a driver user registered on the system platform, and the driver user and the vehicle are usually bound with each other, so that the order is issued to the vehicle, the driver screens the order at the driver end and takes a bill, and the travel of people is convenient to a certain extent.
At present, the allocation principles of orders in the prior art are quite large, but the orders are not treated differently for long-distance travel orders with travel demands of common urban traffic, the orders are uniformly allocated together with the common travel orders, a driver is harder to obtain the orders pertinently, the orders are not allocated to proper drivers, the possibility of refusing to take the orders is increased, the order allocation process and the final order forming time are prolonged, particularly, in order to reduce expenditure, a great number of the orders are pieced together, the full-load pieced together is naturally the most beneficial situation for both the driver and the user, the problem that the order forming time is long is caused due to the fact that a certain number of users which need to go to the same direction are involved, and if the circulation times of the orders are further prolonged to form the order time, the user experience is reduced.
Disclosure of Invention
The invention overcomes the defects of the prior art, provides a network about vehicle order distribution method and a system, and solves the technical problem that the long-distance travel orders with travel demands different from common urban traffic are not treated differently, so that user experience is reduced.
One aspect of the present invention provides a method for allocating a vehicle order, comprising the steps of:
acquiring an order of a user, wherein the order comprises given route information;
matching the vehicles marked with the established route information in the vehicles according to the established route information;
the order is sent to one or more of the matched vehicles.
Further, the order also includes departure time information, passenger number information and boarding and disembarking place information.
Further, the order also includes service type information, and the service types in the service type information include: one or more of non-ride-able, station-on-vehicle models and ride-able, non-station-on-vehicle models;
and according to the service type information, matching the vehicle according to the established route information into the vehicle, and matching the vehicle marked with the service type capable of providing the service type again.
Further, when the service type in the service type information is the vehicle type on the collable station, all matched vehicles are arranged into a queue, and the following strategies are adopted to send the order to the vehicles:
preferentially sending the vehicle which is the forefront in the queue and has received the order which is the same as the established route information contained in the order;
if the total number of the passengers of the order plus the number of the passengers of the vehicle for which the order has been taken exceeds the upper limit of the number of the passengers of the vehicle, preferentially issuing the next vehicle in the queue, which has been taken with the same order as the given route information contained in the order;
if the departure time of the order exceeds the time difference of the earliest departure time in the orders received by the vehicle by comparison with the preset value, the next vehicle which has received the same order as the preset route information contained in the order is preferentially sent to the queue;
if the vehicles which have received the same order as the set route information contained in the order are no longer in the queue, the vehicles are sent to the vehicle at the forefront end of the queue;
and eliminating the vehicle from the queue when the sum of the passengers of the orders taken by the vehicle in the queue is equal to the upper limit of the passengers of the vehicle or the current time is less than a preset time threshold from the earliest departure time in the order taken by the vehicle.
Further, when the service type in the service type information is a vehicle type on a non-station, arranging all matched vehicles with orders into a waiting sequence according to the latest order receiving time of the vehicles, and sending the orders to the vehicles by adopting the following strategies;
preferentially sending the vehicle which is the most previous in the waiting sequence and has received the order which is the same as the established route information contained in the order;
if the total number of the passengers of the order plus the number of the passengers of the vehicle for which the order has been taken exceeds the upper limit of the number of the passengers of the vehicle, preferentially issuing the next vehicle in the waiting sequence, which has been taken with the same order as the given route information contained in the order;
if the departure time of the order exceeds the time difference of the earliest departure time in the orders received by the vehicle by comparison with the preset value, the next vehicle which has received the same order as the preset route information contained in the order in the waiting sequence is preferentially sent out;
if the waiting sequence does not have the vehicles which have received the order identical to the established route information contained in the order, sending the order robbing information of the order to all the matched vehicles which have not received the order;
when the vehicle is known to rob the order and take the order, marking the vehicle as the taken vehicle, and knowing that the time is the order taking time;
and when the sum of the passengers of the orders taken by the vehicles in the waiting sequence is equal to the upper limit of the passengers of the vehicles, or the sum of the orders taken reaches the maximum order number threshold, or the current time is less than the preset time threshold from the earliest departure time in the orders taken, removing the vehicles from the waiting sequence.
Another aspect of the invention provides a vehicle order distribution system comprising:
the order acquisition module is used for acquiring an order of a user, wherein the order comprises established route information;
the order matching module is used for matching the vehicles marked with the established route information in the vehicles according to the established route information;
and the order sending module is used for sending the order to one or more matched vehicles.
Further, the order also includes departure time information, passenger number information and boarding and disembarking place information.
Further, the order also contains service type information, wherein the service type in the service type information comprises one or more of a non-collectable type, a collectable site vehicle type and a collectable non-site vehicle type;
the order matching module is also used for matching the vehicles with the types of the services according to the service type information and matching the vehicles with the types of the services again according to the established route information.
Further, the order sending module is configured to, when the service type in the service type information is a vehicle type on a collectable station, rank all matched vehicles into a queue, and send the order to the vehicles by adopting the following policies:
preferentially sending the vehicle which is the forefront in the queue and has received the order which is the same as the established route information contained in the order;
if the total number of the passengers of the order plus the number of the passengers of the vehicle for which the order has been taken exceeds the upper limit of the number of the passengers of the vehicle, preferentially issuing the next vehicle in the queue, which has been taken with the same order as the given route information contained in the order;
if the departure time of the order exceeds the time difference of the earliest departure time in the orders received by the vehicle by comparison with the preset value, the next vehicle which has received the same order as the preset route information contained in the order is preferentially sent to the queue;
if the vehicles which have received the same order as the set route information contained in the order are no longer in the queue, the vehicles are sent to the vehicle at the forefront end of the queue;
and eliminating the vehicle from the queue when the sum of the passengers of the orders taken by the vehicle in the queue is equal to the upper limit of the passengers of the vehicle or the current time is less than a preset time threshold from the earliest departure time in the order taken by the vehicle.
Further, the order sending module is configured to, when the service type in the service type information is a vehicle type on a non-station, arrange all vehicles matched with the order in the vehicles as a waiting sequence according to the latest order receiving time, and send the order to the vehicles by adopting the following strategy;
preferentially sending the vehicle which is the most previous in the waiting sequence and has received the order which is the same as the established route information contained in the order;
if the total number of the passengers of the order plus the number of the passengers of the vehicle for which the order has been taken exceeds the upper limit of the number of the passengers of the vehicle, preferentially issuing the next vehicle in the waiting sequence, which has been taken with the same order as the given route information contained in the order;
if the departure time of the order exceeds the time difference of the earliest departure time in the orders received by the vehicle by comparison with the preset value, preferentially sending the next vehicle which has received the same order as the preset route information contained in the order in the waiting sequence;
if the waiting sequence does not have the vehicles which have received the order identical to the established route information contained in the order, sending the order robbing information of the order to all the matched vehicles which have not received the order;
when the vehicle is known to rob the order and take the order, the vehicle is marked as the taken vehicle, and the time is known as the order taking time.
And when the sum of the passengers of the orders taken by the vehicles in the waiting sequence is equal to the upper limit of the passengers of the vehicles, or the sum of the orders taken reaches the maximum order number threshold, or the current time is less than the preset time threshold from the earliest departure time in the orders taken, removing the vehicles from the waiting sequence.
Finally, the invention utilizes the order to carry the information of the established route to distribute the order, can be realized without complex algorithm, has the corresponding relation between the vehicle and the established route, is convenient for a driver to accept the directed order, reduces the probability of refusing to accept the order after the order is directed, ensures that service suppliers and consumers can reach consensus more easily, and greatly improves the probability of full-load sharing to be most beneficial to both drivers and users.
Drawings
FIG. 1 is a flow chart of a method of allocation of a vehicle order in an embodiment of the invention.
FIG. 2 is a logic block diagram of a vehicle order distribution system in an embodiment of the present invention.
Detailed Description
The following is a further detailed description of the embodiments:
fig. 1 is a flowchart of a method for assigning an order for a vehicle according to an embodiment of the present invention. The method for allocating a vehicle order according to the present embodiment may be performed by a vehicle order allocation system, which may be implemented in hardware and/or software. Referring to fig. 1, the vehicle order processing method of the present embodiment includes the steps of:
s11, acquiring an order of a user, wherein the order comprises established route information;
in practical application, a user requests a vehicle-restraining service by sending vehicle-restraining request information. Therefore, the riding departure place and the riding destination can be placed in the riding request information, so that the riding system can acquire the riding departure place and the riding destination of the user from the riding request information by analyzing the riding request.
In the embodiment of the invention, after a user starts a vehicle restraint program, first, vehicle restraint request information is sent through a predetermined operation, wherein the vehicle restraint request information includes, but is not limited to, information such as a vehicle taking place, a vehicle taking destination and the like. And the vehicle-restraining system acquires a riding departure place and a riding destination of the user traveling at this time by receiving vehicle-restraining request information sent by the user equipment so as to generate a follow-up order.
The established route information in the invention points to the always relation between a route departure place and a route destination and does not point to a specific running route, so the route departure place and the route destination point to a certain geographic area, and the area division can be custom or administrative division collection;
for example: the administrative district to which the departure place of the bus belongs is the A city-B county/district, the administrative district to which the destination of the bus belongs is the C city-D county/district, and a set route can exist between different districts/counties in the same city; in addition, because the distance between main urban areas is close and the traffic is convenient, the area-level administrative areas in the main urban areas can be combined into one or more areas, namely, the established route of the main urban area of the A city/the F area of the A city-the D county/the area exists.
The given route information in the invention can be manually input by a user, can be realized by using a geographic information service system to acquire administrative areas to which the departure place and destination of the bus belong, and can be other technical means known to those skilled in the art, which are not described in detail herein. The given route information of the order is different from other taxi-taking service requirements of urban traffic, particularly the taxi-taking requirement of long-distance travel, so that the specific allocation is provided, the service is matched quickly, and the background can control and manage the given route information in the order by adding, deleting and modifying the given route.
In one embodiment, the order further includes departure time information, information on the number of passengers, and information on the location of the departure/departure.
S12, matching the vehicles marked with the given route information in the vehicles according to the given route information;
in a further embodiment, the order further includes service type information, where the service type in the service type information includes one or more of a non-collectable, a collectable site vehicle model, and a collectable non-site vehicle model;
correspondingly, according to the service type information, vehicles which can provide the service type are matched and marked again in the vehicles which are matched and marked according to the established route information.
The labeling of the information of the established route information and the type of the service provided can be completed when the vehicle is registered, namely, the vehicle is bound with a driver end, or the labeling can be performed by a system background after the registration, the same vehicle can be labeled with a plurality of established route information or is labeled to be suitable for all established routes, and the labeling is equivalent to labeling all the established route information; naturally, these annotations can be deleted, added and modified later.
S13, sending the order to one or more matched vehicles.
In a specific embodiment, when the service type in the service type information is a vehicle type on a plaqueable station, all matched vehicles are arranged into a queue, and the following strategies are adopted to send the order to the vehicles:
preferentially sending the vehicle which is the forefront in the queue and has received the order which is the same as the established route information contained in the order;
if the total number of the passengers of the order plus the number of the passengers of the vehicle for which the order has been taken exceeds the upper limit of the number of the passengers of the vehicle, preferentially issuing the next vehicle in the queue, which has been taken with the same order as the given route information contained in the order;
if the departure time of the order exceeds the time difference of the earliest departure time in the orders received by the vehicle by comparison with the preset value, the next vehicle which has received the same order with the preset route information contained in the order is preferentially sent to the queue;
if the vehicles which have received the same order as the set route information contained in the order are no longer in the queue, the vehicles are sent to the vehicle at the forefront end of the queue;
and eliminating the vehicle from the queue when the sum of the passengers of the orders taken by the vehicle in the queue is equal to the upper limit of the passengers of the vehicle or the current time is less than a preset time threshold from the earliest departure time in the order taken by the vehicle.
When the service type in the service type information is the vehicle type on the carpooling station, arranging all matched vehicles with the order into a waiting sequence according to the latest order receiving time of the vehicles, and sending the order to the vehicles by adopting the following strategies;
preferentially sending the vehicle which is the most previous in the waiting sequence and has received the order which is the same as the established route information contained in the order;
if the total number of the passengers of the order plus the number of the passengers of the vehicle for which the order has been taken exceeds the upper limit of the number of the passengers of the vehicle, or the next vehicle which has been taken with the same order as the given route information contained in the order in the waiting sequence is preferentially issued;
if the departure time of the order exceeds the time difference of the earliest departure time in the orders received by the vehicle by comparison with the preset value, preferentially sending the next vehicle which has received the same order as the preset route information contained in the order in the waiting sequence;
if the waiting sequence does not have the vehicles which have received the order identical to the established route information contained in the order, sending the order robbing information of the order to all the matched vehicles which have not received the order;
when the vehicle is known to rob the order and take the order, marking the vehicle as the taken vehicle, and knowing that the time is the order taking time;
and when the sum of the passengers of the orders taken by the vehicles in the waiting sequence is equal to the upper limit of the passengers of the vehicles, or the sum of the orders taken reaches the maximum order number threshold, or the current time is less than the preset time threshold from the earliest departure time in the orders taken, removing the vehicles from the waiting sequence.
Optionally, when the order is a carpooling station boarding model, the boarding location information in the order is used for acquiring a nearby common boarding station for the departure place, the common boarding station can be provided by a geographic information service system and the departure place, the technology is relatively existing, details are not needed here, and in addition, after the order is completed, the state of the vehicle is restored to the state of not taking the order by taking the order completion information sent from one side of the vehicle as a trigger condition.
In this embodiment, the long-distance sharing is organized by using the predetermined route, and the order receiving rate is high for the drivers willing to receive such orders, so that the utilization rate of vehicle resources is improved, the income is ensured, and the expenditure of consumers can be reduced. In order to better reduce the transportation cost, the driver and the passengers can quickly reach consensus by using the way of getting on the bus at the station, so that the driver can more easily pick up the passengers, and the situation that the on-bus point is not easy to find or the positioning/input is wrong during pick-up is reduced; the cost is reduced, and the expenditure of the user can be correspondingly reduced. The vehicle type with larger space can be allocated to complete the order, the cost is shared by increasing the number of passengers/the number of singular, the expenditure of users is further reduced, and the users correspondingly lose riding comfort and pick-up real-time performance. Therefore, the embodiment distinguishes the expense grade, the riding losing comfort and the receiving and sending instantaneity through the service type, and the non-ride sharing type has the highest expense, riding losing comfort and receiving and sending instantaneity; the number of the passengers/the number of the singular forms is smaller than that of the vehicles on the non-station, for example, 5 cars are used for providing service, the number of the orders for the passengers is not more than two, the boarding place is designated by passengers, and the recommended boarding place is not needed; the vehicle type on the non-station can be ridden, more than 7 vehicle types are adopted to provide service, the number of orders for ridding is not limited, and the total number of people cannot exceed the upper limit of riding, and the boarding place must be the boarding station. By using the time threshold, the departure time of orders taken by the same vehicle can be prevented from being too long, the threshold can be set to be one hour, for example, and excessive delay of time of users is avoided; the earliest departure time of an order may also be limited so that there is enough time to promote ride sharing from the time the about car order is placed until departure, and more advanced time about cars are generally acceptable to users with long distance travel needs. In practice, one or more of the service types may be selectively opened according to actual situations such as user demand of different predetermined routes.
It can be understood that the above service types are only used for explaining the embodiments of the present invention, and are not limited to the technical solution of the present invention, and further service types corresponding to more outgoing modes can be added later, which is not particularly limited by the present invention.
It should be understood by those skilled in the art that the user equipment mentioned in the embodiments of the present invention refers to a call service party, such as a passenger in a vehicle calling service, a mobile terminal or a personal computer (Personal Computer, abbreviated as PC) or the like; the driver side mentioned in the embodiment of the present invention refers to a device such as a smart phone, a Personal Digital Assistant (PDA), a tablet computer, a notebook computer, a vehicle-mounted computer (carpenter), a palm game machine, a smart glasses, a smart watch, a wearable device, a virtual display device or a display enhancement device (such as Google Glass, an eye lift, hollens, and a Gear VR) used by a mobile terminal or a personal computer (Personal Computer, abbreviated as PC) serving a called party, such as a driver in a vehicle calling service.
For the method embodiments, for simplicity of explanation, the methodologies are shown as a series of acts, but one of ordinary skill in the art will appreciate that the present embodiments are not limited by the order of acts described, as some acts may, in accordance with the present embodiments, occur in other orders or concurrently. Further, those skilled in the art will appreciate that the embodiments described in the specification are all preferred embodiments and that the actions involved are not necessarily required for the present embodiment.
Fig. 2 is a logic block diagram of a vehicle order distribution system of one implementation of the present embodiment. Referring to fig. 2, the order distribution system for a vehicle includes:
the order acquisition module is used for acquiring an order of a user, wherein the order comprises established route information;
the order matching module is used for matching the vehicles marked with the established route information in the vehicles according to the established route information;
in a further embodiment, the order further includes departure time information, information on the number of passengers, and information on the boarding and disembarking places.
In a further embodiment, the order further includes service type information, and the service type in the service type information includes: one or more of non-ride-able, station-on-vehicle models and ride-able, non-station-on-vehicle models;
the order matching module is also used for matching the vehicles with the types of the services according to the service type information and matching the vehicles with the types of the services again according to the established route information.
And the order sending module is used for sending the order to one or more matched vehicles.
In a specific embodiment, the order sending module is configured to, when the service type in the service type information is a vehicle type on a collectable station, rank all matched vehicles into a queue, and send the order to the vehicles by adopting the following policies:
preferentially sending the vehicle which is the forefront in the queue and has received the order which is the same as the established route information contained in the order;
if the total number of the passengers of the order plus the number of the passengers of the vehicle for which the order has been taken exceeds the upper limit of the number of the passengers of the vehicle, preferentially issuing the next vehicle in the queue, which has been taken with the same order as the given route information contained in the order;
if the departure time of the order exceeds the time difference of the earliest departure time in the orders received by the vehicle by comparison with the preset value, the next vehicle which has received the same order with the preset route information contained in the order is preferentially sent to the queue;
if the vehicles which have received the same order as the set route information contained in the order are no longer in the queue, the vehicles are sent to the vehicle at the forefront end of the queue;
and eliminating the vehicle from the queue when the sum of the passengers of the orders taken by the vehicle in the queue is equal to the upper limit of the passengers of the vehicle or the current time is less than a preset time threshold from the earliest departure time in the order taken by the vehicle.
In a specific embodiment, the order sending module is configured to, when the service type in the service type information is a vehicle type on a collectable station, arrange all vehicles matched with the order in the vehicles as a waiting sequence according to the latest order receiving time, and send the order to the vehicles by adopting the following strategy;
preferentially sending the vehicle which is the most previous in the waiting sequence and has received the order which is the same as the established route information contained in the order;
if the total number of the passengers of the order plus the number of the passengers of the vehicle for which the order has been taken exceeds the upper limit of the number of the passengers of the vehicle, preferentially issuing the next vehicle in the waiting sequence, which has been taken with the same order as the given route information contained in the order;
if the departure time of the order exceeds the time difference of the earliest departure time in the orders received by the vehicle by comparison with the preset value, preferentially sending the next vehicle which has received the same order as the preset route information contained in the order in the waiting sequence;
if the waiting sequence does not have the vehicles which have received the order identical to the established route information contained in the order, sending the order robbing information of the order to all the matched vehicles which have not received the order;
when the vehicle is known to rob the order and take the order, the vehicle is marked as the taken vehicle, and the time is known as the order taking time.
And when the sum of the passengers of the orders taken by the vehicles in the waiting sequence is equal to the upper limit of the passengers of the vehicles, or the sum of the orders taken reaches the maximum order number threshold, or the current time is less than the preset time threshold from the earliest departure time in the orders taken, removing the vehicles from the waiting sequence.
In all embodiments of the system of the present invention, the service logic and information content settings of various services are the same as those in the embodiments of the method of the present invention, and are not described herein. The specific implementation means mentioned in the embodiments of the method of the present invention are not described herein.
It should be noted that technical terms or means such as taxi taking software and order taking, order sending, knowledge of the current order situation of the vehicle, and change of the current order state of the vehicle are all well known in the field of network taxi taking, and are not described herein.
Finally, the invention utilizes the order to carry the information of the established route to distribute the order, can be realized without complex algorithm, has the corresponding relation between the vehicle and the established route, is convenient for a driver to accept the directed order, reduces the probability of refusing to accept the order after the order is directed, ensures that service suppliers and consumers can reach consensus more easily, and greatly improves the probability of full-load sharing to be most beneficial to both drivers and users.
The implementation of this embodiment and all of the functional operations provided herein may be implemented in digital electronic circuitry, or in computer software, firmware, or hardware, including the structures of the embodiments described in this specification and their structural equivalents, or in combinations of one or more of them. Implementations of the present embodiments may be implemented as one or more computer program products, i.e., one or more modules of computer program instructions encoded on a computer-readable medium for execution by, or to control the operation of, data processing apparatus. The computer readable medium can be a machine readable storage device, a machine readable storage substrate, a memory device, a composition of matter effecting a machine readable propagated signal, or a combination of one or more of them. The term "data processing apparatus" encompasses all apparatus, devices, and machines for processing data, including by way of example a programmable processor, a computer, or multiple processors or computers. In addition to hardware, the apparatus may include code that creates an execution environment for the described computer program, such as code that constitutes processor firmware, a protocol stack, a database management system, an operating system, or a combination of one or more of them.
A computer program (also known as a program, software application, script, or code) can be written in any form of programming language, including compiled or interpreted languages, and it can be deployed in any form, including as a stand-alone program or as a module, component, subroutine, or other unit suitable for use in a computing environment. The computer program does not necessarily correspond to a file in a file system. A program can be stored in a portion of a file that holds other programs or data (e.g., one or more scripts stored in a markup language document), in a single file dedicated to the program in question, or in multiple coordinated files (e.g., files that store one or more modules, sub-programs, or portions of code). A computer program can be deployed to be executed on one computer or on multiple computers at one site or distributed across multiple sites and interconnected by a communication network.
The processes and logic flows described in this embodiment can be performed by one or more programmable processors executing one or more computer programs to perform functions by operating on input data and generating output. The processes and logic flows can also be performed by, and apparatus can also be implemented as, special purpose logic circuitry, e.g., an FPGA (field programmable gate array) or an ASIC (application-specific integrated circuit). Processors suitable for the execution of a computer program include, by way of example, both general and special purpose microprocessors, and any one or more processors of any kind of digital computer. Generally, a processor will receive instructions and data from a read-only memory or a random access memory or both. Elements of a computer may include a processor for executing instructions and one or more memory devices for storing instructions and data. Typically, a computer will also include, or be operatively coupled to receive data from or transfer data to, or both, one or more mass storage devices, e.g., magnetic, magneto-optical disks, or optical disks. However, the computer need not have such a device. In addition, the computer may be embedded in another device, such as a mobile phone, a Personal Digital Assistant (PDA), a mobile audio player, a Global Positioning System (GPS) receiver, and the like. Computer readable media suitable for storing computer program instructions and data include all forms of non-volatile memory, media and memory devices including, for example: semiconductor memory devices such as EPROM, EEPROM, and flash memory devices; magnetic disks, such as built-in hard disks or removable disks; magneto-optical disk; CD ROM and DVD-ROM discs. The processor and the memory may be supplemented by, or incorporated in, special purpose logic circuitry.
To provide for interaction with a user, the implementation of the present embodiments can be performed on a computer having a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to the user and a keyboard and a pointing device (e.g., a mouse or a trackball by which the 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, such as visual feedback, auditory feedback, or tactile feedback; and input from the user may be received in any form, including auditory, speech, or tactile input.
While this embodiment includes some details, these should not be construed as limiting the scope of this embodiment or the claimed subject matter, but rather as describing features of example implementations of this embodiment. Certain features of the embodiments that are described in the context of separate implementations may also be provided in combination in a single implementation. Conversely, various features that are described in the context of a single implementation can also be provided in multiple implementations separately or in any suitable subcombination. Furthermore, although features may be described above as being performed in certain combinations and even initially claimed as such, one or more features from a claimed combination may in some cases be excised from the combination, and the claimed combination may be directed to a subcombination or variation of a subcombination.
Similarly, although operations are depicted in the drawings in a particular order, this should not be understood as requiring that such operations be performed in the particular order shown or in sequential order, or that all illustrated operations be performed, to achieve desirable results. In some circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the implementations described above should not be understood as requiring such separation in all implementations, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.
The above embodiments are only suitable for illustrating the present invention, not for limiting the present invention, and various changes and modifications may be made by one skilled in the relevant art without departing from the spirit and scope of the present invention, and thus all equivalent technical solutions are also within the scope of the present invention, which is defined by the claims.

Claims (4)

1. The vehicle order allocation method is characterized by comprising the following steps of:
acquiring an order of a user, wherein the order comprises given route information;
matching the vehicles marked with the established route information in the vehicles according to the established route information;
transmitting the order to one or more of the matched vehicles;
the order also comprises departure time information, passenger number information and boarding and disembarking place information;
the order also comprises service type information, wherein the service type in the service type information comprises one or more of a non-collectable type, a collectable site vehicle type and a collectable non-site vehicle type;
according to the service type information, matching the service type information with the vehicles which can provide the service type again in the vehicles which are matched with the established route information;
the method comprises the steps that a route departure place and a route destination in the established route information point to a geographical area, an administrative area or a set of administrative areas which are divided in an administrative way, and area-level administrative areas are combined into one or more areas; the vehicle marking information comprises established route information and service type;
the marking setting mode comprises the steps that when a vehicle is registered, namely when the vehicle is bound with a driver end, marking is carried out by a system background after registration, and deletion, addition and modification can be carried out; the same vehicle may be marked with a plurality of pieces of given route information, or marked as suitable for all given routes, equivalent to being marked with all pieces of given route information;
the car type can be ridden at the station, 5 cars are adopted to provide service, the number of orders for ridding is not more than two, the boarding location is designated by passengers, and the recommended riding station is not needed; the vehicle type on the non-station can be ridden, more than 7 vehicle types are adopted to provide service, the number of orders for ridding is not limited, the total number of people cannot exceed the upper limit of riding, and the boarding site must be the riding station;
when the service type in the service type information is the type of the vehicle on the collable station, all matched vehicles are arranged into a queue, and the following strategies are adopted to send the order to the vehicles:
preferentially sending the vehicle which is the forefront in the queue and has received the order which is the same as the established route information contained in the order;
if the total number of the passengers of the order plus the number of the passengers of the vehicle for which the order has been taken exceeds the upper limit of the number of the passengers of the vehicle, preferentially issuing the next vehicle in the queue, which has been taken with the same order as the given route information contained in the order;
if the departure time of the order exceeds the time difference of the earliest departure time in the orders received by the vehicle by comparison with the preset value, the next vehicle which has received the same order with the preset route information contained in the order is preferentially sent to the queue;
if the vehicles which have received the same order as the set route information contained in the order are no longer in the queue, the vehicles are sent to the vehicle at the forefront end of the queue;
when the sum of the passengers of the orders taken by the vehicles in the queue is equal to the upper limit of the passengers of the vehicles, or the earliest departure time in the order taken by the current time is less than a preset time threshold value, the vehicles are removed from the queue;
after the vehicle completes the order, the state of the vehicle is restored to the state of not receiving the order by taking the order completion information sent by one side of the vehicle as a trigger condition.
2. The vehicle order allocation method according to claim 1, wherein: when the service type in the service type information is a vehicle type on a non-station which can be taken together, arranging all vehicles matched with the order in the vehicles into a waiting sequence according to the latest order taking time of the vehicles, and sending the order to the vehicles by adopting the following strategies;
preferentially sending the vehicle which is the most previous in the waiting sequence and has received the order which is the same as the established route information contained in the order;
if the total number of the passengers of the order plus the number of the passengers of the vehicle for which the order has been taken exceeds the upper limit of the number of the passengers of the vehicle, or the next vehicle which has been taken with the same order as the given route information contained in the order in the waiting sequence is preferentially issued;
if the departure time of the order exceeds the time difference of the earliest departure time in the orders received by the vehicle by comparison with the preset value, preferentially sending the next vehicle which has received the same order as the preset route information contained in the order in the waiting sequence;
if the waiting sequence does not have the vehicles which have received the order identical to the established route information contained in the order, sending the order robbing information of the order to all the matched vehicles which have not received the order;
when the vehicle is known to rob the order and take the order, marking the vehicle as the taken vehicle, and knowing that the time is the order taking time;
and when the sum of the passengers of the orders taken by the vehicles in the queue is equal to the upper limit of the passengers of the vehicles, or the sum of the orders taken reaches the threshold value of the maximum number of orders, or the current time is less than the preset time threshold value from the earliest departure time in the orders taken, removing the vehicles from the queue.
3. About car order distribution system, its characterized in that: comprising the following steps:
the order acquisition module is used for acquiring an order of a user, wherein the order comprises established route information;
the order matching module is used for matching the vehicles marked with the established route information in the vehicles according to the established route information;
an order sending module for sending the order to one or more of the matched vehicles;
the order also comprises departure time information, passenger number information and boarding and disembarking place information;
the order also contains service type information, and the service types in the service type information comprise: one or more of non-ride-able, station-on-vehicle models and ride-able, non-station-on-vehicle models;
the order matching module is also used for matching the vehicles with the types of the services according to the service type information and matching the vehicles with the types of the services again according to the established route information;
the method comprises the steps that a route departure place and a route destination in the established route information point to a geographical area, an administrative area or a set of administrative areas which are divided in an administrative way, and area-level administrative areas are combined into one or more areas; the vehicle marking information comprises established route information and service type;
the order sending module is used for queuing all matched vehicles when the service type in the service type information is the vehicle type on the station, and sending the order to the vehicles by adopting the following strategies:
preferentially sending the vehicle which is the forefront in the queue and has received the order which is the same as the established route information contained in the order;
if the total number of the passengers of the order plus the number of the passengers of the vehicle for which the order has been taken exceeds the upper limit of the number of the passengers of the vehicle, preferentially issuing the next vehicle in the queue, which has been taken with the same order as the given route information contained in the order;
if the departure time of the order exceeds the time difference of the earliest departure time in the orders received by the vehicle by comparison with the preset value, the next vehicle which has received the same order with the preset route information contained in the order is preferentially sent to the queue;
if the vehicles which have received the same order as the set route information contained in the order are no longer in the queue, the vehicles are sent to the vehicle at the forefront end of the queue;
when the sum of the passengers of the orders taken by the vehicles in the queue is equal to the upper limit of the passengers of the vehicles, or the earliest departure time in the order taken by the current time is less than a preset time threshold value, the vehicles are removed from the queue;
the car type can be ridden at the station, 5 cars are adopted to provide service, the number of orders for ridding is not more than two, the boarding location is designated by passengers, and the recommended riding station is not needed; the vehicle type on the non-station can be ridden, more than 7 vehicle types are adopted to provide service, the number of orders for ridding is not limited, the total number of people cannot exceed the upper limit of riding, and the boarding site must be the riding station;
the marking setting mode comprises the steps that when a vehicle is registered, namely when the vehicle is bound with a driver end, marking is carried out by a system background after registration, and deletion, addition and modification can be carried out; the same vehicle may be marked with a plurality of pieces of given route information, or marked as suitable for all given routes, equivalent to being marked with all pieces of given route information;
after the vehicle completes the order, the state of the vehicle is restored to the state of not receiving the order by taking the order completion information sent by one side of the vehicle as a trigger condition.
4. The order distribution system according to claim 3, wherein: the order sending module is used for arranging all matched vehicles with orders into a waiting sequence according to the latest order receiving time of the vehicles, and sending the orders to the vehicles by adopting the following strategies when the service type in the service type information is a vehicle type capable of being taken by a non-station vehicle;
preferentially sending the vehicle which is the most previous in the waiting sequence and has received the order which is the same as the established route information contained in the order;
if the total number of the passengers of the order plus the number of the passengers of the vehicle for which the order has been taken exceeds the upper limit of the number of the passengers of the vehicle, preferentially issuing the next vehicle in the waiting sequence, which has been taken with the same order as the given route information contained in the order;
if the departure time of the order exceeds the time difference of the earliest departure time in the orders received by the vehicle by comparison with the preset value, preferentially sending the next vehicle which has received the same order as the preset route information contained in the order in the waiting sequence;
if the waiting sequence does not have the vehicles which have received the order identical to the established route information contained in the order, sending the order robbing information of the order to all the matched vehicles which have not received the order;
when the vehicle is known to rob the order and take the order, marking the vehicle as the taken vehicle, and knowing that the time is the order taking time;
and when the sum of the passengers of the orders taken by the vehicles in the waiting sequence is equal to the upper limit of the passengers of the vehicles, or the sum of the orders taken reaches the maximum order number threshold, or the current time is less than the preset time threshold from the earliest departure time in the orders taken, removing the vehicles from the waiting sequence.
CN201811573541.8A 2018-12-21 2018-12-21 Method and system for allocating order of vehicle Active CN109635980B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811573541.8A CN109635980B (en) 2018-12-21 2018-12-21 Method and system for allocating order of vehicle

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811573541.8A CN109635980B (en) 2018-12-21 2018-12-21 Method and system for allocating order of vehicle

Publications (2)

Publication Number Publication Date
CN109635980A CN109635980A (en) 2019-04-16
CN109635980B true CN109635980B (en) 2023-09-05

Family

ID=66076408

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811573541.8A Active CN109635980B (en) 2018-12-21 2018-12-21 Method and system for allocating order of vehicle

Country Status (1)

Country Link
CN (1) CN109635980B (en)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111860902A (en) * 2019-05-20 2020-10-30 北京嘀嘀无限科技发展有限公司 Order processing method, device, equipment and computer readable storage medium
CN110728476A (en) * 2019-10-11 2020-01-24 广州小马智行科技有限公司 Order processing method and device
CN111178567B (en) * 2019-12-31 2024-05-31 联想(北京)有限公司 Information processing method and apparatus
CN111461485A (en) * 2020-03-02 2020-07-28 平安国际智慧城市科技股份有限公司 Task allocation method, device, equipment and computer readable storage medium
CN111738550B (en) * 2020-05-21 2023-07-25 深圳赛安特技术服务有限公司 Travel guest-building method, device, equipment and storage medium based on dynamic programming
CN112149856A (en) * 2020-10-20 2020-12-29 北京嘀嘀无限科技发展有限公司 Network appointment order processing method and device, electronic equipment and readable storage medium
CN113361916A (en) * 2021-06-04 2021-09-07 付鑫 Multi-mode sharing travel fusion scheduling optimization system considering single-cut scene
CN113902151A (en) * 2021-09-28 2022-01-07 广汽本田汽车有限公司 Method, system and device for controlling massage of online appointment vehicle seat and storage medium
CN116644942B (en) * 2023-07-24 2023-10-24 山东车拖车网络科技有限公司 Automatic trailer service matching method

Citations (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101355714A (en) * 2007-07-24 2009-01-28 梁宇杰 System and method for real time pooling vehicle
CN103259783A (en) * 2013-04-09 2013-08-21 安徽科技学院 Real-time Android mobile terminal carpooling system and method based on SIP conversation and LBS positioning
CN103531025A (en) * 2013-11-08 2014-01-22 宁波市康惠网络科技有限公司 Carpooling system for matching information through route segmenting method
CN104616527A (en) * 2015-02-04 2015-05-13 上海市政工程设计研究总院(集团)有限公司 Bus station-arrival information automatic-publishing system and information publishing method thereof
CN104900050A (en) * 2015-06-24 2015-09-09 四川大学 Car sharing system route publishing and matching algorithm based on network map API
CN104933765A (en) * 2015-06-24 2015-09-23 四川大学 Recommended fare calculation method in carpooling system
CN105894359A (en) * 2016-03-31 2016-08-24 百度在线网络技术(北京)有限公司 Order pushing method, device and system
CN106297608A (en) * 2016-09-30 2017-01-04 防城港市港口区晶通科技有限公司 A kind of windward driving Billboard
CN106875674A (en) * 2017-04-14 2017-06-20 上海雷腾软件股份有限公司 A kind of method and apparatus for vehicle scheduling
CN106952086A (en) * 2016-09-05 2017-07-14 中华电信股份有限公司 In-vehicle payment system and method
CN107844986A (en) * 2016-09-21 2018-03-27 北京嘀嘀无限科技发展有限公司 One kind uses car order pricing method and server
CN107945503A (en) * 2017-12-25 2018-04-20 武汉斑马快跑科技有限公司 The share-car method and system of windward driving
CN108009657A (en) * 2017-08-16 2018-05-08 北京嘀嘀无限科技发展有限公司 Net about car order processing method, system, terminal and server
CN108009650A (en) * 2017-03-29 2018-05-08 北京嘀嘀无限科技发展有限公司 Net about car service request processing method, device and server
CN108133290A (en) * 2017-12-21 2018-06-08 北京中交兴路信源科技有限公司 A kind of preferential dispatching method of timeliness and system
CN108537353A (en) * 2017-03-02 2018-09-14 北京嘀嘀无限科技发展有限公司 About vehicle method, about vehicle device and about vehicle system
CN108694452A (en) * 2017-04-06 2018-10-23 北京嘀嘀无限科技发展有限公司 Vehicle-mounted order method and device, server, onboard system, vehicle

Patent Citations (17)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101355714A (en) * 2007-07-24 2009-01-28 梁宇杰 System and method for real time pooling vehicle
CN103259783A (en) * 2013-04-09 2013-08-21 安徽科技学院 Real-time Android mobile terminal carpooling system and method based on SIP conversation and LBS positioning
CN103531025A (en) * 2013-11-08 2014-01-22 宁波市康惠网络科技有限公司 Carpooling system for matching information through route segmenting method
CN104616527A (en) * 2015-02-04 2015-05-13 上海市政工程设计研究总院(集团)有限公司 Bus station-arrival information automatic-publishing system and information publishing method thereof
CN104900050A (en) * 2015-06-24 2015-09-09 四川大学 Car sharing system route publishing and matching algorithm based on network map API
CN104933765A (en) * 2015-06-24 2015-09-23 四川大学 Recommended fare calculation method in carpooling system
CN105894359A (en) * 2016-03-31 2016-08-24 百度在线网络技术(北京)有限公司 Order pushing method, device and system
CN106952086A (en) * 2016-09-05 2017-07-14 中华电信股份有限公司 In-vehicle payment system and method
CN107844986A (en) * 2016-09-21 2018-03-27 北京嘀嘀无限科技发展有限公司 One kind uses car order pricing method and server
CN106297608A (en) * 2016-09-30 2017-01-04 防城港市港口区晶通科技有限公司 A kind of windward driving Billboard
CN108537353A (en) * 2017-03-02 2018-09-14 北京嘀嘀无限科技发展有限公司 About vehicle method, about vehicle device and about vehicle system
CN108009650A (en) * 2017-03-29 2018-05-08 北京嘀嘀无限科技发展有限公司 Net about car service request processing method, device and server
CN108694452A (en) * 2017-04-06 2018-10-23 北京嘀嘀无限科技发展有限公司 Vehicle-mounted order method and device, server, onboard system, vehicle
CN106875674A (en) * 2017-04-14 2017-06-20 上海雷腾软件股份有限公司 A kind of method and apparatus for vehicle scheduling
CN108009657A (en) * 2017-08-16 2018-05-08 北京嘀嘀无限科技发展有限公司 Net about car order processing method, system, terminal and server
CN108133290A (en) * 2017-12-21 2018-06-08 北京中交兴路信源科技有限公司 A kind of preferential dispatching method of timeliness and system
CN107945503A (en) * 2017-12-25 2018-04-20 武汉斑马快跑科技有限公司 The share-car method and system of windward driving

Also Published As

Publication number Publication date
CN109635980A (en) 2019-04-16

Similar Documents

Publication Publication Date Title
CN109635980B (en) Method and system for allocating order of vehicle
US10482771B2 (en) Ride chaining
US20220044186A1 (en) Arranging a transport service for multiple users
TWI696977B (en) Method and system for providing transportation service
US9805431B2 (en) Systems and methods for allocating networked vehicle resources in priority environments
CN105070044B (en) Dynamic scheduling method for customized buses and car pooling based on passenger appointments
US20160247095A1 (en) Systems and Methods for Managing a Vehicle Sharing Facility
US20150161752A1 (en) Intelligent queuing for user selection in providing on-demand services
EP3507749A2 (en) Driver location prediction for a transportation service
EP3332365A1 (en) Systems and methods for adjusting ride-sharing schedules and routes
US10021243B2 (en) Telephone call placement
US20160247094A1 (en) Systems and Methods for Managing a Vehicle Sharing Facility
CN107103376A (en) One kind is called a taxi method and system
US10869066B2 (en) Media content delivery system
US11270232B2 (en) Method for transporting a plurality of objects between object-specific locations
US20200226498A1 (en) Allocation of vehicles to passengers using route preferences
US11481821B2 (en) Vehicle allocation for fixed rental rides
CN106504558A (en) The treating method and apparatus of vehicle travel task
WO2022247580A1 (en) Order processing method and apparatus, server and storage medium
KR20210151771A (en) A recording medium in which a program for executing a vehicle dispatch management method running to a destination, a management server used therefor, and a dispatch management method for a vehicle running to a destination are recorded
CN109242178A (en) Based on people, vehicle, the planing method for customizing public transport path stood
US12124974B2 (en) Method, apparatus and storage medium for vehicle requests and roof-light display management
JP7489276B2 (en) Vehicle dispatch reservation management system, vehicle dispatch system, vehicle dispatch reservation data management device, and vehicle dispatch reservation data management program
CN109635979A (en) A kind of net about vehicle
CN116255995A (en) Vehicle navigation control method and device and vehicle

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant