WO2018176849A1 - Systems and methods for allocating vehicles for on-demand services - Google Patents

Systems and methods for allocating vehicles for on-demand services Download PDF

Info

Publication number
WO2018176849A1
WO2018176849A1 PCT/CN2017/110885 CN2017110885W WO2018176849A1 WO 2018176849 A1 WO2018176849 A1 WO 2018176849A1 CN 2017110885 W CN2017110885 W CN 2017110885W WO 2018176849 A1 WO2018176849 A1 WO 2018176849A1
Authority
WO
WIPO (PCT)
Prior art keywords
order
queue
user terminal
orders
waiting
Prior art date
Application number
PCT/CN2017/110885
Other languages
English (en)
French (fr)
Inventor
Niping ZHANG
Lu Li
Zhan Wang
Kehua SHENG
Zhenghua Wu
Original Assignee
Beijing Didi Infinity Technology And Development 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
Priority claimed from CN201710196641.2A external-priority patent/CN108009650A/zh
Priority claimed from CN201710195830.8A external-priority patent/CN108009841A/zh
Application filed by Beijing Didi Infinity Technology And Development Co., Ltd. filed Critical Beijing Didi Infinity Technology And Development Co., Ltd.
Priority to CN201780035203.6A priority Critical patent/CN109313776A/zh
Priority to AU2017406770A priority patent/AU2017406770A1/en
Priority to EP17904135.5A priority patent/EP3577620A4/en
Priority to JP2019548912A priority patent/JP6867504B2/ja
Publication of WO2018176849A1 publication Critical patent/WO2018176849A1/en

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063—Operations research, analysis or management
    • G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06311—Scheduling, planning or task assignment for a person or group
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00—Commerce
    • G06Q30/06—Buying, selling or leasing transactions
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/40—Business processes related to the transportation industry

