Techniques, applications, and practices for analyzing the data generated from diverse source to gain business value.
This is a team project for selecting the optimal location and route for air-taxi in Seoul.
Team members and Roles
- Seokjun Kang : Preprocess OD data and make algorithm to find the routes
- Suho Lee : Build a data analysis process and Modeling
- Junseok Jeon : Preprocess & make algorithm to find the routes
- Jihwan Hwang : Preprocess data & Visulation
-
The first goal of this project is to recommend ideal locations for air taxi stations upon the introduction of such a service, aiming to identify the most optimal stops.
-
Then, the second goal is to devise an efficient routing plan between these chosen locations, providing paths that minimize travel distance for passengers.
-
As urban populations soar and the demand for efficient transportation intensifies, the current infrastructure struggles to keep pace, leading to exacerbated traffic congestion. The challenge is to innovate beyond the saturated capacity of roads and traditional public transit systems. Air taxis emerge as a prospective solution to these problems, offering an alternative mode of transportation that utilizes the underused airspace above cities.
-
The primary challenge is to identify strategic locations for air taxi stations that harmonize with urban layouts, optimize accessibility, and ensure maximum coverage with minimal disruption to existing city regulations. The second challenge involves developing an effective network to connect these stations, providing passengers with direct and efficient travel routes.
-
Location Identification: The first objective is to identify and recommend ideal locations for air taxi stations within urban areas. This involves analyzing and selecting the optimal spots for the air taxi service, taking into account social factors such as population density and the number of businesses. The focus is on ensuring these stations are easily accessible and provide extensive coverage throughout the city.
-
Routing Plan Development: The second goal is to develop an efficient routing plan between these identified stations. This plan aims to outline the most effective paths that minimize travel distance and time for passengers, enhancing the overall efficiency of the air taxi service.
-
Optimal Station Locations: This project will provide a comprehensive list of optimal locations for air taxi stations that are in harmony with the city's social and structural characteristics. Carefully selected based on important social factors such as population density and business concentration, these locations will offer extensive coverage and easy accessibility throughout the city, while minimizing the impact on the urban environment and complying with local regulations. This is expected to significantly enhance the efficiency and accessibility of the air taxi service.
-
Efficient Travel Routes: A detailed routing plan that connects these stations. This plan should facilitate quick, direct, and efficient travel for passengers, significantly reducing the travel time compared to current transportation options.
Data sources: The data was obtained only through public datasets and open APIs.
Time: The scope of the data has been limited to the Seoul area so that the project can be processed for a month.
-
OD dataset
국가교통DB - 수도권 주수단 OD 데이터(서울 통행량 데이터 활용) -
Population Density & Number of Company
서울열린데이터광장 - 서울시 인구밀도 (동별) 통계
서울시 사업체현황 통계 -
Seoul subway & bus
산림빅테이터거래소 - 지하철 역 정보(위치)
서울시열린데이터광장 - 서울시 버스정류소 위치정보
서울시열린데이터광장 - 서울시 버스노선별 정류장별 승하차 인원 정보 -
Seoul geographic data
국가공간정보포털 - (도로명주소)도로구간
국가공간정보포털 - 하천경계 -
Google Map API and Kakao Map API
- Metadata provided by the data source allows you to grasp the context of the data.
- Statistics and simple plots (distribution, scatter, and box plot) were used to analyze the data.
- From the OD data, it could be identified by the distribution plot that traffic in only a few regions during commuting time is significantly higher than that in most other regions.
- The information required from the original dataset was selected and combined.
- A new table was created combining the morning and afternoon peak time tables of OD data, and a new column was created combining the traffic volume columns of several ways of transportation.
- For visualization, the administrative district(dong) and coordinate information were matched with the API of the map services.
- Since it deals with spatial data, visualization was taken into consideration to easily grasp information. Visualization was required in all other processes, not only in the preprocessing.
- Python's Folium, Pydeck, etc libraries was used.
- Arc visualization of OD data - Top 1000 traffic by buses at AM peak time in Seoul(origin: red / destination: green)

