[go: up one dir, main page]

CN109521449B - A method for selecting cruise destination based on taxi GPS track - Google Patents

A method for selecting cruise destination based on taxi GPS track Download PDF

Info

Publication number
CN109521449B
CN109521449B CN201910061715.0A CN201910061715A CN109521449B CN 109521449 B CN109521449 B CN 109521449B CN 201910061715 A CN201910061715 A CN 201910061715A CN 109521449 B CN109521449 B CN 109521449B
Authority
CN
China
Prior art keywords
cruising
grid
area
cruise
taxi
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201910061715.0A
Other languages
Chinese (zh)
Other versions
CN109521449A (en
Inventor
宗芳
吴挺
张慧永
田勇达
曾梦
石蕊
潘嵩岩
唐明
高飞
陈相茹
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Jilin University
Original Assignee
Jilin University
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 Jilin University filed Critical Jilin University
Priority to CN201910061715.0A priority Critical patent/CN109521449B/en
Publication of CN109521449A publication Critical patent/CN109521449A/en
Application granted granted Critical
Publication of CN109521449B publication Critical patent/CN109521449B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G01MEASURING; TESTING
    • G01SRADIO DIRECTION-FINDING; RADIO NAVIGATION; DETERMINING DISTANCE OR VELOCITY BY USE OF RADIO WAVES; LOCATING OR PRESENCE-DETECTING BY USE OF THE REFLECTION OR RERADIATION OF RADIO WAVES; ANALOGOUS ARRANGEMENTS USING OTHER WAVES
    • G01S19/00Satellite radio beacon positioning systems; Determining position, velocity or attitude using signals transmitted by such systems
    • G01S19/38Determining a navigation solution using signals transmitted by a satellite radio beacon positioning system

Landscapes

  • Engineering & Computer Science (AREA)
  • Radar, Positioning & Navigation (AREA)
  • Remote Sensing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Traffic Control Systems (AREA)

Abstract

The invention discloses a method for selecting a cruising destination based on a taxi GPS track. The method specifically comprises the five steps of step 1, determining cruise areas in different time periods, step 2, carrying out grid division on a cruise range, step 3, determining alternative cruise destination grids, step 4, calculating the attractive force of each alternative cruise destination grid, and step 5, pushing the alternative cruise destination grids to a taxi. The method disclosed by the invention is based on taxi GPS track data, the cruising area is gridded, the attraction of the alternative cruising destination grid to the taxi is calculated according to the number of historical passenger carrying points, the land utilization intensity and the shortest travel time, and the alternative cruising destination grid is pushed to the taxi according to the sequence of the attraction from large to small. The method can assist the taxi to select the cruising destination, improve the passenger carrying success rate, and reduce the idle cruising mileage, the fuel consumption, the environmental pollution and the traffic jam caused by the idle cruising.

Description

一种基于出租车GPS轨迹选择巡航目的地的方法A Method of Selecting Cruise Destination Based on Taxi GPS Trajectory

技术领域technical field

本发明涉及导航算法开发领域,具体涉及一种为出租车驾驶员推荐空载巡航目的地的方法。The invention relates to the field of navigation algorithm development, in particular to a method for recommending no-load cruising destinations for taxi drivers.

背景技术Background technique

出租车GPS数据能够全方位覆盖城市路网交通,既能反映出租车的历史载客经验和规律,也能反映乘客的需求特征和出行规律。所以,通过对出租车的海量GPS数据进行分析,发现隐藏在数据中的深层次信息,借助于数据挖掘技术,分析出数据蕴含的信息和出租车历史载客经验,可以辅助出租车更加快速高效地寻找乘客。Taxi GPS data can cover urban road network traffic in an all-round way, which can not only reflect the historical passenger experience and rules of taxis, but also reflect the demand characteristics and travel rules of passengers. Therefore, by analyzing the massive GPS data of taxis, we can discover the deep information hidden in the data. With the help of data mining technology, we can analyze the information contained in the data and the historical passenger experience of taxis, which can help taxis to be faster and more efficient. looking for passengers.

如果开发一种为出租车驾驶员推荐空载巡航目的地的方法,根据出租车历史载客点的分布情况为出租车计算优选的巡航目的地,可以辅助出租车选择巡航目的地,提高载客成功率,减少巡航过程导致的无效行驶以及由此导致的燃油消耗、环境污染和交通拥堵。If a method for recommending no-load cruising destinations for taxi drivers is developed, and the optimal cruising destinations are calculated for taxis based on the distribution of taxi historical passenger points, it can assist taxis in selecting cruising destinations and improve passenger capacity. The success rate can reduce the invalid driving caused by the cruising process and the resulting fuel consumption, environmental pollution and traffic congestion.

在以往研究中,一些学者基于出租车GPS数据分析了出租车的巡航行为,如专利201310094868.8基于出租车GPS数据研究巡航点的空间分布特征,分析了历史载客点信息、用地信息等对出租车巡航点选择行为的影响。一些学者研究出租车乘客的需求规律,例如专利201410068245.8研究了基于招车期望值的出租车空车导航系统与方法。这些研究成果均没有涉及如何在巡航过程中为出租车计算并推荐巡航目的地。基于上述背景可见,亟需设计一种利用出租车历史载客信息为出租车驾驶员推荐空载巡航目的地的方法,帮助出租车驾驶员更快速高效地寻找乘客,解决出租车驾驶员被动等待和盲目低效巡航的问题。经查找,暂未有在出租车空载巡航过程中为其推荐巡航目的地的算法的国内外相关报道。In previous studies, some scholars have analyzed the cruising behavior of taxis based on taxi GPS data. Effects of cruise point selection behavior. Some scholars study the demand law of taxi passengers. For example, patent 201410068245.8 studies the taxi empty navigation system and method based on the expected value of the taxi. None of these research results deal with how to calculate and recommend cruising destinations for taxis during cruising. Based on the above background, it can be seen that there is an urgent need to design a method for recommending unloaded cruising destinations for taxi drivers by using the historical passenger information of taxis, so as to help taxi drivers find passengers more quickly and efficiently, and solve the problem of passive waiting for taxi drivers. And the problem of blind inefficient cruising. After searching, there is no relevant report at home and abroad on the algorithm that recommends cruising destinations for taxis in the process of cruising with no load.

发明内容SUMMARY OF THE INVENTION

1.一种基于出租车GPS轨迹选择巡航目的地的方法,其特征在于,包括如下步骤:1. A method for selecting a cruising destination based on taxi GPS track, characterized in that, comprising the steps:

步骤1确定不同时段的巡航区域Step 1 Determine the cruising area for different time periods

将一天24小时分为12个时间段,每个时间段的时长为2小时,采集城市任一工作日24小时的路网交通量,将交通量最大的时段设定为高峰时段,其他时段设定为平峰时段,将高峰时段内出租车的可接受最大巡航半径R设定为3km,平峰时段出租车可接受最大巡航半径R设定为5km,将以出租车当前巡航起点O为中心、半径R为3km的圆形区域定义为高峰时段出租车的巡航区域;将以出租车当前巡航起点O为中心、半径R为5km的圆形区域定义为平峰时段出租车的巡航区域;Divide 24 hours a day into 12 time periods, each time period is 2 hours, collect the road network traffic volume of any working day in the city for 24 hours, set the time period with the largest traffic volume as the peak time period, and set the time period for other periods as As the flat peak period, the maximum acceptable cruising radius R of taxis during peak hours is set to 3km, and the maximum acceptable cruising radius R of taxis during flat peak hours is set to 5km. The circular area where R is 3km is defined as the cruising area of the taxi during peak hours; the circular area with the current cruising starting point O of the taxi as the center and a radius R of 5 km is defined as the cruising area of the taxi during the peak hours;

步骤2对巡航区域进行网格划分Step 2 Mesh the cruise area

步骤2.1计算网格边长Step 2.1 Calculate the mesh side length

将巡航区域划分为正方形网格,首先计算巡航区域内前一天所有出租车的载客点总和,记为Q,其次计算巡航区域的面积A=πR2,再次计算每一个网格的面积S=2A/Q,最后计算每个网格的边长

Figure BDA0001954356360000021
Divide the cruising area into square grids, first calculate the sum of the passenger points of all taxis in the cruising area the day before, denoted as Q, then calculate the area of the cruising area A=πR 2 , and calculate the area of each grid S= 2A/Q, finally calculate the side length of each grid
Figure BDA0001954356360000021

步骤2.2将巡航区域栅格化处理Step 2.2 Rasterize the cruise area

以过当前巡航起点O的纬线为基准,将其向上平移L/2画平行线,再将此平行线向上平移L画平行线,在此基础上依次向上平移k*L画平行线,k=1,2,3,4,…,直到该线与巡航区域相切或相离时停止;同理,以过当前巡航起点O的纬线为基准,将其向下平移L/2画平行线,再将此平行线向下平移L画平行线,在此基础上依次向下平移k*L画平行线,k=1,2,3,4,…,直到该线与巡航区域相切或相离时停止;Take the latitude line passing through the current cruising starting point O as the benchmark, translate it upwards by L/2 to draw a parallel line, and then translate this parallel line upwards by L to draw a parallel line, and on this basis, sequentially translate upwards by k*L to draw a parallel line, k= 1, 2, 3, 4, ... until the line is tangent to or separated from the cruising area; similarly, using the latitude line passing through the current cruising starting point O as a reference, translate it downward by L/2 to draw a parallel line, Then translate the parallel line downward by L to draw a parallel line, and on this basis, sequentially translate downward by k*L to draw a parallel line, k=1, 2, 3, 4,... until the line is tangent or intersecting with the cruise area stop when leaving;

以过当前巡航起点O的经线为基准,将其向左平移L/2画平行线,再将此平行线向左平移L画平行线,在此基础上依次向左平移k*L画平行线,k=1,2,3,4,…,直到该线与巡航区域相切或相离时停止;同理,以过当前巡航起点O的经线为基准,将其向右平移L/2画平行线,再将此平行线向右平移L再画平行线,在此基础上依次向右平移k*L画平行线,k=1,2,3,4,…,直到该线与巡航区域相切或相离时停止;Based on the meridian passing through the current cruise starting point O, move it to the left by L/2 to draw a parallel line, then move the parallel line to the left by L to draw a parallel line, and then move to the left by k*L to draw a parallel line , k=1,2,3,4,..., until the line is tangent to or separated from the cruising area; similarly, take the meridian passing through the current cruising starting point O as a reference, and translate it to the right by L/2 draw Parallel line, then translate the parallel line to the right by L and draw a parallel line, on this basis, translate to the right by k*L to draw a parallel line, k=1,2,3,4,... until the line is in line with the cruise area Stop when tangent or separated;

由各条纬线和经线构成了正方形网格,对被巡航区域边界穿过的网格进行筛选,若某网格的中心点位于巡航区域内则该网格算在巡航区域内,相反,若某网格的中心点位于巡航区域外则该网格不算在巡航区域内;A square grid is formed by each latitude and longitude, and the grid crossed by the boundary of the cruise area is screened. If the center point of a grid is located in the cruise area, the grid is counted in the cruise area. On the contrary, if a certain If the center point of the grid is outside the cruising area, the grid is not included in the cruising area;

步骤3确定备选巡航目的地网格Step 3 Identify Alternate Cruise Destination Grid

将巡航区域内各网格中前一天所有出租车的载客点总和记为Qn,n为网格标号,n=1,2,3,4,…,N,N为巡航区域内的网格总数,按Qn的值由大到小的顺序进行网格排序,将前10个网格作为备选巡航目的地网格,记为Di,i=1,2,3,…,10;Record the sum of passenger loading points of all taxis in each grid in the cruising area as Q n , n is the grid label, n=1, 2, 3, 4,..., N, N is the grid in the cruising area The total number of grids, the grids are sorted in descending order according to the value of Q n , and the first 10 grids are used as grids of alternative cruising destinations, which are recorded as D i , i=1,2,3,...,10 ;

步骤4计算各备选巡航目的地网格的吸引力Step 4 Calculate the attractiveness of each alternative cruise destination grid

根据最短路计算方法计算当前巡航起点O到各备选巡航目的地网格Di的最短出行时间,记为tiCalculate the shortest travel time from the current cruising starting point O to each alternative cruising destination grid D i according to the shortest path calculation method, denoted as t i ;

将各备选巡航目的地网格中前一天所有出租车的载客点数量之和记为Q’iThe sum of the number of passenger points of all taxis in the previous day in each alternative cruising destination grid is recorded as Q'i;

应用公式1计算各备选巡航目的地网格的土地利用强度,其中Pi为网格中的人口数量;Apply formula 1 to calculate the land use intensity of each candidate cruising destination grid, where P i is the population in the grid;

Mi=Pi/S 公式1M i =P i /S Formula 1

计算各备选巡航目的地网格的吸引力为:Calculate the attractiveness of each alternative cruising destination grid as:

Fi=Q′i·Mi/ti 公式1F i =Q′ i · M i /t i Formula 1

步骤5向出租车推送备选巡航目的地网格Step 5 Push the grid of alternative cruising destinations to the taxi

在系统界面向出租车驾驶员按Fi由大到小的排序进行备选巡航目的地网格推送。On the system interface, the grids of alternative cruising destinations are pushed to taxi drivers in order of F i from large to small.

与现有技术相比,本发明的有益效果是:Compared with the prior art, the beneficial effects of the present invention are:

本发明所述的一种基于出租车GPS轨迹选择巡航目的地的方法,通过对出租车GPS轨迹数据进行分析,得到历史载客点的分布情况,然后将巡航区域网格化,根据历史载客点的数量、土地利用强度以及从当前位置到备选目的地的最短出行时间计算所有备选目的地网格对出租车的吸引力,最终对吸引力大小按照由大到小的排序为出租车进行备选巡航目的地网格推送。通过该方法可以辅助出租车选择巡航目的地,提高载客成功率,减少空载巡航里程,以及空载巡航导致的燃油消耗、环境污染和交通拥堵。A method for selecting a cruising destination based on a taxi GPS track according to the present invention, by analyzing the taxi GPS track data, obtains the distribution of historical passenger loading points, then grids the cruising area, and based on the historical passenger loading points The number of points, land use intensity and the shortest travel time from the current location to the alternative destination calculate the attractiveness of all alternative destination grids to taxis, and the final attraction is sorted from large to small as taxis Perform alternate cruise destination grid push. This method can assist taxis to select cruising destinations, improve the success rate of passenger loading, reduce the mileage of unloaded cruising, and the fuel consumption, environmental pollution and traffic congestion caused by unloaded cruising.

附图说明Description of drawings

图1是本发明的基于出租车GPS轨迹选择巡航目的地的方法总体流程图;Fig. 1 is the general flowchart of the method for selecting cruise destination based on taxi GPS track of the present invention;

图2是本发明的巡航区域网格划分示意图;Fig. 2 is a schematic diagram of grid division of the cruising area of the present invention;

图3是本发明的实施例载客点分布示意图;Fig. 3 is a schematic diagram of distribution of passenger points according to an embodiment of the present invention;

图4是本发明的实施例备选巡航目的地网格推送界面示意图。Fig. 4 is a schematic diagram of an interface for pushing a grid of alternative cruising destinations according to an embodiment of the present invention.

具体实施方式Detailed ways

一、GPS轨迹点数据格式1. GPS track point data format

由出租车车载GPS设备获取的出租车轨迹点数据,数据格式示例如表1所示。Table 1 shows an example of the data format of the taxi track point data obtained by the taxi-mounted GPS device.

表1 GPS轨迹点数据格式示例Table 1 Example of GPS track point data format

序号serial number 日期date 车牌号number plate 记录时刻record moment 经度(E)Longitude (E) 纬度(N)Latitude (N) 车辆状态vehicle status 241241 2017/12/202017/12/20 粤B8UG39Guangdong B8UG39 7:32:307:32:30 113.888894113.888894 22.56206122.562061 00 242242 2017/12/202017/12/20 粤B945Z0Guangdong B945Z0 7:32:357:32:35 113.992741113.992741 22.58363922.583639 00 243243 2017/12/202017/12/20 粤B945Z0Guangdong B945Z0 7:32:407:32:40 113.992741113.992741 22.58363922.583639 11 244244 2017/12/202017/12/20 粤B8UG39Guangdong B8UG39 7:32:457:32:45 113.992741113.992741 22.58363922.583639 11 245245 2017/12/202017/12/20 粤B0721DGuangdong B0721D 7:32:507:32:50 113.927474113.927474 22.68408422.684084 00 246246 2017/12/202017/12/20 粤B372Z7Guangdong B372Z7 7:32:557:32:55 114.150457114.150457 22.65769922.657699 00 247247 2017/12/202017/12/20 粤B8UG39Guangdong B8UG39 7:33:007:33:00 114.140772114.140772 22.61000522.610005 00 248248 2017/12/202017/12/20 粤BA5Y24Guangdong BA5Y24 7:33:057:33:05 114.043187114.043187 22.52074622.520746 00 249249 2017/12/202017/12/20 粤B214G9Guangdong B214G9 7:33:107:33:10 114.107526114.107526 22.53542322.535423 11 250250 2017/12/202017/12/20 粤B945Z0Guangdong B945Z0 7:33:157:33:15 113.921162113.921162 22.53265722.532657 11

二、计算方法和步骤2. Calculation method and steps

参阅图1,本发明专利所述的基于出租车GPS轨迹选择巡航目的地的方法由以下五个步骤组成:Referring to Fig. 1, the method for selecting the cruising destination based on the taxi GPS trajectory described in the patent of the present invention consists of the following five steps:

步骤1确定不同时段的巡航区域Step 1 Determine the cruising area for different time periods

根据交通量的大小将一天分为12个时段,根据路网交通量确定高峰时段和平峰时段,分别设定高峰时段和平峰时段的巡航区域。Divide a day into 12 time periods according to the traffic volume, determine the peak hours and the peak hours according to the traffic volume of the road network, and set the cruising areas during the peak hours and the peak hours respectively.

步骤2对巡航区域进行网格划分Step 2 Mesh the cruise area

步骤2.1计算网格边长Step 2.1 Calculate the mesh side length

根据巡航区域内前一天所有出租车的载客点总和以及巡航区域面积,计算正方形网格边长L。Calculate the side length L of the square grid according to the sum of the passenger loading points of all taxis in the cruising area and the area of the cruising area on the previous day.

步骤2.2将巡航区域栅格化处理Step 2.2 Rasterize the cruise area

根据步骤2.1计算得到的正方形网格边长L,以过当前巡航起点O的经、纬线为基准,分别向上下左右四个方向平移L/2画平行线,再将此平行线继续向外平移L画平行线,在此基础上向上下左右四个方向依次平移k*L画平行线,k=1,2,3,4,…,直到该线与巡航区域相切或相离时停止。According to the side length L of the square grid calculated in step 2.1, based on the longitude and latitude passing through the current cruising starting point O, translate L/2 in the four directions of up, down, left, and right to draw a parallel line, and then continue to translate the parallel line outward L draws parallel lines, and on this basis, translates k*L to draw parallel lines in four directions up, down, left, and right, k=1, 2, 3, 4, ..., until the line is tangent to or separated from the cruise area and stops.

由各条纬线和经线构成了正方形网格,对被巡航区域边界穿过的网格进行筛选,若某网格的中心点位于巡航区域内则该网格算在巡航区域内,相反,若某网格的中心点位于巡航区域外则该网格不算在巡航区域内,如图2阴影区域所示。A square grid is formed by each latitude and longitude, and the grid crossed by the boundary of the cruise area is screened. If the center point of a grid is located in the cruise area, the grid is counted in the cruise area. On the contrary, if a certain If the center point of the grid is outside the cruising area, the grid is not included in the cruising area, as shown in the shaded area in Figure 2.

步骤3确定备选巡航目的地网格Step 3 Identify Alternate Cruise Destination Grid

基于出租车GPS轨迹数据集,进行数据预处理,保留车牌号、日期、记录时刻、经度、纬度、车辆状态等有效字段,GPS轨迹点数据格式示例如表1所示。根据车辆状态数据可知,当车辆状态由空载(即车辆状态=0)变为载客(即车辆状态=1)时的轨迹数据,即为出租车的一个载客点数据。Based on the taxi GPS trajectory data set, data preprocessing is performed, and valid fields such as license plate number, date, recording time, longitude, latitude, and vehicle status are retained. An example of the GPS trajectory point data format is shown in Table 1. According to the vehicle state data, it can be seen that the trajectory data when the vehicle state changes from empty (ie vehicle state=0) to passenger (ie vehicle state=1) is the data of a passenger loading point of the taxi.

将巡航区域内各网格中前一天所有出租车的载客点总和记为Qn,n为网格标号,n=1,2,3,4,…,N,N为巡航区域内的网格总数,按Qn的值由大到小的顺序进行网格排序,将前10个网格作为备选巡航目的地网格,记为Di,i=1,2,3,…10。Record the sum of passenger loading points of all taxis in each grid in the cruising area as Q n , n is the grid label, n=1, 2, 3, 4,..., N, N is the grid in the cruising area The total number of grids, the grids are sorted in descending order of the value of Q n , and the first 10 grids are used as candidate cruise destination grids, which are recorded as D i , i=1, 2, 3,...10.

步骤4计算各备选巡航目的地网格的吸引力Step 4 Calculate the attractiveness of each alternative cruise destination grid

根据最短路计算方法计算当前巡航起点O到各备选巡航目的地网格Di的最短出行时间,记为tiCalculate the shortest travel time from the current cruising starting point O to each alternative cruising destination grid D i according to the shortest path calculation method, denoted as t i ;

将各备选巡航目的地网格中前一天所有出租车的载客点总和记为Q’iRecord the sum of the loading points of all taxis in the previous day in each alternative cruising destination grid as Q'i;

应用公式1计算备选巡航目的地网格的土地利用强度MiApply formula 1 to calculate the land use intensity M i of the grid of alternative cruise destinations;

应用公式2计算各备选巡航目的地网格的吸引力FiApply formula 2 to calculate the attraction F i of each candidate cruise destination grid.

步骤5向出租车推送备选巡航目的地网格Step 5 Push the grid of alternative cruising destinations to the taxi

在系统界面向出租车驾驶员按Fi由大到小的排序进行备选巡航目的地网格的推送。On the system interface, the grids of alternative cruising destinations are pushed to taxi drivers in descending order of F i .

三、实施例Three, the embodiment

本发明专利所述的一种基于出租车GPS轨迹选择巡航目的地的方法的实施例,给出实施过程和检验结果,但本发明的保护范围不限于下述的实施例。An embodiment of a method for selecting a cruising destination based on the taxi GPS trajectory described in the patent of the present invention provides the implementation process and inspection results, but the scope of protection of the present invention is not limited to the following embodiments.

采集深圳市所有出租车2017年12月20-21日的GPS轨迹点数据,对数据进行处理,保留车牌号、日期、记录时刻、经度、纬度、车辆状态等有效字段。统计深圳市路网交通流量数据,得知高峰时段为6:00-8:00。以深圳市某一出租车为例,其2017年12月21日高峰时段6:00-8:00某一次巡航的起点O为深南科苑立交桥(22.539865°E,113.945515°N)。如图3所示,根据数据处理得到深圳市所有出租车2017年12月20日的载客点轨迹分布,计算高峰时段以O为圆心、半径R为3km的圆形巡航区域内的载客点总和Q=6538。同时已知巡航区域面积A为πR2,计算得到每个网格的边长L为0.093km。Collect GPS track point data of all taxis in Shenzhen on December 20-21, 2017, process the data, and retain valid fields such as license plate number, date, recording time, longitude, latitude, and vehicle status. According to the statistics of the traffic flow data of the Shenzhen road network, the peak hours are 6:00-8:00. Taking a taxi in Shenzhen as an example, the starting point O of a certain cruise during the peak hours of 6:00-8:00 on December 21, 2017 is Shennan Keyuan Overpass (22.539865°E, 113.945515°N). As shown in Figure 3, according to the data processing, the trajectory distribution of passenger loading points of all taxis in Shenzhen on December 20, 2017 is obtained, and the passenger loading points in the circular cruising area with O as the center and radius R of 3 km are calculated during peak hours The sum Q=6538. At the same time, the area A of the cruising area is known to be πR 2 , and the side length L of each grid is calculated to be 0.093km.

以过当前巡航起点O的经、纬线为基准,以边长L=0.093km划分网格,并对被巡航区域边界穿过的网格进行筛选。计算2017年12月20日巡航区域内各网格的所有出租车载客点总和,记为Qn,n为网格标号,n=1,2,3,4,…,N,N为巡航区域内的网格总数,按Qn的值由大到小的顺序进行网格排序,将前10个网格作为备选巡航目的地网格,记为Di,i=1,2,3,…10。Based on the longitude and latitude passing through the current cruising starting point O, the grid is divided with the side length L=0.093km, and the grids crossed by the boundary of the cruising area are screened. Calculate the sum of all taxi passenger points in each grid in the cruising area on December 20, 2017, denoted as Q n , n is the grid label, n=1,2,3,4,...,N, N is cruising The total number of grids in the area, the grids are sorted according to the value of Q n from large to small, and the first 10 grids are used as candidate cruise destination grids, which are recorded as D i , i=1,2,3 ,...10.

根据图3所示,计算得到的前10个备选巡航目的地网格,应用公式1求出各备选巡航目的地网格的土地利用强度,并结合计算得到的当前巡航起点O到各备选巡航目的地网格的最短出行时间,应用公式2计算各备选巡航目的地网格的吸引力,计算结果见表2。在系统界面向出租车驾驶员按吸引力由大到小的顺序,进行备选巡航目的地网格推送,推送界面如图4所示。According to the calculated top 10 candidate cruise destination grids as shown in Fig. 3, the land use intensity of each candidate cruise destination grid is obtained by applying formula 1, and combined with the calculated current cruise starting point O to each standby Select the shortest travel time of the cruising destination grid, and apply formula 2 to calculate the attractiveness of each alternative cruising destination grid. The calculation results are shown in Table 2. On the system interface, push the grid of alternative cruising destinations to taxi drivers in order of attractiveness from large to small. The push interface is shown in Figure 4.

表2备选巡航目的地网格的吸引力Table 2 Attractiveness of Alternative Cruise Destination Grid

Figure BDA0001954356360000051
Figure BDA0001954356360000051

Claims (1)

1.一种基于出租车GPS轨迹选择巡航目的地的方法,其特征在于,包括如下步骤:1. A method for selecting a cruising destination based on taxi GPS track, characterized in that, comprising the steps: 步骤1 确定不同时段的巡航区域Step 1 Determine the cruising area in different time periods 将一天24小时分为12个时间段,每个时间段的时长为2小时,采集城市任一工作日24小时的路网交通量,将交通量最大的时段设定为高峰时段,其他时段设定为平峰时段,将高峰时段内出租车的可接受最大巡航半径R设定为3km,平峰时段出租车可接受最大巡航半径R设定为5km,将以出租车当前巡航起点O为中心、半径R为3km的圆形区域定义为高峰时段出租车的巡航区域;将以出租车当前巡航起点O为中心、半径R为5km的圆形区域定义为平峰时段出租车的巡航区域;Divide 24 hours a day into 12 time periods, each time period is 2 hours, collect the road network traffic volume of any working day in the city for 24 hours, set the time period with the largest traffic volume as the peak time period, and set the time period for other periods as As the flat peak period, the maximum acceptable cruising radius R of taxis during peak hours is set to 3km, and the maximum acceptable cruising radius R of taxis during flat peak hours is set to 5km. The circular area where R is 3km is defined as the cruising area of the taxi during peak hours; the circular area with the current cruising starting point O of the taxi as the center and a radius R of 5 km is defined as the cruising area of the taxi during the peak hours; 步骤2 对巡航区域进行网格划分Step 2 Carry out grid division for the cruise area 步骤2.1 计算网格边长Step 2.1 Calculate the grid side length 将巡航区域划分为正方形网格,首先计算巡航区域内前一天所有出租车的载客点总和,记为Q,其次计算巡航区域的面积A=πR2,再次计算每一个网格的面积S=2A/Q,最后计算每个网格的边长
Figure FDA0001954356350000011
Divide the cruising area into square grids, first calculate the sum of the passenger points of all taxis in the cruising area the day before, denoted as Q, then calculate the area of the cruising area A=πR 2 , and calculate the area of each grid S= 2A/Q, finally calculate the side length of each grid
Figure FDA0001954356350000011
步骤2.2 将巡航区域栅格化处理Step 2.2 Rasterize the cruise area 以过当前巡航起点O的纬线为基准,将其向上平移L/2画平行线,再将此平行线向上平移L画平行线,在此基础上依次向上平移k*L画平行线,k=1,2,3,4,…,直到该线与巡航区域相切或相离时停止;同理,以过当前巡航起点O的纬线为基准,将其向下平移L/2画平行线,再将此平行线向下平移L画平行线,在此基础上依次向下平移k*L画平行线,k=1,2,3,4,…,直到该线与巡航区域相切或相离时停止;Take the latitude line passing through the current cruising starting point O as the benchmark, translate it upwards by L/2 to draw a parallel line, and then translate this parallel line upwards by L to draw a parallel line, and on this basis, sequentially translate upwards by k*L to draw a parallel line, k= 1, 2, 3, 4, ... until the line is tangent to or separated from the cruising area; similarly, using the latitude line passing through the current cruising starting point O as a reference, translate it downward by L/2 to draw a parallel line, Then translate the parallel line downward by L to draw a parallel line, and on this basis, sequentially translate downward by k*L to draw a parallel line, k=1, 2, 3, 4, ... until the line is tangent or intersecting with the cruise area stop when leaving; 以过当前巡航起点O的经线为基准,将其向左平移L/2画平行线,再将此平行线向左平移L画平行线,在此基础上依次向左平移k*L画平行线,k=1,2,3,4,…,直到该线与巡航区域相切或相离时停止;同理,以过当前巡航起点O的经线为基准,将其向右平移L/2画平行线,再将此平行线向右平移L再画平行线,在此基础上依次向右平移k*L画平行线,k=1,2,3,4,…,直到该线与巡航区域相切或相离时停止;Based on the meridian passing through the current cruise starting point O, move it to the left by L/2 to draw a parallel line, then move the parallel line to the left by L to draw a parallel line, and then move to the left by k*L to draw a parallel line , k=1,2,3,4,..., until the line is tangent to or separated from the cruising area; similarly, take the meridian passing through the current cruising starting point O as a reference, and translate it to the right by L/2 draw Parallel line, then translate the parallel line to the right by L and draw a parallel line, on this basis, translate to the right by k*L to draw a parallel line, k=1,2,3,4,... until the line is in line with the cruise area Stop when tangent or separated; 由各条纬线和经线构成了正方形网格,对被巡航区域边界穿过的网格进行筛选,若某网格的中心点位于巡航区域内则该网格算在巡航区域内,相反,若某网格的中心点位于巡航区域外则该网格不算在巡航区域内;A square grid is formed by each latitude and longitude, and the grids crossed by the boundary of the cruise area are screened. If the center point of a grid is located in the cruise area, the grid is counted in the cruise area. On the contrary, if a certain If the center point of the grid is outside the cruising area, the grid is not included in the cruising area; 步骤3 确定备选巡航目的地网格Step 3 Determine the Alternative Cruise Destination Grid 将巡航区域内各网格中前一天所有出租车的载客点总和记为Qn,n为网格标号,n=1,2,3,4,…,N,N为巡航区域内的网格总数,按Qn的值由大到小的顺序进行网格排序,将前10个网格作为备选巡航目的地网格,记为Di,i=1,2,3,…,10;Record the sum of passenger loading points of all taxis in each grid in the cruising area as Q n , n is the grid label, n=1, 2, 3, 4,..., N, N is the grid in the cruising area The total number of grids, the grids are sorted in descending order according to the value of Q n , and the first 10 grids are used as grids of alternative cruising destinations, which are recorded as D i , i=1,2,3,...,10 ; 步骤4 计算各备选巡航目的地网格的吸引力Step 4 Calculate the attractiveness of each alternative cruising destination grid 根据最短路计算方法计算当前巡航起点O到各备选巡航目的地网格Di的最短出行时间,记为tiCalculate the shortest travel time from the current cruising starting point O to each alternative cruising destination grid D i according to the shortest path calculation method, denoted as t i ; 将各备选巡航目的地网格中前一天所有出租车的载客点数量之和记为Q’iThe sum of the number of passenger points of all taxis in the previous day in each alternative cruising destination grid is recorded as Q'i; 应用公式1计算各备选巡航目的地网格的土地利用强度,其中Pi为网格中的人口数量;Apply formula 1 to calculate the land use intensity of each candidate cruising destination grid, where P i is the population in the grid; Mi=Pi/S 公式1M i =P i /S Formula 1 计算各备选巡航目的地网格的吸引力为:Calculate the attractiveness of each alternative cruising destination grid as: Fi=Q'i·Mi/ti 公式2F i =Q' i ·M i /t i Formula 2 步骤5 向出租车推送备选巡航目的地网格Step 5 Push the alternate cruising destination grid to the taxi 在系统界面向出租车驾驶员按Fi由大到小的排序进行备选巡航目的地网格推送。On the system interface, the grids of alternative cruising destinations are pushed to taxi drivers in order of F i from large to small.
CN201910061715.0A 2019-01-23 2019-01-23 A method for selecting cruise destination based on taxi GPS track Active CN109521449B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201910061715.0A CN109521449B (en) 2019-01-23 2019-01-23 A method for selecting cruise destination based on taxi GPS track

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201910061715.0A CN109521449B (en) 2019-01-23 2019-01-23 A method for selecting cruise destination based on taxi GPS track

Publications (2)

Publication Number Publication Date
CN109521449A CN109521449A (en) 2019-03-26
CN109521449B true CN109521449B (en) 2022-10-28

Family

ID=65799731

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201910061715.0A Active CN109521449B (en) 2019-01-23 2019-01-23 A method for selecting cruise destination based on taxi GPS track

Country Status (1)

Country Link
CN (1) CN109521449B (en)

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2012112828A (en) * 2010-11-25 2012-06-14 Denso Corp Route guidance system, vehicle management center and on-vehicle device
JP2013140498A (en) * 2012-01-05 2013-07-18 Traffic Plus:Kk Method for acquiring estimated travel track of general vehicle by bus probe data
CN103218672A (en) * 2013-03-24 2013-07-24 吉林大学 Taxi cruising action analytical method based on global position system (GPS) data grid statistic
WO2014085316A1 (en) * 2012-11-27 2014-06-05 Cloudparc, Inc. Controlling use of a single multi-vehicle parking space using multiple cameras
CN105229422A (en) * 2013-03-15 2016-01-06 大众汽车有限公司 Automatic Pilot route planning is applied
CN106130110A (en) * 2016-07-15 2016-11-16 华北电力大学 The electric taxi charging station constant volume method on trip ground is selected based on stratified probability
CN106599390A (en) * 2016-11-23 2017-04-26 国网浙江省电力公司电动汽车服务分公司 Method for calculating charging load considering time-space stochastic characteristics of electric taxi
CN107038886A (en) * 2017-05-11 2017-08-11 厦门大学 A kind of taxi based on track data cruise path recommend method and system
CN108537391A (en) * 2018-04-25 2018-09-14 哈尔滨工业大学 A kind of taxi bus stop setting optimization method based on taxi track data
CN108645769A (en) * 2018-06-05 2018-10-12 广州市荣盛环保科技有限公司 A kind of environmental air quality monitoring method based on unmanned plane

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP6882042B2 (en) * 2017-04-06 2021-06-02 ヤマハ発動機株式会社 Server system and method

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2012112828A (en) * 2010-11-25 2012-06-14 Denso Corp Route guidance system, vehicle management center and on-vehicle device
JP2013140498A (en) * 2012-01-05 2013-07-18 Traffic Plus:Kk Method for acquiring estimated travel track of general vehicle by bus probe data
WO2014085316A1 (en) * 2012-11-27 2014-06-05 Cloudparc, Inc. Controlling use of a single multi-vehicle parking space using multiple cameras
CN105229422A (en) * 2013-03-15 2016-01-06 大众汽车有限公司 Automatic Pilot route planning is applied
CN103218672A (en) * 2013-03-24 2013-07-24 吉林大学 Taxi cruising action analytical method based on global position system (GPS) data grid statistic
CN106130110A (en) * 2016-07-15 2016-11-16 华北电力大学 The electric taxi charging station constant volume method on trip ground is selected based on stratified probability
CN106599390A (en) * 2016-11-23 2017-04-26 国网浙江省电力公司电动汽车服务分公司 Method for calculating charging load considering time-space stochastic characteristics of electric taxi
CN107038886A (en) * 2017-05-11 2017-08-11 厦门大学 A kind of taxi based on track data cruise path recommend method and system
CN108537391A (en) * 2018-04-25 2018-09-14 哈尔滨工业大学 A kind of taxi bus stop setting optimization method based on taxi track data
CN108645769A (en) * 2018-06-05 2018-10-12 广州市荣盛环保科技有限公司 A kind of environmental air quality monitoring method based on unmanned plane

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
UNDERSTANDING TAXI DRIVERS" MULTI-DAY CRUISING PATTERNS;Zong, F (Zong, Fang) etc.;<PROMET-TRAFFIC & TRANSPORTATION>;20151231;第27卷(第6期);第467-476页 *
基于改进凸包算法的船舶巡航预警快速监测研究;黄冬梅 等;《计算机应用研究》;20171115;第35卷(第11期);第3243-3245,3258页 *

Also Published As

Publication number Publication date
CN109521449A (en) 2019-03-26

Similar Documents

Publication Publication Date Title
CN110298500B (en) Urban traffic track data set generation method based on taxi data and urban road network
CN105206046B (en) The addressing of tax services station and feasibility assessment method based on big data
CN104167092B (en) A kind of method determining center, on-board and off-board hot spot region of hiring a car and device
CN103198104B (en) A kind of public transport station OD acquisition methods based on city intelligent public transit system
CN103218672B (en) A kind of taxi based on gps data lattice statistical cruises behavior analysis method
US8554473B2 (en) Energy efficient routing using an impedance factor
CN103646560B (en) The extracting method in taxi wheelpath experimental knowledge path
CN107016851A (en) The method that a kind of quantitative analysis city built environment influences on road journey time
CN105679009B (en) A kind of call a taxi/order POI commending systems and method excavated based on GPS data from taxi
CN104731963A (en) Grid path recommending method and system based on internet of vehicle
CN104574967A (en) City large-area road network traffic sensing method based on plough satellite
CN108182800B (en) Freight traffic information processing method and equipment
CN104269057B (en) A kind of bayonet socket sensor deployment method based on Floating Car OD data
CN111931998B (en) A method and system for predicting individual travel patterns based on mobile positioning data
CN114298642B (en) A method for extracting OD of truck trips in cities from trajectory data
CN105427001A (en) Optimal route of school bus of regional middle and primary school
CN104282142B (en) Bus station arrangement method based on taxi GPS data
CN108537391A (en) A kind of taxi bus stop setting optimization method based on taxi track data
CN110222884B (en) Station reachability evaluation method based on POI data and passenger flow volume
CN103942952B (en) A kind of road network functional hierarchy state grade appraisal procedure
CN109118770A (en) A kind of road section capacity method for digging based on Traffic monitoring data
CN107590766A (en) A kind of method of discrimination of the land used combination form related to road traffic accident risk
CN110750573A (en) Traffic jam evolution rule identification method based on gridding and space-time clustering
CN110264719A (en) A kind of motor vehicle Dynamic OD Matrix Estimation method based on multi-source data
CN118863302A (en) Multi-scale carbon emission reduction estimation of shared bicycles and its key factor identification methods, equipment and media

Legal Events

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