Lei Guan

Dr. Lei Guan


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
26 December 2020 in International Journal of Production Research
Verified
Journal Article
Closed access
LGLei Guan
Lei Guan
JPJun Pei
Jun Pei
XLXinbao Liu
Xinbao Liu
ZZZhiping Zhou
Zhiping Zhou
PPPanos M. Pardalos
Panos M. Pardalos
The daily home-office commute of millions of people in crowded cities strains air quality and increases travel time, which motivates the generation of ridesharing. Ridesharing offers many benefits, such as reducing travel costs, congestion, and pollution. Commuter ridesharing is an important theme of urban transportation. This paper studies a ridesharing problem aiming at enlarging the ridesharing market at a limited cost, which enlighten the decision-making problem in city logistics. We establish a novel multi-objective optimisation model based on cumulative prospect theory (CPT) to address the preferred travel mode of commuters. The commuters’ perceived value influences their choice of travel mode. Meanwhile, the perceived value changes with the commuters’ experience of travel mode choice. We give the NP-hardness proof of the ridesharing scheduling problem and develop a heuristic algorithm to solve it in a small-scale scenario. For large-scale problems, a hybrid VNS-NSGAII algorithm combining variable neighbourhood search (VNS) with NSGAII (Non-dominated Sorting Genetic Algorithm II) is proposed to generate an approximate optimal Pareto front. A series of computational experiments are conducted to demonstrate the effectiveness and efficiency of the proposed algorithm based on the actual traffic data in Beijing, China.

30 May 2023 in Transportation Research Record: Journal of the Transportation Research Board
Verified
Journal Article
Closed access
LGLei Guan
Lei Guan
WWWei Wang
Wei Wang
Company commuter bus service (CCBS) is a convenient commuting mode provided for employees. which has always been popular because of its flexible route planning and low cost. Some companies offer CCBS to their employees for free. However, there are also some companies that need employees to pay the fare for CCBS. For fee-based CCBS, profit is an important consideration. Appropriate stop setting and route programming can attract more commuters and generate greater profits. This paper studies the stop selection and route planning for CCBS considering uncertain demand and travel time. In the data preparation phase, we propose an improved fuzzy c-means clustering to obtain appropriate clusters of commuters’ addresses. In the solution phase, we designed a collaborative framework for stop selection and route programming with the objective to maximize the profit of CCBS. A novel heuristic stochastic dynamic programming (H-SDP) method is then designed for the stop selection sub-problem considering the uncertainties of both traveling time and commuting demand. Meanwhile, we employ a variable neighborhood search algorithm with a novel shaking operation suitable for the routing problem. Finally, we conduct a series of computational experiments to demonstrate the effectiveness and efficiency of the developed algorithms.

1 November 2019
Verified
Conference Paper
Closed access
Haili WuHaili Wu
Haili Wu
LGLei Guan
Lei Guan
Regarding the problem of estimating the location of leakage source in the process of gas leakage of hazardous chemicals, this research proposed a traceability algorithm based on ellipse fitting and centroid trajectory. Firstly, the diffusion of hazardous chemicals gas leakage was simulated based on Gaussian Puff Model in the specific circumstances at different time. Secondly, according to the elliptical distribution of the isoconcentration lines, the centroids of isoconcentration lines at each time were determined by fitting lines using least square method. Then, the linear regression was applied to fit these centroids to get the backtracking line. In addition, because of the characteristic that the centroids of these leakage isoconcentration lines satisfied the linear relationship in the time series, the fast determination of the leakage source point was figured out on the backtracking line, then the specific location of leakage source was found. Taking H 2 S leakage and diffusion under different wind directions as examples, the results showed that the algorithm is relatively fast, easy to calculate with high precision and accuracy. And it can analyze and fit the backtracking line of leakage with fewer data points to predict the location of the leakage source quickly. This research provides the technical support for emergency decision- making of hazardous chemicals gas leakage, also provides theoretical basis for initial values selection of genetic algorithm, ant colony algorithm and other related leakage backtracking algorithms.