CN110751824A - Method for allocating boarding points of taxis in airport - Google Patents

Method for allocating boarding points of taxis in airport Download PDF

Info

Publication number
CN110751824A
CN110751824A CN201911036245.9A CN201911036245A CN110751824A CN 110751824 A CN110751824 A CN 110751824A CN 201911036245 A CN201911036245 A CN 201911036245A CN 110751824 A CN110751824 A CN 110751824A
Authority
CN
China
Prior art keywords
departure
taxis
linear arrangement
taxi
points
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201911036245.9A
Other languages
Chinese (zh)
Inventor
鞠拓
周桂良
徐进
沈星宇
徐嘉
沈慧
江朋丽
刘炎璠
邢振宇
胡思涛
毛丽娜
周辰朗
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huaiyin Institute of Technology
Original Assignee
Huaiyin Institute of Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Huaiyin Institute of Technology filed Critical Huaiyin Institute of Technology
Priority to CN201911036245.9A priority Critical patent/CN110751824A/en
Publication of CN110751824A publication Critical patent/CN110751824A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G08SIGNALLING
    • G08GTRAFFIC CONTROL SYSTEMS
    • G08G1/00Traffic control systems for road vehicles
    • G08G1/20Monitoring the location of vehicles belonging to a group, e.g. fleet of vehicles, countable or determined number of vehicles
    • G08G1/202Dispatching vehicles on the basis of a location, e.g. taxi dispatching

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Traffic Control Systems (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a method for allocating boarding points of taxis in an airport, which adopts a linear arrangement departure mode, wherein the linear arrangement departure mode comprises linear arrangement independent departure and linear arrangement sequential departure. In the linear arrangement independent departure mode, taxis enter and exit each boarding point independently, and passengers get on the taxi and walk away; the passenger preferably selects a taxi to stop. In the linear arrangement sequential departure mode, m taxi-taking points are sequentially and linearly arranged on two lanes respectively, taxis are sequentially arranged on the taxi-taking points, first in first out is carried out, and passengers take 1 st to m taxis sequentially. The invention helps airport dispatch managers to manage and coordinate taxi capacity, avoids inaccuracy brought by airport managers through experience prediction, and achieves the purposes of improving the boarding and alighting efficiency of airports and ensuring safe travel of airport passengers.

Description

Method for allocating boarding points of taxis in airport
Technical Field
The invention relates to a method for allocating the transportation capacity of taxis in an airport, in particular to a method for allocating boarding points of taxis in the airport.
Background
At present, two parallel lanes are generally arranged in a passenger riding area of an airport, when the flying flight density of the airport is high, the number of taxis going to the airport is increased, and meanwhile, a driver arriving at the airport is confronted with two options, namely waiting for passengers or returning empty vehicles to a place to continue to pull passengers. Taxi drivers will make decisions based on their own experience, known flight information and presumably passenger factors on the passenger aircraft. If a taxi chooses to go to the 'storage pool', the situation that many taxis queue up for carrying passengers in the 'storage pool' will occur. Particularly, if the density of flights arriving at the airport in the time period is not enough, the number of passengers carrying the taxis in the 'storage pool' cannot be met, and a large number of taxis wait for the passengers to be carried. In contrast, when the density of arriving flights is high, too many passengers sit on taxis when getting off the airplane, but insufficient taxis go to the storage pool, which is difficult to meet the requirement of the number of passengers, the passengers can be queued. The situation is particularly prominent in special time periods such as insufficient flight density of takeoff at the airport, early subway, special line outage and the like. At present, the condition that taxis do not need to wait in a storage pool and simultaneously the riding requirements of passengers are completely met rarely occurs. Therefore, under the condition of ensuring safety, it is important to design a reasonable boarding point.
Disclosure of Invention
The purpose of the invention is as follows: the invention provides a method for allocating taxi getting-on points in an airport, which aims to overcome the defects in the prior art.
The technical scheme is as follows: the invention discloses a method for allocating boarding points of taxis in an airport.
In the linear arrangement independent departure mode, taxis enter and exit each boarding point independently, and passengers get on the taxi and walk away; the passenger preferably selects a taxi to stop.
In the linear arrangement sequential departure mode, m taxi-taking points are sequentially and linearly arranged on two lanes respectively, taxis are sequentially arranged on the taxi-taking points, first in first out is carried out, and passengers take 1 st to m taxis sequentially.
In the linear arrangement departure mode, a waiting area is provided with a long-distance destination waiting area and a plurality of short-distance destination waiting areas; a plurality of parking spaces are arranged in a long-distance destination waiting area, and passengers take the bus in sequence; and each 'close-distance destination waiting area' is provided with a parking space.
In the linear arrangement departure mode, taxis are arranged in parallel to independently depart, m departure points are arranged on a lane in parallel, and a taxi enters and exits each departure point and finishes driving away from the departure point.
Has the advantages that: the invention provides four different taxi dispatching modes respectively aiming at the characteristic of getting on or off the bus of the passengers in the airport and the distribution characteristic of taxis in the airport, and analyzes the aspects of safety, efficiency and the like. The invention effectively helps airport dispatching management personnel to manage and coordinate taxi capacity, avoids inaccuracy brought by airport management personnel through experience prediction, improves airport boarding and alighting efficiency, reduces waste of public resources and ensures safe trip of airport passengers.
Drawings
FIG. 1 is a schematic view of a departure point and a departure point in sequence in a linear arrangement according to an embodiment;
FIG. 2 is a schematic diagram of the third embodiment of the present invention showing the departure of the storage tanks according to the travel distance;
FIG. 3 is a diagram of four parallel-arranged independent departure vehicles according to the embodiment.
Detailed description of the invention
The invention adopts a linear arrangement departure mode, and the linear arrangement departure mode comprises linear arrangement independent departure and linear arrangement sequential departure. Wherein, L is assumed to represent lanes of the riding area, and parallel lanes are respectively represented as L1And L2(ii) a Suppose NsumTotal ride efficiency; assuming that the total number of boarding points is Nall(ii) a Suppose Pi,1≤i≤m,KiI is more than or equal to 1 and less than or equal to m is respectively a lane L1And L2A boarding point on the vehicle; suppose that the number of people waiting for taking a bus in the bus taking area is Nren(ii) a Let T bewaitThe average parking time of the taxi is expressed in seconds and mainly comprises the time T of getting on the taxigetAnd time T of entering and exiting boarding pointin-out
The invention mainly has the following four embodiments:
the first embodiment is as follows: linear array individual departure:
and the taxies enter and exit each boarding point independently, and the passengers can walk after boarding. The passenger may also prefer parked taxis.
In the embodiment, the taxi enters and exits each taxi-boarding point independently without arranging a dispatcher, and the taxi is walked by passengers. When a taxi driver enters a boarding point, the passenger selects a parked taxi preferentially. However, the scheme does not follow the first-in first-out principle, and taxis mutually interfere in the process of entering and exiting the boarding point, so that the use efficiency of the boarding point is also reduced.
Assume 0 < η2=η2(m) < 1 is a reduction coefficient corresponding to m number of getting-on points under the condition of linearly arranged independent departure, and the effective number N of getting-on points of each lane at the moments=m×η2(m)。
Riding efficiency of each lane
Figure BDA0002251579100000021
Wherein 0 <ρ < 1 is expressed as a coefficient to cancel out the fluctuation of the parking time.
Total ride efficiency Nsum=2×N。
Since the taxi can independently enter or exit any boarding point, the rear car with the boarding is allowed to drive away before the front car without the boarding, and the traffic risk exists, the safety is lower than that of the embodiment, a dispatcher needs to be arranged to command and dispatch on site, and the safety of an airport is improved.
Example two: the linear arrangement is sent out in sequence:
as shown in fig. 1, m upper vehicle points are linearly arranged in sequence on two lanes, respectively. Taxis are arranged in sequence at the taxi-taking point, and the first-in first-out is realized. The passenger boarding rule is as follows: the 1 st to the m vehicles are sequentially ridden.
And m vehicle-entering points are sequentially and linearly arranged on the two lanes respectively. Taxis are arranged in sequence at the taxi-taking point, and the first-in first-out is realized. The passenger boarding rule is as follows: the 1 st to the m vehicles are sequentially ridden. With this arrangement, a plurality of waiting passengers at the boarding points get on the vehicle at the same time. The first vehicle passenger places luggage, the time required for getting on the vehicle and the starting and dispatching time directly influence the subsequent 2 nd to m th vehicles, and the 2 nd taxi influences the subsequent 3 rd to m th vehicles.
For a plurality of linearly arranged boarding points, since the rented vehicles of adjacent boarding points may interfere with each other and delay the time for entering and exiting the boarding points, the traffic capacity of each boarding point of the plurality of boarding points is different from that of a single boarding point, so that reduction needs to be carried out according to the use efficiency, and if 0 < η 1 ═ η 1(m) < 1 is a reduction coefficient corresponding to m boarding points in the case of linear arrangement and sequential departure, the effective number of boarding points N is Ns=m×η1(m)。
Riding efficiency of each lane
Figure BDA0002251579100000031
Where 0 < ρ < 1 is expressed as a coefficient to counteract the parking time fluctuations.
Total ride efficiency NsumCan be defined as the total departure quantity of all the departure points of two parallel lanes per hour, namely Nsum=2×N。
In the second embodiment, the taxi is first in first out, and the overtaking of the rear car is not allowed, so that the traffic risk caused by the overtaking of the rear car is avoided, and the safety is high.
Example three: vehicle storage pool distinguished according to travel distance
As shown in fig. 2, the storage pool is divided into a "long-distance destination waiting area" and a "short-distance destination waiting area" according to the distance, and the specific embodiment is, for example, divided into a "waiting area outside thirty kilometers" and a "waiting area within thirty kilometers". The 'waiting area outside thirty kilometers' is provided with a plurality of parking spaces, firstly a 1 st vehicle is taken, then a 2 nd, a 3 rd and a 4 th vehicles … … 'waiting area inside thirty kilometers' is taken in sequence, only one parking space is arranged, and a plurality of waiting areas of the same type are arranged in a set distance. The passenger selectively goes to the storage pool to take a taxi according to the distance from the passenger to the destination. Meanwhile, a taxi driver judges the distance of the next trip destination according to the operation condition, the oil quantity and other factors of the taxi driver on the same day. The scheme exerts the subjective initiative of the taxi driver, and the taxi driver is in a complete free state. According to the scheme, the passengers are shunted in advance according to the distance, so that the management is convenient, and the efficiency is improved.
Only one parking space is arranged in a waiting area within thirty kilometers, the taxi is first in and first out, the overtaking of the rear car is not allowed, and the traffic risk caused by the overtaking of the rear car is avoided, so that the safety factor is enhanced, and the safety is very high. A plurality of continuous parking spaces are arranged in a waiting area outside thirty kilometers, and when the airport arrives at a high flight density, a large number of passengers can be conveyed at the same time. Meanwhile, the 'waiting area within thirty kilometers' occupies less land and is more in arrangement, and short-distance passenger transportation is realized in a 'short-frequency and fast' mode.
For a plurality of linearly arranged boarding points, as the taxi vehicles of adjacent boarding points interfere with each other and delay the time of entering and exiting the boarding points, the traffic capacity of each boarding point of the plurality of boarding points is different from that of a single boarding point, and therefore, the traffic capacity needs to be reduced according to the use efficiency, if the traffic capacity is more than 0 and less than η, the traffic capacity is not limited by the traffic capacity of the plurality of boarding points, and the traffic capacity is not limited by the traffic capacity of the single boarding point1=η1(m) < 1 is a reduction coefficient corresponding to m departure points in the case of linear arrangement and sequential departure, and is effectiveNumber of getting on bus Ns=m×η1(m) of the reaction mixture. Riding efficiency of each lane
Figure BDA0002251579100000041
The riding efficiency can be defined as the total departure quantity N of all the departure points of two parallel lanes per hoursum=2×N。
Example four: parallel arranged independent departure
As shown in fig. 3, each lane is widened in the parking area, m boarding points are arranged in parallel, and a taxi enters and exits each boarding point, so that a passenger can leave the boarding point and converge into the original lane in front after finishing boarding. The passenger preferably selects the parked taxi.
The effective number of the vehicles getting on each lane can be considered to be equal to the number of the vehicles getting on, namely Ns=m。
Because the taxi getting-on points are arranged in parallel, taxies can enter and exit each taxi getting-on point independently, on one hand, the influence of the time for placing luggage and getting-on by passengers of the front taxi and the time for starting and dispatching the taxi on subsequent vehicles in the first embodiment is avoided, on the other hand, the mutual interference between the taxies in the second embodiment in the process of getting-on and getting-off of the taxi getting-on points is avoided, therefore, the use efficiency of the taxi getting-on points is not reduced, and the efficiency is improved by the scheme. The scheme needs to expand roads at parking spots and is suitable for the situation that parking areas have large road spaces. According to the scheme, the mutual interference between taxis in the process of entering and exiting the boarding point in the 'waiting area outside thirty kilometers' in the third embodiment is avoided, the possible traffic risks such as overtaking and the like are eliminated, and the safety is also considered.

Claims (6)

1. A method for allocating boarding points of taxis in an airport is characterized by comprising the following steps: the method adopts a linear arrangement departure mode, and the linear arrangement departure mode comprises linear arrangement independent departure and linear arrangement sequential departure.
2. The method of assigning boarding points for taxis at airports as claimed in claim 1, wherein: in the linear arrangement independent departure mode, the taxies enter and exit each boarding point independently, and the passengers can walk on the taxies.
3. The method of assigning boarding points for taxis at airports as claimed in claim 2, wherein: the passenger preferably selects a taxi to stop.
4. The method of assigning boarding points for taxis at airports as claimed in claim 1, wherein: in the linear arrangement sequential departure mode, m taxi-taking points are sequentially and linearly arranged on two lanes respectively, taxis are sequentially arranged on the taxi-taking points, and 1 st to m taxis are sequentially taken by passengers in a first-in first-out mode.
5. The method of assigning boarding points for taxis at airports as claimed in claim 1, wherein: in the linear arrangement departure mode, the waiting area is provided with a long-distance destination waiting area and a plurality of short-distance destination waiting areas; a plurality of parking spaces are arranged in the long-distance destination waiting area, and passengers take the bus in sequence; and each 'close-distance destination waiting area' is provided with a parking space.
6. The method of assigning boarding points for taxis at airports as claimed in claim 1, wherein: in the linear arrangement departure mode, the taxies are arranged in parallel and are independently dispatched, m departure points are arranged on the lane in parallel, and the taxies enter and exit each departure point and finish the departure of the passengers from the departure points.
CN201911036245.9A 2019-10-29 2019-10-29 Method for allocating boarding points of taxis in airport Pending CN110751824A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201911036245.9A CN110751824A (en) 2019-10-29 2019-10-29 Method for allocating boarding points of taxis in airport

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201911036245.9A CN110751824A (en) 2019-10-29 2019-10-29 Method for allocating boarding points of taxis in airport

Publications (1)

Publication Number Publication Date
CN110751824A true CN110751824A (en) 2020-02-04

Family

ID=69280727

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201911036245.9A Pending CN110751824A (en) 2019-10-29 2019-10-29 Method for allocating boarding points of taxis in airport

Country Status (1)

Country Link
CN (1) CN110751824A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111341092A (en) * 2020-02-28 2020-06-26 山东女子学院 Airport riding efficiency optimization method

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1958955A (en) * 2005-10-31 2007-05-09 张吉善 Plan and installation for improving highway traffic
CN201217767Y (en) * 2008-06-11 2009-04-08 上海市政工程设计研究总院 Plane combination type taxi lane edge
CN101551941A (en) * 2009-05-22 2009-10-07 同济大学 Taxi lining area setting controlling method
CN102194019A (en) * 2010-03-15 2011-09-21 中国城市规划设计研究院 Method for determining transportation facility layout of high-speed rail comprehensive transportation hub
CN102956099A (en) * 2011-08-26 2013-03-06 苏州市国贸电子系统工程有限公司 Waiting management method and waiting management system for taxis in station square

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1958955A (en) * 2005-10-31 2007-05-09 张吉善 Plan and installation for improving highway traffic
CN201217767Y (en) * 2008-06-11 2009-04-08 上海市政工程设计研究总院 Plane combination type taxi lane edge
CN101551941A (en) * 2009-05-22 2009-10-07 同济大学 Taxi lining area setting controlling method
CN102194019A (en) * 2010-03-15 2011-09-21 中国城市规划设计研究院 Method for determining transportation facility layout of high-speed rail comprehensive transportation hub
CN102956099A (en) * 2011-08-26 2013-03-06 苏州市国贸电子系统工程有限公司 Waiting management method and waiting management system for taxis in station square

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
吴娇蓉等: "综合客运枢纽出租车上客点管理模式和效率分析", 《交通信息与安全》 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111341092A (en) * 2020-02-28 2020-06-26 山东女子学院 Airport riding efficiency optimization method

Similar Documents

Publication Publication Date Title
US11623663B2 (en) Transport service method, vehicle platooning method, vehicle group navigation system, self-driving vehicle capable of platooning, and grouped vehicle guidance device
CN107563683A (en) Passenger and goods collaboration transportation resources and system in a kind of city
CN107169677B (en) Centralized dispatching command system for civil airport apron security vehicles
US7047888B2 (en) Transit system
US8195382B2 (en) Multiple driver occupied passenger vehicles transporter system
JP7026135B2 (en) On-demand default route self-driving vehicle
Soltani et al. An eco-friendly aircraft taxiing approach with collision and conflict avoidance
US10544599B2 (en) Integrated, multi-level airport terminal system
CN112749864A (en) Subway freight scheduling method, storage medium, computing device and system
CN109979186B (en) Bus parking position real-time distribution method based on GPS system
CN110751824A (en) Method for allocating boarding points of taxis in airport
van Oosterom et al. Dispatching a fleet of electric towing vehicles for aircraft taxiing with conflict avoidance and efficient battery charging
US11117679B2 (en) Method of transiting an aircraft arriving in and departing out of an integrated multi-level airport terminal
CN108611936A (en) Highway, the operation method of highway and system
CN107564322A (en) Separate type platform parked vehicles distribution method under the conditions of unidirectional double public transportation lanes
CN111047159B (en) Airport taxi passenger carrying distribution method
CN106886971A (en) The carbon-free random row traffic system of high efficiency smart
Zhao et al. Research on airport multi-objective optimization of stand allocation based on simulated annealing algorithm
CN114548531A (en) Construction and operation control method and system of full-automatic flight operation system sharing flight
CN108986449A (en) It is a kind of based on the fast public traffic system that do not stop for getting rid of extension automatically
WO2022120771A1 (en) Transportation method and system and vehicle suitable for transportation
JP7332237B2 (en) Transportation service method and vehicle group operation system
CN113593232B (en) Intelligent transportation method, system and management server
Zhao Analysis of Airport Taxi Problem Based on Battery Model
JP7451112B2 (en) Drone movement system and delivery system using it

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
RJ01 Rejection of invention patent application after publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20200204