Airport taxi pick-up point allocation method
A distribution method and taxi technology, applied in the direction of traffic control systems, instruments, traffic control systems of road vehicles, etc., to avoid inaccuracies, ensure safe travel, and improve efficiency
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0016] Embodiment 1: Linear arrangement separate start:
[0017] Taxi enters and exits each pick-up point individually, and leaves immediately after pick-up. Passengers can also give priority to taxis that are parked.
[0018] In this embodiment, there is no need to arrange a dispatcher, and the taxi enters and exits each boarding point independently, and the passenger leaves immediately after boarding. The taxi driver enters the boarding point, and the passenger chooses the taxi that is parked first. However, this scheme does not follow the first-in-first-out principle, and there is mutual interference between taxis in the process of entering and leaving the boarding point, so the efficiency of the boarding point is also reduced.
[0019] Suppose 02 = η 2 (m)s = m × η 2 (m).
[0020] Riding efficiency per lane Among them, 0<ρ<1 represents the coefficient to offset the fluctuation of docking time.
[0021] Total ride efficiency N sum =2×N.
[0022] Since the taxi can...
Embodiment 2
[0023] Embodiment 2: The trains are arranged sequentially in a linear arrangement:
[0024] Such as figure 1 As shown, m boarding points are linearly arranged sequentially in the two lanes respectively. Taxis are lined up at the boarding point, first in, first out. Passenger boarding rules are as follows: take the 1st to m cars in turn.
[0025] Arrange m boarding points linearly in the two lanes respectively. Taxis are lined up at the boarding point, first in, first out. Passenger boarding rules are as follows: take the 1st to m cars in turn. Use this scheme to get on the bus at the same time for passengers waiting at multiple boarding points. The time required for the passengers in the first car to place their luggage, get on the bus, and start the departure time directly affect the subsequent 2-m vehicles, and the 2nd taxi affects the subsequent 3-m vehicles.
[0026] For multiple boarding points arranged linearly, the taxi vehicles at adjacent boarding points may int...
Embodiment 3
[0030] Embodiment 3: Distinguish car storage pools according to travel distance
[0031] Such as figure 2 As shown, the storage pool is divided into "long-distance destination waiting area" and "short-distance destination waiting area" according to the distance. Kilometers away from the waiting area". There are multiple parking spaces in the "waiting area within 30 kilometers", first take the first car, and then take the second, third, and fourth cars in turn... Only one parking space is set in the "waiting area within 30 kilometers". Set up multiple waiting areas of this type within a set distance. Passengers choose to go to the storage pool to take a taxi according to the distance to their destination. At the same time, the taxi driver judges the distance to the destination of his next trip based on his operating conditions of the day, fuel volume, and some other factors. This scheme has brought into play the subjective initiative of the taxi driver, and the taxi driver...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