- Visualization with dark colors on Dongs having the high-level values of the features - Top 10 Dongs with income level, population density, and number of companies in Seoul

K-means Clustering is a distance-based clustering algorithm for dividing data into K clusters. K-means Clustering assumes that data in the same cluster have similar features and data in different clusters have opposite features. In other words, it not only considers clustering within the same cluster, but also considers the relationship with other clusters. K-means clustering is simple, fast, and performs well.
It is sensitive to outliers. K-means Clustering is sensitive to outliers. In particular, if an outlier is selected as the centroid, it can lead to strange clustering results, so apply the model after preprocessing using StandardScaler.
-
In progress, using three features(Income level, # of companies, population density), we did clustering. However, it is meaningless since just ranking those features might be more efficient. Thus, we found knee points for # of companies, population density and transportation_total. Sum all of those top instances, then we proceed to do k-means clustering
When selecting a specific block within a cluster, the accessibility of each block was considered. The accessibility index was calculated by summing the distance-based supply amounts for each cluster using the Hansen estimation method. The selected blocks from the 6 clusters are as follows:
- Gasan-dong, Geumcheon-gu
- Gileum 1(il)-dong, Seongbuk-gu
- Gil-dong, Gangdong-gu
- Jongno 1(il).2(i).3(sam).4(sa)-ga-dong, Jongno-gu
- Gayang 1(il)-dong, Gangseo-gu
- Yeoksam 1(il)-dong, Gangnam-gu
Public transportation stops within the representative candidate "dong" selected by clusters are set as candidate sites for Air taxi location, and then the priority of Air taxi location of the candidate sites is finally derived by considering the connection with other transportation methods.
- Integration of Seoul public transportation (bus, subway) stop location information
- Collect data on bus stops in Seoul
- Collect subway station data in Seoul
- Merge bus stop and subway station data
- Finally, use the respective latitude and longitude coordinate data and administrative building information of the area (using Google Map API, Kakao API)
- Calculate the number of other stops within 300 meters of each public transportation stop
- Why 300m? Because the plane distance cannot exceed 300m when setting up a transfer center. Therefore, the maximum possible transfer distance between public transportation and air taxi is set to 300m. (According to the Road Traffic Administration Rules)
- Prioritize Air taxi stops for representative candidate "dong" in each cluster
- Data of 6 candidate "dong", one per cluster
- Data on the number of other stops within 300 meters of each public transportation stop
- Merge the two datasets.
Candidate "dong" selection criteria
- The number of subway stations within a 300m radius of each stop location is prioritized.
- If the number of subway stations is the same, the number of bus stops within a 300m radius is the final prioritization.
- Set the constraints(P-73, noise issue)
- No-fly Zone: P-73 (2023) - 3.704km radius of War Memorial of Korea in Yongsan, Seoul
- Altitude and Noise Issue: Road and river shp data in Seoul
- Cost all paths according to each constraint.
- H3 (Hexagonal hierarchical geospatial indexing system) fills the entire area of Seoul.
- Hexagons intersecting wide roads and passing through rivers have high costs.
- Find the path where cost between the two stations is minimized.(Dijkstra Algorithm)
- Targets: 6 Hexagons containing the 6 selected station locations at the previous step
- Nodes: All Hexagons
- Edges: Each hexagon’s straight path to neighbor hexagons
- Costs: costs in Hexagons
- This project has successfully pinpointed six prime locations for air taxi stations, strategically situated near major transit points to facilitate easy access and connectivity. By leveraging a hexagonal zoning approach in Seoul and employing Dijkstra's algorithm for economical pathfinding, we've optimized air taxi routes for maximum efficiency. This initiative is poised to significantly bolster the integration with existing public transportation networks, alleviate road traffic congestion, and play a pivotal role in establishing a robust air taxi system in Seoul, with far-reaching economic benefits.




