In this paper, we propose a multi-criteria route recommendation framework that considers real-time spatial–temporal predictions and traffic network information, aiming to optimize a taxi driver’s profit when considering an advance reservation. Our framework consists of four components. First, we build a grid-based road network graph for modelling traffic network information during the search process. Next, we conduct two prediction modules that adopt advanced deep learning techniques to guide proper search directions in the final planning stage. One module, taxi demand prediction, is used to estimate the pick-up probabilities of passengers in the city. Another one is destination prediction, which can predict the distribution of drop-off probabilities and capture the flow of potential passengers. Finally, we propose J* (J-star) algorithm, which jointly considers pick-up probabilities, drop-off distribution, road network, distance, and time factors based on the attentive heuristic function. Compared with existing route planning methods, the experimental results on a real-world dataset have shown our proposed approach is more effective and robust. Moreover, our designed search scheme in J* can decrease the computing time and make the search process more efficient. To the best of our knowledge, this is the first work that focuses on designing a guiding route, which can increase the income of taxi drivers when they have an advance reservation.
3 March 2022 in ACM Transactions on Intelligent Systems and Technology
Hybrid computational intelligent systems that synergize learning-based inference models and route planning strategies have thrived in recent years. In this article, we focus on the non-monotonicity originated from heterogeneous urban data, as well as heuristics based on neural networks, and thereafter formulate the traveling transporter problem (TTP). TTP is a multi-criteria optimization problem and may be applied to the circular route deployment in public transportation. In particular, TTP aims to find an optimized route that maximizes passenger flow according to a neural-network-based inference model and minimizes the length of the route given several constraints, including must-visit stations and the requirement for additional ones. As a variation of the traveling salesman problem (TSP), we propose a framework that first recommends new stations’ location while considering the herding effect between stations, and thereafter combines state-of-the-art TSP solvers and a metaheuristic named Trembling Hand , which is inspired by self-efficacy for solving TTP. Precisely, the proposed Trembling Hand enhances the spatial exploration considering the structural patterns, previous actions, and aging factors. Evaluation conducted on two real-world mass transit systems, Tainan and Chicago, shows that the proposed framework can outperform other state-of-the-art methods by securing the Pareto-optimal toward the objectives of TTP among comparative methods under various constrained settings.
Research on flourishing public bike-sharing systems has been widely discussed in recent years. In these studies, many existing works focus on accurately predicting individual stations in a short time. This work, therefore, aims to predict long-term bike rental/drop-off demands at given bike station locations in the expansion areas. The real-world bike stations are mainly built-in batches for expansion areas. To address the problem, we propose LDA (Long-Term Demand Advisor), a framework to estimate the long-term characteristics of newly established stations. In LDA, several engineering strategies are proposed to extract discriminative and representative features for long-term demands. Moreover, for original and newly established stations, we propose several feature extraction methods and an algorithm to model the correlations between urban dynamics and long-term demands. Our work is the first to address the long-term demand of new stations, providing the government with a tool to pre-evaluate the bike flow of new stations before deployment; this can avoid wasting resources such as personnel expense or budget. We evaluate real-world data from New York City’s bike-sharing system, and show that our LDA framework outperforms baseline approaches.
Multicriteria route planning is a crucial transportation planning issue under the field of GIS-based multicriteria decision analysis (GIS-MCDA) with broad applications. A searching algorithm is proposed to solve the multicriteria route planning problem with spatial urban information and constraints such an existing transit network in operation, certain vertices to be visited in the path, total number of vertices been visited, and length or range for the path. Evaluation of two in-operation mass-transit systems from Chicago and Tainan show that our method can retrieve solutions in a Pareto-optimal sense over comparative methods between profit under queried constraints (the expected passenger flow to be maximized, referring to the social welfare for the public) and cost for construction as well as maintenance (the cost of route to be minimized, referring to the sustainability for the government) with reasonable runtime over comparative methods.
Locating undiscovered deposits of critical minerals requires accurate geological data. However, most of the 100,000 historical geological maps of the United States Geological Survey (USGS) are in raster format. This hinders critical mineral assessment. We target the problem of extracting geological features represented as polygons from raster maps. We exploit the polygon metadata that provides information on the geological features, such as the map keys indicating how the polygon features are represented, to extract the features. We present a metadata-driven machine-learning approach that encodes the raster map and map key into a series of bitmaps and uses a convolutional model to learn to recognize the polygon features. We evaluated our approach on USGS geological maps; our approach achieves a median F1 score of 0.809 and outperforms state-of-the-art methods by 4.52%.