Jun Luo

Jun Luo

Auto-generated profile, based on publicly available information

Jun Luo

Logistics and Supply Chain MultiTech R&D Centre, Hong Kong, China

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2011 in International Journal of Computational Geometry & Applications
Verified
Journal Article
Open access
PDF file
KBKevin Buchin
Kevin Buchin
MBMaike Buchin
Maike Buchin
JGJoachim Gudmundsson
Joachim Gudmundsson
MLMaarten Löffler
Maarten Löffler
JLJun Luo
Jun Luo
In this paper we consider the problem of detecting commuting patterns in a trajectory. For this we search for similar subtrajectories. To measure spatial similarity we choose the Fréchet distance and the discrete Fréchet distance between subtrajectories, which are invariant under differences in speed. We give several approximation algorithms, and also show that the problem of finding the 'longest' subtrajectory cluster is as hard as MaxClique to compute and approximate.

1 April 2015
Verified
Conference Paper
Closed access
YLYanhua Li
Yanhua Li
JLJun Luo
Jun Luo
CCChi-Yin Chow
Chi-Yin Chow
KCKam-Lam Chan
Kam-Lam Chan
YDYe Ding
Ye Ding
FZFan Zhang
Fan Zhang
Electric vehicles (EVs) have undergone an explosive increase over recent years, due to the unparalleled advantages over gasoline cars in green transportation and cost efficiency. Such a drastic increase drives a growing need for widely deployed publicly accessible charging stations. Thus, how to strategically deploy the charging stations and charging points becomes an emerging and challenging question to urban planners and electric utility companies. In this paper, by analyzing a large scale electric taxi trajectory data, we make the first attempt to investigate this problem. We develop an optimal charging station deployment (OCSD) framework that takes the historical EV taxi trajectory data, road map data, and existing charging station information as input, and performs optimal charging station placement (OCSP) and optimal charging point assignment (OCPA). The OCSP and OCPA optimization components are designed to minimize the average time to the nearest charging station, and the average waiting time for an available charging point, respectively. To evaluate the performance of our OCSD framework, we conduct experiments on one-month real EV taxi trajectory data. The evaluation results demonstrate that our OCSD framework can achieve a 26%-94% reduction rate on average time to find a charging station, and up to two orders of magnitude reduction on waiting time before charging, over baseline methods. Moreover, our results reveal interesting insights in answering the question: “Super or small stations?”: When the number of deployable charging points is sufficiently large, more small stations are preferred; and when there are relatively few charging points to deploy, super stations is a wiser choice.

1 January 2014 in Transportation Research Record: Journal of the Transportation Research Board
Verified
Journal Article
Closed access
YJYuxuan Ji
Yuxuan Ji
JLJun Luo
Jun Luo
NGNikolas Geroliminis
Nikolas Geroliminis
Research on congestion propagation in large urban networks has been based mainly on microsimulations of link-level traffic dynamics. However, both the unpredictability of travel behavior and the complexity of accurate physical modeling present challenges, and simulation results may be time-consuming and unrealistic. This paper explores empirical data from large-scale urban networks to identify hidden information in the process of congestion formation. Specifically, the spatiotemporal relation of congested links is studied, congestion propagation is observed from a macroscopic perspective, and critical congestion regimes are identified to aid in the design of peripheral control strategies. To achieve these goals, the maximum connected component of congested links is used to capture congestion propagation in the city. A data set of 20,000 taxis with global positioning system (GPS) data from Shenzhen, China, is used. Empirical macroscopic fundamental diagrams of congested regions observed during propagation are presented, and the critical congestion regimes are quantified. The findings show that the proposed methodology can effectively distinguish congestion pockets from the rest of the network and efficiently track congestion evolution in linear time 0(n).

1 November 2011 in Computational Geometry
Verified
Journal Article
Closed access
KBKevin Buchin
Kevin Buchin
MBMaike Buchin
Maike Buchin
MKMarc van Kreveld
Marc van Kreveld
JLJun Luo
Jun Luo

1 December 2016
Verified
Conference Paper
Closed access
CLChen Liu
Chen Liu
KDKe Deng
Ke Deng
Chaojie LiChaojie Li
Chaojie Li
Jianxin LiJianxin Li
Jianxin Li
YLYanhua Li
Yanhua Li
JLJun Luo
Jun Luo
It has been estimated that the cumulative sales of Electric Vehicles (EVs) will be up to 5.9 million and the stock of EVs will be up to 20 million by 2020 [1]. As the number of EVs is expanding, there is a growing need for widely distributed, publicly accessible, EV charging facilities. The public EV Chargers (EVCs) are expected to be found and will be needed where there is on-street parking, at taxi stands, in parking lots at places of employment, hotels, airports, shopping centres, convenience shops, fast food restaurants, and coffee houses, etc. In this work, we aim to optimize the distribution of public EVCs across the city such that (i) the overall revenue generated by the EVCs is maximized, subject to (ii) the overall driver discomfort (e.g., queueing time) for EV charging is minimized. This is the first study on EVC distribution where EVCs are assumed to be installed in almost all regions across a city. The problem is formulated using a bilevel optimization model. We propose an alternating framework to solve it and have proved that a local minima is achievable. Moreover, this work introduces novel methods to extract information to understand the discomfort of petroleum car drivers, EV charging demands, parking time and parking fees across the city. The source data explored include the trajectories of taxis, the distribution of petroleum stations and various local features. The empirical study uses the real data sets from Shenzhen City, one of the largest cities in China. The extensive tests verify the superiority of the proposed bilevel optimization model in all aspects.

23 November 2020 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
XZXin Zhang
Xin Zhang
YLYanhua Li
Yanhua Li
XZXun Zhou
Xun Zhou
JLJun Luo
Jun Luo
Smart passenger-seeking strategies employed by taxi drivers contribute not only to drivers’ incomes, but also higher quality of service passengers received. Therefore, understanding taxi drivers’ behaviors and learning the good passenger-seeking strategies are crucial to boost taxi drivers’ well-being and public transportation quality of service. However, we observe that drivers’ preferences of choosing which area to find the next passenger are diverse and dynamic across locations and drivers. It is hard to learn the location-dependent preferences given the partial data (i.e., an individual driver's trajectory may not cover all locations). In this paper, we make the first attempt to develop conditional generative adversarial imitation learning (cGAIL) model, as a unifying collective inverse reinforcement learning framework that learns the driver's decision-making preferences and policies by transferring knowledge across taxi driver agents and across locations. Our evaluation results on three months of taxi GPS trajectory data in Shenzhen, China, demonstrate that the driver's preferences and policies learned from cGAIL are on average 34.7% more accurate than those learned from other state-of-the-art baseline approaches.