Definitions

  • This present disclosure generally relates to methods and systems for allocating vehicles for on-demand services, and more particularly, to methods and systems for displaying and/or updating a status of a vehicle allocation to a user after the user requests for a service.
  • a user may have to wait for the service request to be allocated to a vehicle. Since the user may not be aware of information related to a status of the service request (e.g., a count of waiting orders before the order, a total count of waiting orders, a count of current available vehicles available to take the orders, etc. ) , the user cannot determine a travel mode that fits his/her needs based on his/her own situation and/or the information related to the status of the service request. Accordingly, it is desirable to provide systems and methods for displaying and/or updating a status of a vehicle allocation to a user after the user requested for a service.
  • a status of the service request e.g., a count of waiting orders before the order, a total count of waiting orders, a count of current available vehicles available to take the orders, etc.
  • a system may include at least one computer-readable storage medium including a set of instructions for allocating a vehicle for an on-demand service and at least one processor configured to communicate with the at least one computer-readable storage medium.
  • the at least one processor When executing the set of instructions, the at least one processor is directed to: receive a service request from a user terminal, wherein the service request may include a start location and a destination; generate an order with respect to the service request having a first estimated price based on the start location and the destination; add the order into a first queue to be allocated to a vehicle; and send a first display instruction to the user terminal, wherein the first display instruction may instruct the user terminal to display information related to a status of the order.
  • the formation related to a status of the order includes at least one of: the first estimated price, a count of waiting orders in the first queue before the order, an estimated waiting time of the order in the first queue, a total count of waiting orders in the first queue, or a count of vehicles available to take the orders in the first queue.
  • the at least one processor is further directed to: obtain historical waiting data; and determine the estimated waiting time of the order based on the historical waiting data, wherein the estimated waiting time indicates a time when the order in the first queue will be processed or a time period during which the order in the first queue will be processed.
  • the at least one processor is further directed to: determine that the count of waiting orders in the first queue before the order is less than an order threshold; and send a second display instruction to the user terminal, the second display instruction instructing the user terminal to display vehicle allocation status.
  • the at least one processor is further directed to: determine that the estimated waiting time of the order in the first queue is less than a first time threshold; and send a second display instruction to the user terminal, the second display instruction instructing the user terminal to display vehicle allocation status.
  • the at least one processor is further directed to: determine that the estimated waiting time of the order in the first queue is greater than a second time threshold; and send a third display instruction to the user terminal, the third display instruction instructing the user terminal to display one or more suggestions to the user for selection to complete the service request, wherein the one or more suggestions include carpooling.
  • the at least one processor is further directed to: determine a queuing mode of the first queue; and add the order into the first queue according to the queuing mode, wherein the queuing mode includes at least one of a strict mode with respect to a confirmation time of the order or a non-strict mode with respect to a weight of the order.
  • the at least one processor is further directed to: determine that a current waiting time is greater than a third time threshold; and send a fourth display instruction to the user terminal, the fourth display instruction instructing the user terminal to display a query as to whether to continue waiting.
  • the at least one processor is further directed to: determine that the current waiting time is greater than a fourth time threshold, the fourth time threshold being greater than the third time threshold; and cancel the order.
  • the at least one processor is further directed to: determine that the order satisfies a first condition; send a fifth display instruction to the user terminal, the fifth display instruction instructing the user terminal to display an alternative travel suggestion with respect to the service request having a second estimated price, and the second estimated price being greater than the first estimated price; receive a selection of the alternative travel suggestion having the second estimated price; and add the order into a second queue, wherein a second ratio of a second count of vehicles available to take the orders from the second queue to a second count of waiting orders in the second queue is greater than a first ratio of a first count of vehicles available to take the orders from the first queue to a first count of waiting orders in the first queue.
  • the at least one processor is further directed to: determine an area based on the start location of the order; determine a count of vehicles in the area that are available to take the orders from the first queue; determine a total count of waiting orders in the area from the first queue; and determine that the total count of waiting orders in the area is greater than the count of vehicles in the area that are available to take the orders from the first queue.
  • the at least one processor is further directed to: determine that a current time is within a predetermined time range.
  • a method may be implemented on a computing device having at least one processor, at least one computer-readable storage medium, and a communication platform connected to a network.
  • the method may include receiving a service request from a user terminal, wherein the service request may include a start location and a destination; generating an order with respect to the service request having a first estimated price based on the start location and the destination; adding the order into a first queue to be allocated to a vehicle; and sending a first display instruction to the user terminal, wherein the first display instruction may instruct the user terminal to display information related to a status of the order.
  • the information related to a status of the order includes at least one of: the first estimated price, a count of waiting orders in the first queue before the order, an estimated waiting time of the order in the first queue, a total count of waiting orders in the first queue, or a count of vehicles available to take the orders in the first queue.
  • the method further comprises: determining that the count of waiting orders in the first queue before the order is less than an order threshold; and sending a second display instruction to the user terminal, the second display instruction instructing the user terminal to display vehicle allocation status.
  • the method further comprises: determining that the estimated waiting time of the order in the first queue is less than a first time threshold; and sending a second display instruction to the user terminal, the second display instruction instructing the user terminal to display vehicle allocation status.
  • the method further comprises: determining that the estimated waiting time of the order in the first queue is greater than a second time threshold; and sending a third display instruction to the user terminal, the third display instruction instructing the user terminal to display one or more suggestions to the user for selection to complete the service request, wherein the one or more suggestions include carpooling.
  • the method further comprises: determining that a current waiting time is greater than a third time threshold; and sending a fourth display instruction to the user terminal, the fourth display instruction instructing the user terminal to display a query as to whether to continue waiting.
  • the method further comprises: determining that the order satisfies a first condition; sending a fifth display instruction to the user terminal, the fifth display instruction instructing the user terminal to display an alternative travel suggestion with respect to the service request having a second estimated price, and the second estimated price being greater than the first estimated price; receiving a selection of the alternative travel suggestion having the second estimated price; and adding the order into a second queue, wherein a second ratio of a second count of vehicles available to take the orders from the second queue to a second count of waiting orders in the second queue is greater than a first ratio of a first count of vehicles available to take the orders from the first queue to a first count of waiting orders in the first queue.
  • a non-transitory computer readable medium may include at least one set of instructions for allocating a vehicle for an on-demand service, when executed by at least one processor of a computer device, the at least one set of instructions directs the at least one processor to:receive a service request from a user terminal, the service request including a start location and a destination; generate an order with respect to the service request having a first estimated price based on the start location and the destination; add the order into a first queue to be allocated to a vehicle; and send a first display instruction to the user terminal, the first display instruction instructing the user terminal to display information related to a status of the order.
  • FIG. 1 is a block diagram of an exemplary vehicle allocating system according to some embodiments of the present disclosure
  • FIG. 2 illustrates a block diagram of exemplary hardware and/or software components of a computing device according to some embodiments of the present disclosure
  • FIG. 3 illustrates a block diagram of exemplary hardware and/or software components of a mobile device according to some embodiments of the present disclosure
  • FIG. 4 is a schematic block diagram illustrating an exemplary processing engine according to some embodiments of the present disclosure
  • FIG. 5 is a flowchart illustrating an exemplary process for allocating a vehicle for a service request according to some embodiments of the present disclosure
  • FIG. 6 is a schematic diagram illustrating an exemplary process for allocating a vehicle for an order in a queue according to some embodiments of the present disclosure
  • FIG. 7 is an exemplary user interface of a user terminal according to some embodiments of the present disclosure.
  • FIG. 8 is a flowchart illustrating an exemplary process for determining an estimated waiting time of an order according to some embodiments of the present disclosure
  • FIG. 9 is a flowchart illustrating an exemplary process for sending a display instruction to a user terminal according to some embodiments of the present disclosure
  • FIG. 10 is an exemplary user interface of a user terminal according to some embodiments of the present disclosure.
  • FIG. 11 is a flowchart illustrating an exemplary process for sending a display instruction to a user terminal according to some embodiments of the present disclosure
  • FIG. 12 is an exemplary user interface of a user terminal according to some embodiments of the present disclosure.
  • FIG. 13 is a flowchart illustrating an exemplary process for sending a display instruction to a user terminal according to some embodiments of the present disclosure
  • FIG. 14 is a flowchart illustrating an exemplary process for canceling an order according to some embodiments of the present disclosure
  • FIG. 15 is a flowchart illustrating an exemplary process for allocating a vehicle for a service request according to some embodiments of the present disclosure
  • FIG. 16a-FIG. 16d are exemplary user interfaces of a user terminal according to some embodiments of the present disclosure.
  • FIG. 17 is a flowchart illustrating an exemplary process for determining that an order satisfies a first condition according to some embodiments of the present disclosure
  • FIG. 18a-FIG. 18h are exemplary user interfaces of a user terminal according to some embodiments of the present disclosure.
  • FIG. 19a-FIG. 19b are exemplary user interfaces of a user terminal according to some embodiments of the present disclosure.
  • system, ” “engine, ” “unit, ” “module, ” and/or “block, ” used herein are one method to distinguish different components, elements, parts, section or assembly of different level in ascending order. However, the terms may be displaced by another expression if they may achieve the same purpose.
  • the flowcharts used in the present disclosure illustrate operations that systems implement according to some embodiments of the present disclosure. It is to be expressly understood, the operations of the flowchart may be implemented not in order. Conversely, the operations may be implemented in inverted order, or simultaneously. Moreover, one or more other operations may be added to the flowcharts. One or more operations may be removed from the flowcharts.
  • passenger, ” “requester, ” “service requester, ” and “customer” in the present disclosure are used interchangeably to refer to an individual, an entity or a tool that may request or order a service.
  • driver, ” “provider, ” “service provider, ” and “supplier” in the present disclosure are used interchangeably to refer to an individual, an entity or a tool that may provide a service or facilitate the providing of the service.
  • the term “user” in the present disclosure may refer to an individual, an entity or a tool that may request a service, order a service, provide a service, or facilitate the providing of the service.
  • the user may be a passenger, a driver, an operator, or the like, or any combination thereof.
  • “passenger, ” “user equipment, ” “user terminal 130, ” and “passenger terminal” may be used interchangeably
  • driver” and “driver terminal” may be used interchangeably.
  • An aspect of the present disclosure relates to a method of vehicle allocating.
  • an order may be added into a waiting queue to be allocated to a vehicle after a user terminal sends a service request.
  • the user terminal may be instructed to display a status of the order (e.g., whether the order has been allocated to a vehicle, how long the order has to wait until being allocated to a vehicle, how many available vehicles in the waiting queue, etc. ) to notify a user of the user terminal of the status of the order.
  • the systems and methods may also determine whether the service requests sent in the current area during the current time period exceed the processing capacity of the service provider.
  • the systems and methods may provide one or more travel modes to the user so that the user can choose to change to another travel mode to be allocated to a vehicle.
  • the systems and methods according to the present disclosure may accelerate the processing of the service requests by providing the user one or more options to switch to a faster waiting queue to be allocated to a vehicle.
  • FIG. 1 is a block diagram of an exemplary vehicle allocating system 100 according to some embodiments of the present disclosure.
  • the system 100 may be an online transportation service platform for transportation services such as car hailing services, chauffeur services, vehicle delivery services, carpooling services, bus services, driver hiring services, and shuttle services, etc.
  • the vehicle allocating system 100 may include a server 110, a network 120, a user terminal 130, a driver terminal 140, and a storage 150.
  • the server 110 may be configured to process information and/or data relating to a service request, for example, a service request for hailing a car.
  • the server 110 may receive a service request from a user terminal 130, and process an order with respect to the service request to allocate a vehicle to the user terminal 130.
  • the server 110 may be a single server, or a server group.
  • the server group may be centralized, or distributed (e.g., server 110 may be a distributed system) .
  • the server 110 may be local or remote.
  • the server 110 may access information and/or data stored in the user terminal 130, the driver terminal 140, and/or the storage 150 via the network 120.
  • the server 110 may connect directly to the user terminal 130, the driver terminal 140, and/or the storage 150 to access stored information and/or data.
  • the server 110 may be implemented on a cloud platform.
  • the cloud platform may include a private cloud, a public cloud, a hybrid cloud, a community cloud, a distributed cloud, an inter-cloud, a multi-cloud, or the like, or any combination thereof.
  • the server 110 may be implemented on a computing device 200 illustrated in FIG. 2.
  • the server 110 may include a processing engine 111.
  • the processing engine 111 may process information and/or data relating to the service request to perform one or more functions described in the present disclosure. For example, the processing engine 111 may generate an order with respect to a service request having a first estimated price based on a start location and a destination of the service request. As another example, the processing engine 111 may add an order into a first queue. As still another example, the processing engine 111 may add an order into a second queue when a user chooses to accelerate the order by raising a service fee.
  • the processing engine 111 may include one or more processing engines (e.g., single-core processing engine (s) or multi-core processor (s)) .
  • the processing engine 111 may include a central processing unit (CPU) , an application-specific integrated circuit (ASIC) , an application-specific instruction-set processor (ASIP) , a graphics processing unit (GPU) , a physics processing unit (PPU) , a digital signal processor (DSP) , a field programmable gate array (FPGA) , a programmable logic device (PLD) , a controller, a microcontroller unit, a reduced instruction-set computer (RISC) , a microprocessor, or the like, or any combination thereof.
  • CPU central processing unit
  • ASIC application-specific integrated circuit
  • ASIP application-specific instruction-set processor
  • GPU graphics processing unit
  • PPU physics processing unit
  • DSP digital signal processor
  • FPGA field programmable gate array
  • PLD programmable logic device
  • controller a microcontroller unit, a reduced instruction-set computer (RISC) , a microprocessor, or the like, or any combination thereof.
  • RISC reduced
  • the network 120 may facilitate exchange of information and/or data.
  • one or more components in the vehicle allocating system 100 e.g., the server 110, the user terminal 130, the driver terminal 140, and the storage 150
  • the server 110 may obtain/acquire service request from the user terminal 130 via the network 120.
  • the network 120 may be any type of wired or wireless network, or any combination thereof.
  • the network 120 may include a cable network, a wireline network, an optical fiber network, a telecommunications network, an intranet, an Internet, a local area network (LAN) , a wide area network (WAN) , a wireless local area network (WLAN) , a metropolitan area network (MAN) , a wide area network (WAN) , a public telephone switched network (PSTN) , a Bluetooth network, a ZigBee network, a near field communication (NFC) network, or the like, or any combination thereof.
  • the network 120 may include one or more network access points.
  • the network 120 may include wired or wireless network access points such as base stations and/or internet exchange points 120-1, 120-2, ..., through which one or more components of the vehicle allocating system 100 may be connected to the network 120 to exchange data and/or information.
  • a service requester may be a user of the user terminal 130.
  • the user of the user terminal 130 may be someone other than the service requester.
  • user A of the user terminal 130 may use the user terminal 130 to send a service request for user B, or receive service and/or information or instructions from the server 110.
  • a service provider may be a user of the driver terminal 140.
  • the user of the driver terminal 140 may be someone other than the service provider.
  • user C of the driver terminal 140 may user the driver terminal 140 to receive a service request for user D, and/or information or instructions from the server 110.
  • the user terminal 130 may be configured to receive an input of a start location and/or a destination from a user. Alternatively or additionally, the user terminal 130 may receive an instruction form the server 110 to obtain the start location and/or the destination. In some embodiments, the user terminal 130 may send a service request to the processing engine 111.
  • the service request may include a start location, a destination, a user identifier of the user terminal 130, a service time, a position where the user terminal 130 initiates the service request, a service type, or the like, or any combination thereof.
  • the user terminal 130 may receive different display instructions (e.g., a first display instruction, a second display instruction, a third display instruction, a fourth display instruction, a fifth display instruction) sent by the processing engine 111.
  • the user terminal 130 may include a mobile device 130-1, a tablet computer 130-2, a laptop computer 130-3, a built-in device in a motor vehicle 130-4, or the like, or any combination thereof.
  • the mobile device 130-1 may include a smart home device, a wearable device, a smart mobile device, a virtual reality device, an augmented reality device, or the like, or any combination thereof.
  • the smart home device may include a smart lighting device, a control device of an intelligent electrical apparatus, a smart monitoring device, a smart television, a smart video camera, an interphone, or the like, or any combination thereof.
  • the wearable device may include a smart bracelet, a smart footgear, a smart glass, a smart helmet, a smart watch, a smart clothing, a smart backpack, a smart accessory, or the like, or any combination thereof.
  • the smart mobile device may include a smartphone, a personal digital assistance (PDA) , a gaming device, a navigation device, a point of sale (POS) device, or the like, or any combination thereof.
  • the virtual reality device and/or the augmented reality device may include a virtual reality helmet, a virtual reality glass, a virtual reality patch, an augmented reality helmet, an augmented reality glass, an augmented reality patch, or the like, or any combination thereof.
  • the virtual reality device and/or the augmented reality device may include a Google Glass, an Oculus Rift, a Hololens, a Gear VR, etc.
  • a built-in device in the motor vehicle 130-4 may include an onboard computer, an onboard television, etc.
  • the user terminal 130 may be a device with positioning technology for locating the location of the service requester and/or the user terminal 130.
  • the driver terminal 140 may be a device with positioning technology for locating the location of the driver and/or the driver terminal 140.
  • the user terminal 130 and/or the driver terminal 140 may communicate with other positioning device to determine the location of the service requester, the user terminal 130, the driver, and/or the driver terminal 140.
  • the user terminal 130 and/or the driver terminal 140 may send positioning information to the server 110.
  • the storage 150 may store data and/or instructions relating to the service request.
  • the storage 150 may store data obtained from the user terminal 130 and/or the driver terminal 140.
  • the storage 150 may store data and/or instructions that the server 110 may execute or use to perform exemplary methods described in the present disclosure.
  • the storage 150 may be configured to store historical waiting data.
  • the historical waiting data may include historical information relating to a plurality of historical orders, for example, start locations of the historical orders, destinations of the historical orders, order types of the historical orders, historical information related to statuses of the historical orders, or the like, or any combination thereof.
  • the storage 150 may include a mass storage, a removable storage, a volatile read-and-write memory, a read-only memory (ROM) , or the like, or any combination thereof.
  • Exemplary mass storage may include a magnetic disk, an optical disk, a solid-state drive, etc.
  • Exemplary removable storage may include a flash drive, a floppy disk, an optical disk, a memory card, a zip disk, a magnetic tape, etc.
  • Exemplary volatile read-and-write memory may include a random access memory (RAM) .
  • Exemplary RAM may include a dynamic RAM (DRAM) , a double date rate synchronous dynamic RAM (DDR SDRAM) , a static RAM (SRAM) , a thyristor RAM (T-RAM) , and a zero-capacitor RAM (Z-RAM) , etc.
  • Exemplary ROM may include a mask ROM (MROM) , a programmable ROM (PROM) , an erasable programmable ROM (PEROM) , an electrically erasable programmable ROM (EEPROM) , a compact disk ROM (CD-ROM) , and a digital versatile disk ROM, etc.
  • the storage 150 may be implemented on a cloud platform.
  • the cloud platform may include a private cloud, a public cloud, a hybrid cloud, a community cloud, a distributed cloud, an inter-cloud, a multi-cloud, or the like, or any combination thereof.
  • the storage 150 may be connected to the network 120 to communicate with one or more components in the vehicle allocating system 100 (e.g., the server 110, the user terminal 130, the driver terminal 140) .
  • One or more components in the vehicle allocating system 100 may access the data and/or instructions stored in the storage 150 via the network 120.
  • the storage 150 may be directly connected to or communicate with one or more components in the vehicle allocating system 100 (e.g., the server 110, the user terminal 130, the driver terminal 140) .
  • the storage 150 may be part of the server 110.
  • one or more components in the vehicle allocating system 100 may access the storage 150.
  • one or more components in the vehicle allocating system 100 may read and/or modify information relating to the service requester, driver, and/or the public when one or more conditions are met.
  • the server 110 may read and/or modify one or more users’information after a service.
  • the driver terminal 140 may access information relating to the service requester when receiving a service request from the user terminal 130, but the driver terminal 140 may not modify the relevant information of the service requester.
  • information exchanging of one or more components of the vehicle allocating system 100 may be achieved by way of requesting a service.
  • the object of the service request may be any product.
  • the product may be a tangible product or an immaterial product.
  • the tangible product may include food, medicine, commodity, chemical product, electrical appliance, clothing, car, housing, luxury, or the like, or any combination thereof.
  • the immaterial product may include a servicing product, a financial product, a knowledge product, an internet product, or the like, or any combination thereof.
  • the internet product may include an individual host product, a web product, a mobile internet product, a commercial host product, an embedded product, or the like, or any combination thereof.
  • the mobile internet product may be used in a software of a mobile terminal, a program, a system, or the like, or any combination thereof.
  • the mobile terminal may include a tablet computer, a laptop computer, a mobile phone, a personal digital assistance (PDA) , a smart watch, a point of sale (POS) device, an onboard computer, an onboard television, a wearable device, or the like, or any combination thereof.
  • PDA personal digital assistance
  • POS point of sale
  • the product may be any software and/or application used in the computer or mobile phone.
  • the software and/or application may relate to socializing, shopping, transporting, entertainment, learning, investment, or the like, or any combination thereof.
  • the software and/or application relating to transporting may include a traveling software and/or application, a vehicle scheduling software and/or application, a mapping software and/or application, etc.
  • the vehicle may include a horse, a carriage, a rickshaw (e.g., a wheelbarrow, a bike, a tricycle) , a car (e.g., a taxi, a bus, a private car) , a train, a subway, a vessel, an aircraft (e.g., an airplane, a helicopter, a space shuttle, a rocket, a hot-air balloon) , or the like, or any combination thereof.
  • a traveling software and/or application the vehicle may include a horse, a carriage, a rickshaw (e.g., a wheelbarrow, a bike, a tricycle) , a car (e.g., a taxi, a bus, a private car) , a train, a subway, a vessel, an aircraft (e.
  • FIG. 2 illustrates a block diagram of exemplary hardware and/or software components of a computing device 200 according to some embodiments of the present disclosure (e.g., the server 110) .
  • the particular system may use a functional block diagram to explain the hardware platform containing one or more user interfaces.
  • the computer may be a computer with general or specific functions. Both types of the computers may be configured to implement any particular system according to some embodiments of the present disclosure.
  • the computing device 200 may be configured to implement any components that provide information required by the vehicle allocating disclosed in the present description.
  • the server 110 may be implemented by hardware devices, software programs, firmware, or any combination thereof of a computer like the computing device 200.
  • the computing device 200 may determine an estimate waiting time of an order based on the historical waiting data.
  • the computing device 200 may process the historical waiting data to determine the estimated waiting time of an order according to an algorithm.
  • the algorithm may include a cluster analysis, a factor analysis, a correlation analysis, a correspondence analysis, a regression analysis, an analysis of variance, or the like, or any combination thereof.
  • the computing device 200 may determine that an estimated waiting time in a first queue is greater than a time threshold (e.g., a first time threshold, a second time threshold, a third time threshold, a fourth time threshold) .
  • FIG. 2 depicts only one computer.
  • the functions of the computer providing information that vehicle allocating may require, may be implemented by a group of similar platforms in a distributed mode to disperse the processing load of the system.
  • the computing device 200 may include a communication terminal 250 that may connect with a network that may implement the data communication.
  • the computing device 200 may also include a CPU that is configured to execute instructions and includes one or more processors.
  • the schematic computer platform may include an internal communication bus 210, different types of program storage units and data storage units, e.g. a hard disk 270, a ROM 230, a RAM 240) , various data files applicable to computer processing and/or communication, and some program instructions executed possibly by the CPU.
  • the computing device 200 may also include an I/O device 260 that may support the input and output of data flows between the computer and other components (e.g. a user interface) . Moreover, the computing device 200 may receive programs and data via the communication network.
  • FIG. 3 illustrates a block diagram of exemplary hardware and/or software components of a mobile device 300 on which the user terminal 130 or the driver terminal 140 may be implemented according to some embodiments of the present disclosure.
  • the mobile device 300 may include but is not limited to a smartphone, a tablet computer, a music player, a portable game console, a GPS receiver, a wearable calculating device (e.g. glasses, watches. ) , etc.
  • the mobile device 300 may include one or more CPUs 340, one or more GPUs 330, a display 320, a memory 360, an antenna 310 (e.g. a wireless communication unit) , a storage unit 390, and one or more input/output (I/O) devices 350.
  • I/O input/output
  • the mobile device 300 may also be any other suitable component that includes but is not limited to a system bus or a controller (not shown in FIG. 3) .
  • a mobile operating system 370 e.g. IOS, Android, Windows Phone
  • one or more applications 380 may be loaded from the storage unit 390 to the memory 360 and implemented by the CPUs 340.
  • the application 380 may include a browser or other mobile applications configured to receive and process information related to locations in the mobile device 300.
  • a computer hardware platform may be used as hardware platforms of one or more elements (e.g., the server 110 and/or other sections of the vehicle allocating system 100 described in FIG. 1) . Since these hardware elements, operating systems and program languages are common; it may be assumed that persons skilled in the art may be familiar with these techniques and they may be able to provide information required in the vehicle allocating according to the techniques described in the present disclosure.
  • a computer with the user interface may be used as a personal computer (PC) , or other types of workstations or terminal devices. After being properly programmed, a computer with the user interface may be used as a server. It may be considered that those skilled in the art may also be familiar with such structures, programs, or general operations of this type of computer device. Thus, extra explanations are not described for the Figures.
  • FIG. 4 is a schematic block diagram illustrating an exemplary processing engine 111 according to some embodiments of the present disclosure.
  • the processing engine 111 may include a receiving module 410, an order generating module 420, an allocating module 430 and a sending module 440.
  • the receiving module 410, order generating module 420, allocating module 430 and sending module 440 may be hardware circuits of all or part of the processing engine 111.
  • the receiving module 410, order generating module 420, allocating module 430 and sending module 440 may also be implemented as an application or set of instructions read and executed by the processing engine 111.
  • the receiving module 410, order generating module 420, allocating module 430 and sending module 440 may be any combination of the hardware circuits and the application/instructions.
  • the receiving module 410, order generating module 420, allocating module 430 and sending module 440 may be the part of the processing engine 111 when the processing engine is executing the application/set of instructions.
  • the receiving module 410 may be configured to receive and/or send information related to the service request from and/or to one or more components in the system 100 (e.g., the user terminal 130, the driver terminal 140, the storage 150, etc. ) .
  • the receiving module 410 may receive a service request from a user terminal 130.
  • the service request may include a start location, a destination, a user identifier of the user terminal 130, a service time, a position where the user terminal 130 initiates the service request, a service type, or the like, or any combination thereof.
  • the start location and/or the destination may include a physical address, or a geographic location represented by the longitude and latitude information.
  • the user terminal 130 may include a terminal (e.g., a wireless device such as a smart phone, a tablet computer, a laptop computer, etc. ) used by a user (e.g., a passenger, a service requester) to initiate the service request.
  • a terminal e.g., a wireless device such as a smart phone, a tablet computer, a laptop computer, etc.
  • the user terminal 130 may be implemented with an application through which the service request is initiated.
  • the receiving module 410 may obtain historical waiting data.
  • the receiving module 410 may obtain the historical waiting data from vehicle-mounted devices, municipal transportation systems, a specific database (e.g., the storage 150) , or the like, or any combination thereof.
  • the specific database may refer to a database configured to store and analyze a great amount of historical waiting data. Detailed description of the historical waiting data can be found elsewhere in this disclosure (e.g., in connection with FIG. 5) .
  • the order generating module 420 may generate an order with respect to the service request having a first estimated price based on the start location and the destination.
  • the order may include different types of orders in response to different service requests. Detailed description of the different service requests can be found elsewhere in this disclosure (e.g., in connection with FIG. 5) .
  • the order generating module 420 may determine the first estimated price based on the start location, the destination, the service time, the service type, or the like, or any combination thereof. Detailed description of determine the first estimated price can be found elsewhere in this disclosure (e.g., in connection with FIG. 5) .
  • the allocating module 430 may be configured to allocate a vehicle to the user terminal with respect to the order.
  • the allocating module 430 may include a first queuing unit 431 and a second queuing unit 433.
  • the first queuing unit 431 may be configured to process data relating to the orders in the first queue. For example, the first queuing unit 431 may add an order into a first queue to be allocated to a vehicle.
  • the first queue may include a stack of orders that are waiting in sequence to be processed.
  • the first queuing unit 431 may determine a queuing mode of the first queue, and add the order into the first queue.
  • the queuing mode may include a strict mode with respect to a confirmation time of the order and a non-strict mode with respect to a weight of the order.
  • the first queuing unit 431 may determine whether an estimated waiting time in the first queue is greater than a second time threshold, whether a current waiting time in the first queue is greater than a third time threshold and/or a fourth time threshold, whether the order satisfies a first condition, or the like, or any combination thereof.
  • the second queuing unit 433 may be configured to process data relating to the orders in the second queue. For example, the second queuing unit 433 may add the order into a second queue if the second queuing unit 433 receives a selection of the alternative travel suggestion having a second estimated price. Detailed description of the second queue and the second estimated price can be found elsewhere in this disclosure (e.g., in connection with FIG. 15) .
  • the sending module 440 may be configured to send information and/or data relating to the service request to the user terminal 130.
  • the sending module 440 may include a first sending unit 441, a second sending unit 443, a third sending unit 445, a fourth sending unit 447, and a fifth sending unit 449.
  • the first sending unit 441 may be configured to send a first display instruction to the user terminal 130.
  • the first display instruction may instruct the user terminal 130 to display information related to a status of the order.
  • the first sending unit 441 may send the first display instruction to the user terminal 130 when the count of waiting orders in the first queue before the order is larger than an order threshold.
  • the first sending unit 441 may send the first display instruction to the user terminal 130 when a current waiting time is longer than a first time threshold. In some embodiments, the first sending unit 441 may send the first display instruction to the user terminal 130 when the order is generated under a predetermined situation. In some embodiments, the first sending unit 441 may resend a new first display instruction to the user terminal 130.
  • the second sending unit 443 may be configured to send a second display instruction to the user terminal 130 when a count of waiting orders in a first queue before an order is less than an order threshold, or an estimated waiting time in the first queue is less than a first time threshold.
  • the second display instruction may instruct the user terminal 130 to display a vehicle allocation status.
  • the second sending unit 443 may be configured to directly send the second display instruction to the user terminal 130 during normal hours.
  • Normal hours may refer to time periods when the number of the available vehicles is greater than or approximately equal to the number of orders in the queue (e.g., the first queue, the second queue, etc. ) during the time periods.
  • the third sending unit 445 may be configured to send a third display instruction to the user terminal 130 when an estimated waiting time in the first queue is greater than a second time threshold.
  • the third display instruction may instruct the user terminal 130 to display one or more suggestions to the user for selection to complete the service request.
  • the one or more suggestions may include one or more alternative travel modes such as carpooling, shared shuttle service, or any other types of services, and the information related thereto.
  • the fourth sending unit 447 be configured to may send a fourth display instruction to the user terminal 130 when a current waiting time in the first queue is greater than a third time threshold.
  • the fourth display instruction may instruct the user terminal 130 to display a query as to whether to continue waiting.
  • the fifth sending unit 449 may be configured to send a fifth display instruction to the user terminal 130 when an order satisfies a first condition.
  • the fifth display instruction may instruct the user terminal 130 to display an alternative travel suggestion to the user for selection with respect to a service having a second estimated price.
  • the modules and/or units in the processing engine 111 may be connected to or communicate with each other via a wired connection or a wireless connection.
  • the wired connection may include a metal cable, an optical cable, a hybrid cable, or the like, or any combination thereof.
  • the wireless connection may include a Local Area Network (LAN) , a Wide Area Network (WAN) , a Bluetooth TM , a ZigBee TM , a Near Field Communication (NFC) , or the like, or any combination thereof.
  • LAN Local Area Network
  • WAN Wide Area Network
  • Bluetooth TM Bluetooth TM
  • ZigBee TM ZigBee TM
  • NFC Near Field Communication
  • the first queuing unit 431 may be integrated in second queuing unit 433 as a single module that may both allocate a vehicle to the user terminal.
  • two or more of the five sending units in the sending module 440 may be integrated as one unit to send the display instructions to the user terminal.
  • FIG. 5 is a flowchart illustrating an exemplary process 500 for allocating a vehicle for a service request according to some embodiments of the present disclosure.
  • one or more steps in the process 500 may be implemented in the vehicle allocating system 100 illustrated in FIG. 1.
  • one or more steps in the process 500 may be stored in the storage 150 and/or storage (e.g., the ROM 230, the RAM 240, etc. ) as a form of instructions, and invoked and/or executed by the server 110 (e.g., the processing engine 111 in the server 110, or the CPU 220 of the processing engine 111 in the server 110) .
  • the server 110 e.g., the processing engine 111 in the server 110, or the CPU 220 of the processing engine 111 in the server 110.
  • the processing engine 111 may receive a service request from a user terminal.
  • the service request may include a start location, a destination, a user identifier of the user terminal, a service time, a position where the user terminal initiates the service request, a service type, or the like, or any combination thereof.
  • the start location and/or the destination may include a physical address, or a geographic location represented by the longitude and latitude information.
  • the user terminal may include a terminal (e.g., a wireless device such as a smart phone, a tablet computer, a laptop computer, etc. ) used by a user (e.g., a passenger, a service requester) to initiate the service request.
  • a terminal e.g., a wireless device such as a smart phone, a tablet computer, a laptop computer, etc.
  • the user terminal may be implemented with an application through which the service request is initiated.
  • the user may input Xinghua Alley as the start location and Beihai North Gate as the destination in an application installed in the user’s mobile phone.
  • the user may input the start location and/or the destination by inputting text, recording voice, choosing a location automatically positioned via GPS and displayed in a map application installed in the user’s mobile phone, selecting a location from one or more recommended locations by the application based on the user’s historical usage, or the like, or any combination thereof.
  • the user may then send the service request including the start location and the destination to the processing engine 111 via the application.
  • the processing engine 111 may generate an order with respect to the service request having a first estimated price based on the start location and the destination.
  • the processing engine 111 may generate the order once the service request including the start location and the destination is confirmed.
  • the order may include different types of orders in response to different service requests.
  • the order may include a taxi order, a carpooling order, a chauffeur order, etc.
  • the order may include an individual order and an enterprise order based on the user identifier of the user terminal.
  • the order may include an activity order based on the start location and the service time. The activity order may be initiated by a plurality of users at a same and/or similar start location at a same and/or similar service time. For example, when a concert or a party ends, a larger number of users may send a plurality of service requests.
  • the processing engine 111 may generate a plurality of activity orders based on the plurality of service requests.
  • the processing engine 111 may determine the first estimated price based on the start location, the destination, the service time, the service type, or the like, or any combination thereof. For example, the processing engine 111 may determine the first estimated price based on the driving distance between the start location and the destination. As still another example, the processor may determine the first estimated price based on the driving distance between the start location and the destination and the service time. As still another example, the processor may determine the first estimated price based on the driving distance between the start location and the destination and the service type.
  • the processing engine 111 may add the order into a first queue to be allocated to a vehicle.
  • the processing engine 111 may determine a queuing mode of the first queue, and add the order into the first queue.
  • the queuing mode may include a strict mode with respect to a confirmation time of the order.
  • the first queue may include a stack of orders that are waiting in sequence to be processed. The earlier the order is confirmed, the earlier the order stands in the first queue, i.e., the sooner the order is processed. For example, an order confirmed at 9: 00 a.m. may stand in the first queue before an order confirmed at 9: 06 a.m., and after an order confirmed at 8: 57 a.m. according to the strict mode of the first queue.
  • the queuing mode may include a non-strict mode with respect to a weight of the order.
  • the weight of the order may be related with the start location, the destination of the order, a driving distance between the start location and the destination, an area where the order is generated, etc. For example, an order with a relatively long driving distance may have a greater weight than an order with a relatively short driving distance. Thus, the order with a relatively long driving distance may stand in the first queue before the order with a relatively short driving distance.
  • the processing engine 111 may dynamically determine the queuing mode of the first queue based on a real-time situation.
  • the processing engine 111 may add the order into the first queue to be allocated to a vehicle according to the strict mode.
  • the processing engine 111 may add the order into the first queue to be allocated to a vehicle according to the non-strict mode.
  • the first queue may include a plurality of first sub-queues based on different orders.
  • the plurality of first sub-queues may include a taxi queue, a carpooling queue, a chauffeur queue, an individual queue, an enterprise queue, an activity queue, or the like, or any combination thereof.
  • the processing engine 111 may add the taxi order into the taxi queue of the first queue to be allocated to a taxi.
  • the processing engine 111 may add the activity order into the activity queue of the first queue to be allocated to a vehicle.
  • different sub-queues may have different queuing modes that cause different processing priorities of the orders in the sub-queues. For example, the orders in an activity queue around a concert ending time may be processed faster than the orders in the taxi queue at or around the same time.
  • the processing engine 111 may send a first display instruction to the user terminal.
  • the first display instruction may instruct the user terminal to display information related to a status of the order.
  • the information related to the status of the order may include the first estimated price, a count of waiting orders in the first queue before the order, an estimated waiting time of the order in the first queue, a total count of waiting orders in the first queue, or a count of current available vehicles available to take the orders in the first queue or the like, or any combination thereof.
  • Detailed description of determining the estimated waiting time of the order in the first queue can be found elsewhere in this disclosure (e.g., in connection with FIG. 8) .
  • the processing engine 111 may send the first display instruction to the user terminal when the count of waiting orders in the first queue before the order is larger than an order threshold.
  • the order threshold may be a predetermined value configured in the system 100 to be applied to all the orders.
  • the order threshold may be dynamically determined based on information related to the order such as the area, the service time, etc.
  • the order threshold may vary in different areas and/or different service time.
  • the area may be determined based on the start location.
  • the processing engine 111 may divide the map into a plurality of grids.
  • the area may include a grid where the start location is located in the map, a grid where the start location is located with one or more adjacent grids thereof in the map, a circular area centered at the start location with a predetermined radius in the map, or an area divided based on longitude and latitude information, etc.
  • the processing engine 111 may send the first display instruction to the user terminal when a current waiting time is longer than a first time threshold.
  • the first time threshold may be a predetermined value configured in the system 100 to be applied to all the orders.
  • the first time threshold may be dynamically determined based on information related to the order such as the area, the service time, etc.
  • the first time threshold may vary in different areas and/or different service time.
  • the processing engine 111 may send the first display instruction to the user terminal when the order is generated under a predetermined situation. For example, the processing engine 111 may send the first display instruction when the available vehicles to take the order in the first queue are overly booked. As another example, the processing engine 111 may send the first display instruction during rush hours (e.g., 7: 30 a.m. to 9: 30 a.m., 5: 00 p.m. to 7: 00 p.m. ) in a day, a rainy day or a snowy day, etc. Rush hours may refer to time periods when the number of the available vehicles in the queue is less than the number of orders in the queue.
  • rush hours e.g., 7: 30 a.m. to 9: 30 a.m., 5: 00 p.m. to 7: 00 p.m.
  • Rush hours may refer to time periods when the number of the available vehicles in the queue is less than the number of orders in the queue.
  • the information related to the status of the order may further include a second estimated price, a count of waiting orders in a second queue before the order, an estimated waiting time of the order in the second queue, a total count of waiting orders in the second queue, or a count of current available vehicles available to take the orders in the second queue, or the like, or any combination thereof.
  • the second estimated price may be higher than the first estimated price.
  • the second queue may be associated with a second service type, or another way of allocating vehicles. Detailed description of determining the estimated waiting time of the order in the second queue can be found elsewhere in this disclosure (e.g., in connection with FIG. 8) .
  • the information related to the status of the order may be refreshed by the user.
  • the processing engine 111 (or the sending module 440, the first sending unit 441) may resend a new first display instruction to the user terminal.
  • the first display instruction may include current information related to the status of the order.
  • the vehicle allocating system 100 (or the processing engine 111) may automatically refresh the information related to the status of the order periodically. The frequency to refresh the information may be predetermined by the processing engine 111 or manually determined by the user.
  • FIG. 6 is a schematic diagram illustrating an exemplary process for allocating a vehicle for an order in a queue according to some embodiments of the present disclosure.
  • the processing engine 111 may generate an order and add the order into a first queue to be allocated to a vehicle based on the service request.
  • the orders from user terminals may be sent and put into a vehicle queue according to a time order. The earlier an order is sent, the earlier the order stands in the first queue, i.e., the sooner the order is allocated with a vehicle.
  • Other types of orders such as carpooling orders, refused orders, etc., may be assigned with higher priorities and be put in front of taxi orders in the vehicle queue.
  • the service provider may refuse to provide service to the service requester.
  • the processing engine 111 may assign a higher priority to the refused order and put the refused order back in the first queue for reallocation.
  • the processing engine 111 may put the refused order on top of the first queue to be allocated with the first available vehicle.
  • the processing engine 111 may determine an allocating rule to allocate vehicles for a refused order and a carpooling order in the vehicle queue. For example, if a carpooling order and a refused order are requested at or around a same time, the processing engine 111 may assign a higher priority to the carpooling order than the refused order if the carpooling order has engaged more than one passenger. As another example, the processing engine 111 may assign a higher priority to the refused order than the carpooling order if the carpooling order has not engaged any passenger other than the service requestor.
  • the orders in the vehicle queue may include various types, such as a taxi order, a carpooling order, a chauffeur order, a cancelled order, etc.
  • the vehicle queue may include a taxi queue, a carpooling queue, a chauffeur queue, an individual queue, an enterprise queue, an activity queue, etc.
  • FIG. 7 is an exemplary user interface of a user terminal according to some embodiments of the present disclosure.
  • the user interface may display information related to a status of an order during rush hours.
  • the information related to the status of the order may be instructed by the first display instruction in connection with FIG. 5.
  • the processing engine 111 may send a first display instruction to the user terminal.
  • the display instruction may instruct the user terminal to display information related to the order on the user interface.
  • FIG. 7 illustrates a plurality of pieces of information related to the order on the user interface. “Waiting for reply” may indicate that the user may have to wait to be allocated to a vehicle at the moment.
  • “Rush hours for allocating a vehicle; Your number: 100, 120 in total; Answering within 5 minutes” may indicate that the count of waiting orders in the first queue before the order may be 99, the total count of waiting orders in the first queue may be 120, and the estimated waiting time of the order in the first queue may be 5 minutes at or around which, the status of the order is displayed.
  • “S Alley” may indicate the start location of the order is Xinghua Alley.
  • “Waited 00: 20; Searching a vehicle for you” may indicate that the user may have waited for 20 seconds. Since the estimated waiting time of the order in the first queue is 5 minutes, the user will have to wait about 4 minutes and 40 seconds before the processing engine 111 allocates the vehicle to the user. The user may cancel the order by pressing “Cancelling the order” on the touch screen of the user interface.
  • the information related to the status of an order displayed in FIG. 7 is merely provided for illustration purpose, and not intended to limit the scope of the present disclosure.
  • the information related to the status of the order may be displayed in various way, such as pictures, words, icons, colors, or the like, or any combination thereof.
  • the user may refresh the displayed information related to the status of the order manually.
  • the vehicle allocating system 100 may automatically refresh the displayed information related to the status of the order.
  • the frequency to automatically refresh the information related to the status of the order may be predetermined by the processing engine 111 or manually determined by the user. For example, the displayed information related to the status of the order may be refreshed every 5 seconds, every 10 seconds, every 15 seconds, etc. In some embodiments, the displayed information may be refreshed once the order is processed and assigned with a vehicle.
  • FIG. 8 is a flowchart illustrating an exemplary process 800 for determining an estimated waiting time of an order according to some embodiments of the present disclosure.
  • one or more steps in the process 800 may be implemented in the vehicle allocating system 100 illustrated in FIG. 1.
  • one or more steps in the process 800 may be stored in the storage 150 and/or storage (e.g., the ROM 230, the RAM 240, etc. ) as a form of instructions, and invoked and/or executed by the server 110 (e.g., the processing engine 111 in the server 110, or the CPU 220 of the processing engine 111 in the server 110) .
  • the server 110 e.g., the processing engine 111 in the server 110, or the CPU 220 of the processing engine 111 in the server 110.
  • the processing engine 111 may obtain historical waiting data.
  • the processing engine 111 may obtain the historical waiting data from vehicle-mounted devices, municipal transportation systems, a specific database, or the like, or any combination thereof.
  • the specific database may refer to a database configured to store and analyze a great amount of historical waiting data.
  • the historical waiting data may include historical information relating to a plurality of historical orders, for example, a start location of each historical order of the plurality of historical orders, a destination of each historical order, an order type of each historical order, historical information related to a status of each historical order, or the like, or any combination thereof.
  • the historical information related to a status of each historical order may include a historical waiting time of each order in a first queue, a total count of historical waiting orders in the first queue, a count of historical available vehicles in the first queue, or the like, or any combination thereof.
  • the historical information related to a status of each historical order may further include a historical estimated waiting time of each order in a second queue, a total count of historical waiting orders in the second queue, a count of historical available vehicles in the second queue, or the like, or any combination thereof.
  • the processing engine 111 may determine an estimated waiting time of an order based on the historical waiting data.
  • the processing engine 111 may process the historical waiting data according to an algorithm.
  • the algorithm may include a cluster analysis, a factor analysis, a correlation analysis, a correspondence analysis, a regression analysis, an analysis of variance, or the like, or any combination thereof.
  • the cluster analysis may include a partitioning method, a hierarchical method, a density-based method, a grid-based method, a model-based method, etc.
  • the factor analysis may include a k-means algorithm, an expectation maximization, etc.
  • the processing engine 111 may obtain a plurality of historical orders whose features are the same as or similar to the order to be estimated. For example, the processing engine 111 may obtain the same order type of historical orders requested at the same or similar time and within the same or similar starting area. The processing engine 111 may determine a mean value of historical waiting time of these orders to set it as the estimated waiting time for the order.
  • the estimated waiting time of the order may indicate an actual time period during which the order in a queue (e.g., the first queue, the second queue) will be processed. For example, when the estimated waiting time of the order is 3 minutes and 15 seconds, the user may have to wait for 3 minutes and 15 seconds before the vehicle allocating system 100 allocates a vehicle to the order.
  • the estimated waiting time may indicate a time period rounded to a nearest threshold during which the order in the queue (e.g., the first queue, the second queue) will be processed.
  • the estimated waiting time of the order based on the historical waiting data ranges from 0 to 59 seconds
  • the estimated time displayed on the user terminal may be 1 minute.
  • the estimated waiting time of the order based on the historical waiting data ranges from 1 minute to 1 minute and 59 seconds
  • the estimated time displayed on the user terminal may be 3 minutes.
  • the estimated time displayed on the user terminal may be 3 minutes.
  • the estimated time displayed on the user terminal may be 5 minutes.
  • the estimated time displayed on the user terminal may be 5 minutes.
  • the estimated waiting time of the order based on the historical waiting data ranges from 5 minutes to 8 minutes and 59 seconds
  • the estimated time displayed on the user terminal may be 10 minutes.
  • the estimated waiting time of the order based on the historical waiting data ranges from 9 minutes to 10 minutes
  • the estimated time displayed on the user terminal may be 11 minutes.
  • the processing engine 111 may update the historical waiting data in every predetermined time interval.
  • the predetermined time interval may be a predetermined value configured in the system 100 to be applied to all the orders.
  • the predetermined time interval may be dynamically determined based on information related to the order such as the area, the service time, the order type, etc.
  • the predetermined time interval may vary in different areas, different service time, different order types, or the like, or any combination thereof.
  • the processing engine 111 may update the historical waiting data after a road reconstruction is completed. For example, when a new railway opens, road conditions of different roads associated with the new railway may be changed. As another example, a primary crowded road may turn into a less crowded road, and thus, the estimated waiting time of orders associated with the less crowded road may be changed.
  • the processing engine 111 may determine the estimated waiting time of the order based on the updated historical waiting data.
  • the estimated waiting time may vary with the time that the user has waited for. For example, the longer the time that the user has waited for, the shorter the estimated waiting time may be. For example, when the user has waited for 1 minute, an estimated waiting time is 2 minutes. When the user has waited for 1.5 minutes, the estimated waiting time is 1.5 minutes. As another example, the longer the time that the user has waited for, the smaller the count of waiting orders in the first queue before the order may be. For example, when the user has waited for 1 minute, the count of waiting orders in the first queue before the order is 50. When the user has waited for 2 minutes, the count of waiting orders in the first queue before the order is 20.
  • FIG. 9 is a flowchart illustrating an exemplary process 900 for sending a display instruction to a user terminal 130 according to some embodiments of the present disclosure.
  • one or more steps in the process 900 may be implemented in the vehicle allocating system 100 illustrated in FIG. 1.
  • one or more steps in the process 900 may be stored in the storage 150 and/or storage (e.g., the ROM 230, the RAM 240, etc. ) as a form of instructions, and invoked and/or executed by the server 110 (e.g., the processing engine 111 in the server 110, or the CPU 220 of the processing engine 111 in the server 110) .
  • the server 110 e.g., the processing engine 111 in the server 110, or the CPU 220 of the processing engine 111 in the server 110.
  • the processing engine 111 may determine that a count of waiting orders in a first queue before an order is less than an order threshold, or an estimated waiting time in the first queue is less than a first time threshold.
  • a count of waiting orders in a first queue before an order is less than an order threshold, or an estimated waiting time in the first queue is less than a first time threshold.
  • Detailed description of the order threshold and/or the first time threshold can be found elsewhere in this disclosure (e.g., in connection with FIG. 5) .
  • the processing engine 111 may determine that the count of waiting orders in the first queue before the order is less than the order threshold or the estimated waiting time in the first queue is less than the first time threshold under certain circumstances, for example, during rush hours (e.g., 7: 30 a.m. to 9: 30 a.m., 5: 00 p.m. to 8: 00 p.m. ) in a day, a rainy day or a snowy day, etc.
  • rush hours e.g., 7: 30 a.m. to 9: 30 a.m., 5: 00 p.m. to 8: 00 p.m.
  • the processing engine 111 may send a second display instruction to the user terminal.
  • the second display instruction may instruct the user terminal to display a vehicle allocation status.
  • the vehicle allocation status may indicate that the vehicle allocating system 100 is allocating a vehicle for the user.
  • Other information relating to the vehicle allocation status such as the count of waiting orders in the first queue before the order, the estimated waiting time of the order in the first queue, a total count of waiting orders in the first queue, a count of current available vehicles available to take the orders in the first queue, a time that a user has waited or the like, or any combination thereof, may be displayed together with the vehicle allocation status.
  • the order threshold is configured as 4.
  • the processing engine 111 may send the second display instruction to the user terminal.
  • the first time threshold is 59 seconds.
  • the processing engine 111 may send the second display instruction to the user terminal.
  • FIG. 10 is an exemplary user interface of a user terminal according to some embodiments of the present disclosure.
  • the user interface may display information related to vehicle allocation status during rush hours.
  • the information related to the vehicle allocation status may be instructed by the second display instruction in connection with FIG. 9.
  • “Waiting for reply” may indicate that the user may have to wait to be allocated to a vehicle at the moment.
  • “Rush hours for allocating a vehicle; Your number: 3; Allocating a vehicle, please wait” may indicate that the count of waiting orders in the first queue before the order may be 2, and the vehicle allocating system 100 is allocating a vehicle to the user.
  • “Xinghua Alley” may indicate the start location of the order is Xinghua Alley.
  • “Waited 03: 20; Searching a vehicle for you” may indicate that the user may have waited for 3 minutes and 20 seconds. The user may cancel the order by pressing “Cancelling the order” on the touch screen of the user interface.
  • Normal hours may refer to time periods when the number of the available vehicles is greater than or approximately equal to the number of orders in the queue (e.g., the first queue, the second queue, etc. ) .
  • normal hours may refer to time periods other than the rush hours in a day.
  • the normal hours may include 10: 00 a.m. to 11: 00 a.m., 1: 00 p.m. to 3: 00 p.m. in a day, etc.
  • FIG. 11 is a flowchart illustrating an exemplary process 1100 for sending a display instruction to a user terminal 130 according to some embodiments of the present disclosure.
  • one or more steps in the process 1100 may be implemented in the vehicle allocating system 100 illustrated in FIG. 1.
  • one or more steps in the process 1100 may be stored in the storage 150 and/or storage (e.g., the ROM 230, the RAM 240, etc. ) as a form of instructions, and invoked and/or executed by the server 110 (e.g., the processing engine 111 in the server 110, or the CPU 220 of the processing engine 111 in the server 110) .
  • the server 110 e.g., the processing engine 111 in the server 110, or the CPU 220 of the processing engine 111 in the server 110.
  • the processing engine 111 may determine that an estimated waiting time in the first queue is greater than a second time threshold.
  • the second time threshold may be greater than the first time threshold.
  • the second time threshold may be a predetermined value configured in the system 100 to be applied to all the orders., e.g., 10 minutes, 20 minutes, 30 minutes, etc.
  • the second time threshold may be dynamically determined based on information related to the order such as the area, the service time, etc. For example, the second time threshold may vary in different areas and/or different service time.
  • the processing engine 111 may send a third display instruction to the user terminal.
  • the third display instruction may instruct the user terminal to display one or more suggestions to the user for selection to complete the service request.
  • the one or more suggestions may include one or more alternative travel modes such as carpooling, shared shuttle service, or any other types of services, and the information related thereto.
  • Information related to the carpooling may include a first carpooling estimated price, an estimated waiting time of the carpooling in the first queue, or the like, or any combination thereof.
  • the user terminal may display the information related to a status of the order and the information related to the carpooling.
  • the vehicle allocating system 100 may allocate a vehicle according to a carpooling allocation rule.
  • the carpooling allocation rule may indicate that there must be at least two users to share a same vehicle.
  • the vehicle allocating system 100 may allocate a vehicle for the at least two users according to service request times among a plurality of carpooling requestors.
  • FIG. 12 is an exemplary user interface of a user terminal according to some embodiments of the present disclosure.
  • the user interface may display information related to suggestions to complete the service request.
  • the information related to the suggestions may be instructed by the third display instruction in connection with FIG. 11.
  • “Waiting for reply” may indicate that the user may have to wait to be allocated to a vehicle at the moment.
  • “Rush hours for allocating a vehicle; Your number: 100, 120 in total; Answering more than 10 minutes; Suggesting carpooling” may indicate that the count of waiting orders in the first queue before the order may be 99, and the total count of waiting orders in the first queue may be 120, and the estimated waiting time of the order in the first queue may be more than 10 minutes.
  • the user may choose to carpool by pressing “carpooling” on the touch screen of the user interface.
  • “Xinghua Alley” may indicate the start location of the order may be Xinghua Alley.
  • the user terminal may display “Waited 00: 20; Searching a vehicle for you” , and it may indicate that the user may have waited for 20 seconds.
  • the user may cancel the order by pressing “Cancelling the order” on the touch screen of the user interface.
  • the processing engine 111 may send the third display instruction to the user terminal when the count of waiting orders in the first queue before the order is greater than the order threshold or the estimated waiting time in the first queue is greater than the first time threshold.
  • the third instruction may instruct the user terminal to display the information related to a status of the order and the information related to the carpooling.
  • FIG. 13 is a flowchart illustrating an exemplary process 1300 for sending a display instruction to a user terminal 130 according to some embodiments of the present disclosure.
  • one or more steps in the process 1300 may be implemented in the vehicle allocating system 100 illustrated in FIG. 1.
  • one or more steps in the process 1300 may be stored in the storage 150 and/or storage (e.g., the ROM 230, the RAM 240, etc. ) as a form of instructions, and invoked and/or executed by the server 110 (e.g., the processing engine 111 in the server 110, or the CPU 220 of the processing engine 111 in the server 110) .
  • the server 110 e.g., the processing engine 111 in the server 110, or the CPU 220 of the processing engine 111 in the server 110.
  • the processing engine 111 may determine that a current waiting time in the first queue is greater than a third time threshold.
  • the third time threshold may be greater than the second time threshold.
  • the third time threshold may be a predetermined value configured in the system 100 to be applied to all the orders, e.g., 30 minutes. 40 minutes, 50 minutes, etc.
  • the third time threshold may be dynamically determined based on information related to the order such as the area, the service time, etc. For example, the third time threshold may vary in different areas and/or different service time.
  • the processing engine 111 may send a fourth display instruction to the user terminal.
  • the fourth display instruction may instruct the user terminal to display a query as to whether to continue waiting.
  • the vehicle allocating system 100 may continue displaying the information related to the status of the order, the information related to the carpooling, or the like, or any combination thereof.
  • the vehicle allocating system 100 may cancel the order.
  • FIG. 14 is a flowchart illustrating an exemplary process 1400 for canceling an order according to some embodiments of the present disclosure.
  • one or more steps in the process 1400 may be implemented in the vehicle allocating system 100 illustrated in FIG. 1.
  • one or more steps in the process 1400 may be stored in the storage 150 and/or storage (e.g., the ROM 230, the RAM 240, etc. ) as a form of instructions, and invoked and/or executed by the server 110 (e.g., the processing engine 111 in the server 110, or the CPU 220 of the processing engine 111 in the server 110) .
  • the server 110 e.g., the processing engine 111 in the server 110, or the CPU 220 of the processing engine 111 in the server 110.
  • the processing engine 111 may determine that a current waiting time in the first queue is greater than a fourth time threshold.
  • the fourth time threshold may be greater than the third time threshold.
  • the fourth time threshold may be a predetermined value configured in the system 100 to be applied to all the orders, e.g., 40 minutes, 50 minutes, 60 minutes, etc.
  • the fourth time threshold may be dynamically determined based on information related to the order such as the area, the service time, etc. For example, the fourth time threshold may vary in different areas and/or different service time.
  • the processing engine 111 may cancel the order.
  • FIG. 15 is a flowchart illustrating an exemplary process 1500 for allocating a vehicle for a service request according to some embodiments of the present disclosure.
  • one or more steps in the process 1500 may be implemented in the vehicle allocating system 100 illustrated in FIG. 1.
  • one or more steps in the process 1500 may be stored in the storage 150 and/or storage (e.g., the ROM 230, the RAM 240, etc. ) as a form of instructions, and invoked and/or executed by the server 110 (e.g., the processing engine 111 in the server 110, or the CPU 220 of the processing engine 111 in the server 110) .
  • the server 110 e.g., the processing engine 111 in the server 110, or the CPU 220 of the processing engine 111 in the server 110.
  • the processing engine 111 may determine that an order satisfies a first condition.
  • the first condition may include a condition that a total count of waiting orders in an area is greater than a count of vehicles in the area that are available to take the orders from the first queue.
  • the area may be determined based on a start location of the order.
  • the processing engine 111 may divide the map into a plurality of grids (e.g., hexagon grids) .
  • the area may include a grid where the start location is located in the map, a grid where the start location is located with one or more adjacent grids thereof in the map, a circular area centered at the start location with a predetermined radius in the map, or an area divided based on longitude and latitude information, etc.
  • the first condition may include a condition that a difference between the total count of waiting orders in the area and the count of vehicles in the area that are available to take the orders from the first queue is greater than a predetermined threshold.
  • the predetermined threshold may be a predetermined value configured in the vehicle allocating system to be applied to all orders.
  • the predetermined threshold may be determined based on the area. For example, the larger the area is, the greater the predetermined threshold is.
  • the first condition may include a condition that a current time is within a predetermined time period.
  • the predetermined time period may be a predetermined value configured in the vehicle allocating system 100 to be applied to all orders.
  • the predetermined threshold may be determined based on the area.
  • the predetermined time period may include rush hours, e.g., 7: 30 a.m. to 9: 30 a.m., 5:00 p.m. to 8: 00 p.m. in a day.
  • the first condition may include other over-demand conditions.
  • the first condition may include a rainy day, a snowy day when a large population of users request the service, etc.
  • Detailed description of determining that the order satisfies the first condition can be found elsewhere in this disclosure (e.g., in connection with FIG. 18) .
  • the processing engine 111 may send a fifth display instruction to the user terminal.
  • the fifth display instruction may instruct the user terminal to display an alternative travel suggestion with respect to a service having a second estimated price.
  • the alternative travel suggestion may further include carpooling, other types of service, or the like, or any combination thereof.
  • the user terminal may display information related to the status of the order having the second estimated price, information related to the status of the order having a first estimated price, information related to the carpooling, or the like, or any combination thereof.
  • the second estimated price may be greater than the first estimated price.
  • the difference between the second estimated price and the first estimated price may be a predetermined value.
  • the difference between the second estimated price and the first estimated price may be determined based on route information of the order.
  • the route information may include a start location of the order, a destination of the order, a driving distance of the order, or the like, or any combination thereof. For example, the longer the driving distance of the order is, the greater the difference between the second estimated price and the first estimated price is.
  • the difference between the second estimated price and the first estimated price may be a value determined by the user. For example, the user may add a tip to the first estimated price on his/her own will.
  • the processing engine 111 may receive a selection of the alternative travel suggestion having the second estimated price.
  • the vehicle allocating system 100 may accelerate to allocate a vehicle to the user if the user accepts the raised service fee (e.g., the second estimated price) .
  • the processing engine 111 may further receive a selection of the carpooling, shared shuttle service, other types of service, etc. For example, a user may simultaneously accept the raised service fee and select the carpooling suggestion to accelerate the order to be allocated to a vehicle.
  • the processing engine 111 may add the order into a second queue.
  • a second ratio of a second count of vehicles available to take the orders from the second queue to a second count of waiting orders in the second queue may be greater than a first ratio of a first count of vehicles available to take the orders from the first queue to a first count of waiting orders in the first queue, which may indicate that an order in the second queue may be earlier to be allocated to a vehicle than the order in the first queue.
  • a queuing mode of the second queue may include a strict mode with respect to a confirmation time of the order and a non-strict mode with respect to a weight of the order.
  • a strict mode with respect to a confirmation time of the order and a non-strict mode with respect to a weight of the order.
  • Detailed description of the strict mode and/or the non-strict mode can be found elsewhere in this disclosure (e.g., in connection with FIG. 5) .
  • the second queue may include a plurality of second sub-queues based on different orders.
  • the plurality of second queues may include a taxi queue, a carpooling queue, a chauffeur queue, an individual queue, an enterprise queue, an activity queue, or the like, or any combination thereof.
  • different sub-queues may have different queuing modes that cause different processing priorities of the orders in the sub-queues. For example, the orders in an activity queue around a concert ending time may be processed faster than the orders in the taxi queue at or around the same time.
  • the processing engine 111 may not receive the selection of the alternative travel suggestion having the second estimated price, which may indicate that the user chooses not to accelerate the order by accepting the raised service fee.
  • the order may remain in the first queue to be allocated to the vehicle.
  • FIG. 16a-FIG. 16d are exemplary user interfaces of a user terminal according to some embodiments of the present disclosure.
  • the user interface may display information related to alternative travel suggestions to complete the service request.
  • the information related to the alternative travel suggestions may be instructed by the fifth display instruction in connection with FIG. 15.
  • “Confirming the call” may indicate that the user may confirm whether information related to the order displayed on the user interface is correct.
  • “Express Private Taxi Carpooling 107ur” may indicate different order types, and the user may choose an order type from the different order types.
  • “Xinghua Alley” may indicate the start location of the order may be Xinghua Alley.
  • “Beihai North Gate” may indicate that the destination of the order may be Beihai North Gate.
  • “4 minutes, Pick-up location” may indicate that a vehicle allocated by the processing engine 111 will arrive at the pick-up location (e.g., the start location) within 4 minutes.
  • Carpooling 18.0 RMB may indicate a first estimated price of the order based on the start location and the destination may be 18.0 RMB if the user chooses to carpool.
  • “No carpooling 32.8 RMB” may indicate a first estimated price of the order based on the start location and the destination may be 32.8 RMB if the user chooses not to carpool.
  • the user may choose to carpool by pressing “Carpooling” followed by pressing “calling for a vehicle” to confirm the order on the touch screen of the user interface.
  • the user may choose not to carpool by pressing “No carpooling” followed by pressing “calling for a vehicle” on the touch screen of the user interface.
  • the processing engine 111 may add the order into a first queue to be allocated to a vehicle.
  • the user interface may display information shown in FIG. 16b. “Waiting for reply” may indicate that the user may have to wait to be allocated to a vehicle at the moment. “100 people waiting in front of you; Answering within 10 minutes” may indicate that the count of waiting orders in the first queue before the order may be 99, and the estimated waiting time of the order in the first queue may be 10 minutes at or around which the status of the order may be displayed.
  • “Adding 12 RMB; Accelerating allocating” may indicate that the processing engine 111 may accelerate to allocate the vehicle to the user if the user agrees to raise the service fee by 12 RMB, and the difference between the second estimated price and the first estimated price may be 12 RMB.
  • the user may cancel the order by pressing “Cancelling the order” on the touch screen of the user interface.
  • the user interface may display information shown in FIG. 16c. “Accelerating allocating; Please wait” may indicate that the order has been accelerated, and the user may have to wait to be allocated to a vehicle at the moment. “Waited 00: 20; Searching a vehicle for you” may indicate that the user may have waited for 20 seconds.
  • the user interface may display information shown in FIG. 16d. “There are a lot of people choosing to accelerate orders, and the available vehicles are not enough, please wait” may indicate that the user may have to wait a relatively longer time to be allocated to the vehicle.
  • FIG. 17 is a flowchart illustrating an exemplary process 1700 for determining that an order satisfies a first condition according to some embodiments of the present disclosure.
  • one or more steps in the process 1700 may be implemented in the vehicle allocating system 100 illustrated in FIG. 1.
  • one or more steps in the process 1700 may be stored in the storage 150 and/or storage (e.g., the ROM 230, the RAM 240, etc. ) as a form of instructions, and invoked and/or executed by the server 110 (e.g., the processing engine 111 in the server 110, or the CPU 220 of the processing engine 111 in the server 110) .
  • the server 110 e.g., the processing engine 111 in the server 110, or the CPU 220 of the processing engine 111 in the server 110.
  • the processing engine 111 may determine an area based on a start location and a destination of an order.
  • the area may be determined based on a start location of the order.
  • the processing engine 111 may divide the map into a plurality of grids (e.g., hexagon grids) .
  • the area may include a grid where the start location is located in the map, a grid where the start location is located with one or more adjacent grids thereof in the map, a circular area centered at the start location with a predetermined radius in the map, or an area divided based on longitude and latitude information, etc.
  • the processing engine 111 may determine a count of vehicles in the area that are available to take the orders from the first queue.
  • the processing engine 111 (or the allocating module 430, the first queuing unit 431) may determine a total count of waiting orders in the area from the first queue.
  • the processing engine 111 may determine that the total count of waiting orders in the area is greater than the count of vehicles in the area that are available to take the orders from the first queue. If the total count of waiting orders in the area is greater than the count of vehicles in the area that are available to take the orders from the first queue, the processing engine 111 may determine that the order satisfies the first condition.
  • the processing engine 111 may determine other criteria to determine whether the order satisfies the first condition. For example, the processing engine 111 may further determine that the difference between the total count of waiting orders in the area and the count of vehicles in the area that are available to take the orders from the first queue is greater than a predetermined threshold. As another example, the processing engine 111 may further determine that a current time is within a predetermined time period or in a rainy day, a snowy day when a large population of users request the service, etc.
  • FIG. 18a-FIG. 18h are exemplary user interfaces of a user terminal according to some embodiments of the present disclosure.
  • the user interface may display information related to alternative travel suggestions to complete the service request when an order satisfies the first condition.
  • the information related to the alternative travel suggestions may be instructed by the fifth display instruction in connection with FIG. 15.
  • the user interface may display information shown in FIG. 18a. “Bid higher than offered” may indicate that a number of the available vehicles in a first queue may be less than a number of orders in the first queue. “Adding 12 RMB, answering within 5 minutes” may indicate that the processing engine 111 may accelerate to allocate a vehicle to a user within 5 minutes if the user agrees to raise the service fee by adding 12 RMB. “Adding 0 RMB, answering within 20 minutes” may indicate that the user may have to wait about 20 minutes before the vehicle allocating system 100 allocates the vehicle to the user.
  • the user interface may display information shown in FIG. 18b.
  • “4 minutes, Pick-up location” may indicate that a vehicle allocated by the processing engine 111 will arrive at the pick-up location (e.g., the start location) in 4 minutes.
  • “Carpooling 18.0 RMB; Adding 12 RMB” may indicate a difference between a first estimated price and the second estimated price may be 12 RMB, and a second estimated price of the order may be 18.0 RMB if the user chooses to carpool.
  • “No carpooling 32.8 RMB; Adding 12 RMB” may indicate a second estimated price of the order may be 32.8 RMB if the user chooses not to carpool.
  • the user may choose to carpool by pressing “Carpooling” followed by pressing “calling for a vehicle” to confirm the order on the touch screen of the user interface.
  • the user may choose not to carpool by pressing “No carpooling” followed by pressing “calling for a vehicle” on the touch screen of the user interface.
  • the user interface may display information shown in FIG. 18c.
  • the user may reconfirm to add the service fee by pressing “Confirming within 2 minutes” within two minutes on the touch screen of the user interface.
  • the user interface may display information shown in FIG. 18d. “Accelerating allocating; Please wait” may indicate that the order has been accelerated, and the user may have to wait to be allocated to a vehicle at the moment. “Waited 00: 20; Searching a vehicle for you” may indicate that the user may have waited for 20 seconds.
  • the user interface may display information shown in FIG. 18e. “4 minutes, Pick-up location” may indicate that a vehicle allocated by the processing engine 111 will arrive at the pick-up location (e.g., the start location) in 4 minutes. “Carpooling 18.0 RMB” may indicate that a first estimated price of the order may be 18.0 RMB if the user chooses to carpool. “No carpooling” may indicate a first estimated price of the order may be 32.8 RMB if the user chooses not to carpool. For example, the user may choose to carpool by pressing “Carpooling” followed by pressing “calling for a vehicle” to confirm the order on the touch screen of the user interface. As another example, the user may choose not to carpool by pressing “No carpooling” followed by pressing “calling for a vehicle” on the touch screen of the user interface.
  • the processing engine 111 may require the user to reconfirm whether to accelerate the order by raising the service fee.
  • the user interface may display information shown in FIG. 18f. “100 people waiting in front of you; Answering within 10 minutes” may indicate that the count of waiting orders in the first queue before the order may be 99, and the estimated waiting time of the order in the first queue may be 10 minutes at or around which the status of the order may be displayed. “Adding 12 RMB; Answering within 3 minutes” may indicate that the processing engine 111 may accelerate to allocate a vehicle to a user within 3 minutes if the user agrees to raise the service fee by adding 12 RMB.
  • the user interface may display information in connection with FIG. 18d.
  • the user interface may display information shown in FIG. 18f.
  • the user may choose to cancel the order by pressing “Cancelling the order” on the touch screen of the user interface.
  • FIG. 19a-FIG. 19b are exemplary user interfaces of a user terminal according to some embodiments of the present disclosure.
  • the user interface may display information related to the status of the order having a first estimated price, information related to the carpooling, or the like, or any combination thereof.
  • “Rush hours for allocating a vehicle; Your number: 118; 120 in total; Answering within 2 minutes” may indicate that the count of waiting orders in the first queue before the order may be 2.
  • “Carpooling 6 RMB” may indicate a first estimated price of the order based on the start location and the destination may be 6 RMB if the user chooses to carpool.
  • “No carpooling” may indicate a first estimated price of the order may be 20.8 RMB if the user chooses not to carpool.
  • the user may choose to carpool by pressing “Carpooling” on the touch screen of the user interface.
  • the user may choose not to carpool by pressing “No carpooling” on the touch screen of the user interface.
  • the user may cancel the order by pressing “Cancelling the order” on the touch screen of the user interface.
  • a vehicle is allocated; You have already waited: 00: 20” may indicate that the processing engine 111 may be allocating a vehicle to the user, and the user may have already waited for 20 seconds.
  • aspects of the present disclosure may be illustrated and described herein in any of a number of patentable classes or context including any new and useful process, machine, manufacture, or composition of matter, or any new and useful improvement thereof. Accordingly, aspects of the present disclosure may be implemented entirely hardware, entirely software (including firmware, resident software, micro-code, etc. ) or combining software and hardware implementation that may all generally be referred to herein as a "block, " “module, ” “engine, ” “unit, ” “component, ” or “system. ” Furthermore, aspects of the present disclosure may take the form of a computer program product embodied in one or more computer readable media having computer readable program code embodied thereon.
  • a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including electro-magnetic, optical, or the like, or any suitable combination thereof.
  • a computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that may communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
  • Program code embodied on a computer readable signal medium may be transmitted using any appropriate medium, including wireless, wireline, optical fiber cable, RF, or the like, or any suitable combination of the foregoing.
  • Computer program code for carrying out operations for aspects of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Scala, Smalltalk, Eiffel, JADE, Emerald, C++, C#, VB. NET, Python or the like, conventional procedural programming languages, such as the “C” programming language, Visual Basic, Fortran 1703, Perl, COBOL 1702, PHP, ABAP, dynamic programming languages such as Python, Ruby and Groovy, or other programming languages.
  • the program code 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.
  • 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) or in a cloud computing environment or offered as a service such as a software as a service (SaaS) .
  • LAN local area network
  • WAN wide area network
  • an Internet Service Provider for example, AT&T, MCI, Sprint, EarthLink, MSN, etc.
  • SaaS software as a service

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • General Business, Economics & Management (AREA)
  • Finance (AREA)
  • Physics & Mathematics (AREA)
  • Development Economics (AREA)
  • General Physics & Mathematics (AREA)
  • Marketing (AREA)
  • Theoretical Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Game Theory and Decision Science (AREA)
  • Tourism & Hospitality (AREA)
  • Educational Administration (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Traffic Control Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
PCT/CN2017/110885 2017-03-29 2017-11-14 Systems and methods for allocating vehicles for on-demand services WO2018176849A1 (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
CN201780035203.6A CN109313776A (zh) 2017-03-29 2017-11-14 用于按需服务分配车辆的系统和方法
AU2017406770A AU2017406770A1 (en) 2017-03-29 2017-11-14 Systems and methods for allocating vehicles for on-demand services
EP17904135.5A EP3577620A4 (en) 2017-03-29 2017-11-14 SYSTEMS AND METHODS FOR ALLOCATING VEHICLES TO ON-DEMAND SERVICES
JP2019548912A JP6867504B2 (ja) 2017-03-29 2017-11-14 オンデマンドサービスのための乗り物を割り当てるシステム及び方法

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
CN201710195830.8 2017-03-29
CN201710196641.2A CN108009650A (zh) 2017-03-29 2017-03-29 网约车服务请求处理方法、装置和服务器
CN201710195830.8A CN108009841A (zh) 2017-03-29 2017-03-29 网约车服务请求处理方法、装置和服务器
CN201710196641.2 2017-03-29

Publications (1)

Publication Number Publication Date
WO2018176849A1 true WO2018176849A1 (en) 2018-10-04

Family

ID=63675210

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/110885 WO2018176849A1 (en) 2017-03-29 2017-11-14 Systems and methods for allocating vehicles for on-demand services

Country Status (5)

Country Link
EP (1) EP3577620A4 (ja)
JP (1) JP6867504B2 (ja)
CN (1) CN109313776A (ja)
AU (1) AU2017406770A1 (ja)
WO (1) WO2018176849A1 (ja)

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109493168A (zh) * 2018-10-24 2019-03-19 北京三快在线科技有限公司 一种处理订单的方法、装置、设备及存储介质
CN111369025A (zh) * 2020-03-03 2020-07-03 北京嘀嘀无限科技发展有限公司 一种信息显示方法、装置、存储介质以及电子设备
CN111861614A (zh) * 2019-05-28 2020-10-30 北京嘀嘀无限科技发展有限公司 一种订单处理方法、装置、电子设备及存储介质
JP2021006957A (ja) * 2019-06-28 2021-01-21 株式会社Ｍｏｂｉｌｉｔｙ Ｔｅｃｈｎｏｌｏｇｉｅｓ 配車管理装置、配車管理方法、及び配車管理システム
JP2021026468A (ja) * 2019-08-02 2021-02-22 東日本旅客鉄道株式会社 仮想乗り場における価値交換方法およびコンピュータシステム
CN113255948A (zh) * 2021-05-26 2021-08-13 首约科技(北京)有限公司 一种提高拼车准确率的匹配策略方法
CN113408903A (zh) * 2021-06-21 2021-09-17 北京畅行信息技术有限公司 订单处理方法、装置、电子设备和可读存储介质
CN113505991A (zh) * 2021-07-09 2021-10-15 上海技信工业智能科技有限公司 一种混凝土运输载具自动排队方法、系统、装置及计算机可读存储介质
CN113990093A (zh) * 2021-11-22 2022-01-28 大连理工大学 一种无人驾驶电动出租车动态合乘调度系统及方法
CN114065981A (zh) * 2021-11-17 2022-02-18 阿里巴巴新加坡控股有限公司 订单数据处理方法、设备、平台、系统及计算机存储介质
JP2022073654A (ja) * 2020-11-02 2022-05-17 株式会社Mobility Technologies 配車管理装置、配車管理方法、及び配車管理システム
CN114973782A (zh) * 2022-05-12 2022-08-30 中国民用航空飞行学院 一种低碳运行的航空器地面滑行移交辅助控制方法
CN116843166A (zh) * 2023-08-31 2023-10-03 湘江实验室 一种打车方法、装置、设备及介质

Families Citing this family (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111626801B (zh) * 2019-02-27 2023-08-18 北京嘀嘀无限科技发展有限公司 一种订单派发方法、装置、电子设备和计算机存储介质
CN110136431B (zh) * 2019-05-24 2021-11-12 深圳市元征科技股份有限公司 一种车辆共享方法及装置
CN111126739B (zh) * 2019-06-28 2020-10-20 北京嘀嘀无限科技发展有限公司 共享汽车业务工单调度管理方法、服务器、系统及存储介质
CN110322159A (zh) * 2019-07-10 2019-10-11 金瓜子科技发展（北京）有限公司 一种数据处理方法和装置
CN113240897B (zh) * 2020-01-23 2023-04-18 奥迪股份公司 车辆调度方法、系统和计算机可读存储介质
CN112017001A (zh) * 2020-08-28 2020-12-01 北京嘀嘀无限科技发展有限公司 网约车车型推荐方法、装置、电子设备和存储介质
CN112085572A (zh) * 2020-09-10 2020-12-15 北京嘀嘀无限科技发展有限公司 一种拼车方法、装置、电子设备和存储介质
CN112434980A (zh) * 2020-12-17 2021-03-02 深圳航天智慧城市系统技术研究院有限公司 一种高效的公务车用车自动调度方法及系统

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103971507A (zh) * 2013-01-30 2014-08-06 国民技术股份有限公司 一种召车方法、召车平台及系统
CN105761482A (zh) * 2016-05-10 2016-07-13 北京交通大学 基于公平性的出租车实时预约方法及系统

Family Cites Families (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2003109198A (ja) * 2001-09-28 2003-04-11 Aitekku:Kk 駐車場管理システム
JP2003162566A (ja) * 2001-11-28 2003-06-06 Nippon Signal Co Ltd:The タクシー待ち利用者支援装置及びタクシー待ち利用者支援システム
JP2003296888A (ja) * 2002-03-29 2003-10-17 Matsushita Electric Ind Co Ltd 配車支援システムおよび配車支援方法
JP2007249790A (ja) * 2006-03-17 2007-09-27 Nec Commun Syst Ltd タクシー予約受付装置およびタクシー配車処理装置
JP2010097383A (ja) * 2008-10-16 2010-04-30 Tooru Ishiyama 運転代行取次システム
JP2010117965A (ja) * 2008-11-14 2010-05-27 Pioneer Electronic Corp 車両運行管理システム
US20120078673A1 (en) * 2010-09-28 2012-03-29 John Koke Dynamic queueing and management system
US8527575B2 (en) * 2010-12-17 2013-09-03 Verizon Patent And Licensing Inc. Queue processing system
CN102655335A (zh) * 2012-02-24 2012-09-05 东北大学秦皇岛分校 基于队列管理的小区电动汽车充电管理系统及方法
WO2013147056A1 (ja) * 2012-03-29 2013-10-03 日本電気株式会社 サービス内容提案システム、サービス内容提案装置、サービス内容提案方法および記録媒体
JP5986641B2 (ja) * 2012-10-17 2016-09-06 株式会社日立製作所 交通分析システム
US20150154810A1 (en) * 2013-12-04 2015-06-04 Kar Leong Tew Virtual transportation stands
WO2015089221A1 (en) * 2013-12-11 2015-06-18 Uber Technologies, Inc. Intelligent queuing for user selection in providing on-demand services
CN103985186B (zh) * 2014-05-28 2016-10-19 南京亿栋信息科技有限公司 一种用于排队机的等待时间预测方法
US10664707B2 (en) * 2014-10-06 2020-05-26 Marc R. Hannah Managed access system for traffic flow optimization
JP2017049137A (ja) * 2015-09-02 2017-03-09 クラリオン株式会社 ナビゲーション装置、サーバ、システム、施設の提案方法
CN106534238B (zh) * 2015-09-11 2020-09-29 百度在线网络技术（北京）有限公司 为用户提供离线应用服务的方法与装置
US10147325B1 (en) * 2017-02-02 2018-12-04 Wells Fargo Bank, N.A. Customization of sharing of rides
CN106971246A (zh) * 2017-04-12 2017-07-21 青岛海信网络科技股份有限公司 一种出租车上客区乘客候车时间预测方法和装置
CN107016849A (zh) * 2017-04-26 2017-08-04 北京聚利科技股份有限公司 网络预约车辆的方法、装置及系统

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103971507A (zh) * 2013-01-30 2014-08-06 国民技术股份有限公司 一种召车方法、召车平台及系统
CN105761482A (zh) * 2016-05-10 2016-07-13 北京交通大学 基于公平性的出租车实时预约方法及系统

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3577620A4 *

Cited By (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109493168A (zh) * 2018-10-24 2019-03-19 北京三快在线科技有限公司 一种处理订单的方法、装置、设备及存储介质
CN109493168B (zh) * 2018-10-24 2022-07-15 北京三快在线科技有限公司 一种处理订单的方法、装置、设备及存储介质
CN111861614A (zh) * 2019-05-28 2020-10-30 北京嘀嘀无限科技发展有限公司 一种订单处理方法、装置、电子设备及存储介质
JP2021006957A (ja) * 2019-06-28 2021-01-21 株式会社Ｍｏｂｉｌｉｔｙ Ｔｅｃｈｎｏｌｏｇｉｅｓ 配車管理装置、配車管理方法、及び配車管理システム
JP7336897B2 (ja) 2019-06-28 2023-09-01 Ｇｏ株式会社 配車管理装置、配車管理方法、及び配車管理システム
JP2021026468A (ja) * 2019-08-02 2021-02-22 東日本旅客鉄道株式会社 仮想乗り場における価値交換方法およびコンピュータシステム
JP7312052B2 (ja) 2019-08-02 2023-07-20 東日本旅客鉄道株式会社 仮想乗り場における価値交換方法およびコンピュータシステム
CN111369025A (zh) * 2020-03-03 2020-07-03 北京嘀嘀无限科技发展有限公司 一种信息显示方法、装置、存储介质以及电子设备
JP2022073654A (ja) * 2020-11-02 2022-05-17 株式会社Mobility Technologies 配車管理装置、配車管理方法、及び配車管理システム
JP7301807B2 (ja) 2020-11-02 2023-07-03 Ｇｏ株式会社 配車管理装置、配車管理方法、及び配車管理システム
CN113255948A (zh) * 2021-05-26 2021-08-13 首约科技(北京)有限公司 一种提高拼车准确率的匹配策略方法
CN113408903A (zh) * 2021-06-21 2021-09-17 北京畅行信息技术有限公司 订单处理方法、装置、电子设备和可读存储介质
CN113408903B (zh) * 2021-06-21 2023-11-21 北京畅行信息技术有限公司 订单处理方法、装置、电子设备和可读存储介质
CN113505991A (zh) * 2021-07-09 2021-10-15 上海技信工业智能科技有限公司 一种混凝土运输载具自动排队方法、系统、装置及计算机可读存储介质
CN113505991B (zh) * 2021-07-09 2024-03-12 上海技信工业智能科技有限公司 一种混凝土运输载具自动排队方法、系统、装置及介质
CN114065981A (zh) * 2021-11-17 2022-02-18 阿里巴巴新加坡控股有限公司 订单数据处理方法、设备、平台、系统及计算机存储介质
CN113990093A (zh) * 2021-11-22 2022-01-28 大连理工大学 一种无人驾驶电动出租车动态合乘调度系统及方法
CN114973782A (zh) * 2022-05-12 2022-08-30 中国民用航空飞行学院 一种低碳运行的航空器地面滑行移交辅助控制方法
CN114973782B (zh) * 2022-05-12 2023-05-23 中国民用航空飞行学院 一种低碳运行的航空器地面滑行移交辅助控制方法
CN116843166A (zh) * 2023-08-31 2023-10-03 湘江实验室 一种打车方法、装置、设备及介质
CN116843166B (zh) * 2023-08-31 2023-11-21 湘江实验室 一种打车方法、装置、设备及介质

Also Published As

Publication number Publication date
EP3577620A1 (en) 2019-12-11
CN109313776A (zh) 2019-02-05
AU2017406770A1 (en) 2019-10-17
JP2020515951A (ja) 2020-05-28
JP6867504B2 (ja) 2021-04-28
EP3577620A4 (en) 2019-12-11

Similar Documents

Publication Publication Date Title
WO2018176849A1 (en) Systems and methods for allocating vehicles for on-demand services
CN109478275B (zh) 分配服务请求的系统和方法
US20200058044A1 (en) Systems and methods for carpooling
AU2021218001B2 (en) Systems and methods for providing a navigation route
WO2017088828A1 (en) Systems and methods for allocating sharable orders
US20180040244A1 (en) Methods and systems for carpooling
US10785595B2 (en) Systems and methods for updating sequence of services
AU2016102436A4 (en) Methods and systems for carpooling
US20200300650A1 (en) Systems and methods for determining an estimated time of arrival for online to offline services
AU2017265135A1 (en) Systems and methods for determining a reference direction related to a vehicle
WO2019158066A1 (en) Systems and methods for information display
US11255684B2 (en) Systems and methods for allocating a service request
US20200143415A1 (en) Systems and methods for feed stream transmission
WO2019158004A1 (en) Systems and methods for service request processing
CN111386542B (zh) 用于分配按需服务请求的系统和方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 17904135

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2017904135

Country of ref document: EP

Effective date: 20190903

ENP Entry into the national phase

Ref document number: 2019548912

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

ENP Entry into the national phase

Ref document number: 2017406770

Country of ref document: AU

Date of ref document: 20171114

Kind code of ref document: A