4.7 Article

A probabilistic map matching method for smartphone GPS data

出版社

PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.trc.2012.08.001

关键词

GPS data; Probabilistic map matching; Path observation generation; Network-free data; Route choice modeling

资金

  1. Swiss National Science Foundation [200021/131998]
  2. Swiss National Science Foundation (SNF) [200021_131998] Funding Source: Swiss National Science Foundation (SNF)

向作者/读者索取更多资源

Smartphones have the capability of recording various kinds of data from built-in sensors such as GPS in a non-intrusive, systematic way. In transportation studies, such as route choice modeling, the discrete sequences of GPS data need to be associated with the transportation network to generate meaningful paths. The poor quality of GPS data collected from smartphones precludes the use of state of the art map matching methods. In this paper, we propose a probabilistic map matching approach. It generates a set of potential true paths, and associates a likelihood with each of them. Both spatial (GPS coordinates) and temporal information (speed and time) is used to calculate the likelihood of the data for a specific path. Applications and analyses on real trips illustrate the robustness and effectiveness of the proposed approach. Also, as an application example, a Path-Size Logit model is estimated based on a sample of real observations. The estimation results show the viability of applying the proposed method in a real route choice modeling context. (C) 2012 Elsevier Ltd. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

Article Engineering, Civil

Design and analysis of control strategies for pedestrian flows

Nicholas Molyneaux, Riccardo Scarinci, Michel Bierlaire

Summary: This paper investigates how to improve the level-of-service experienced by pedestrians by regulating and controlling their movements with a dynamic traffic management system, and emphasizes the lack of attention in literature to dynamic traffic management systems for pedestrian flows.

TRANSPORTATION (2021)

Article Economics

Integrating advanced discrete choice models in mixed integer linear optimization

Meritxell Pacheco Paneque, Michel Bierlaire, Bernard Gendron, Shadi Sharif Azadeh

Summary: The study highlights the mismatch between design and planning decisions and demand in transportation systems, emphasizing the importance of allowing for interactions between the two. Discrete choice models (DCM) provide a way to capture the impact of decisions on user behavior, but the non-linear and non-convex nature of demand expressions derived from DCM restricts their integration in optimization problems.

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2021)

Article Economics

Vessel scheduling with pilotage and tugging considerations

Omar Abou Kasm, Ali Diabat, Michel Bierlaire

Summary: This paper addresses the vessel scheduling problem with pilotage and tugging constraints at seaports. A mixed integer programming formulation and an exact solution approach are proposed to solve the problem. The proposed model is compared with the traditional first-come first-serve policy in vessel scheduling, showing significant improvements during congestion periods. Computational study demonstrates the capability of the proposed solution approach in solving real-size cases in a reasonable time.

TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW (2021)

Article Engineering, Civil

Price-based regulation of oligopolistic markets under discrete choice models of demand

Stefano Bortolomiol, Virginie Lurkin, Michel Bierlaire

Summary: The study proposes a framework for finding optimal price-based policies in markets with oligopolistic competition. It models consumers as utility maximizers using random utility theory, while suppliers are modeled as profit maximizers. Market competition is modeled as a non-cooperative game, and the regulator can influence behavior through subsidies or taxes.

TRANSPORTATION (2022)

Article Operations Research & Management Science

A Simulation-Based Heuristic to Find Approximate Equilibria with Disaggregate Demand Models

Stefano Bortolomiol, Virginie Lurkin, Michel Bierlaire

Summary: This paper introduces a framework to find approximate equilibrium solutions of oligopolistic markets in transportation, utilizing discrete choice models and algorithmic approach. The methodology successfully approximates equilibrium solutions for transportation case studies featuring complex models and heterogeneous demand.

TRANSPORTATION SCIENCE (2021)

Article Economics

Assisted specification of discrete choice models

Nicola Ortelli, Tim Hillel, Francisco C. Pereira, Matthieu de Lapparent, Michel Bierlaire

Summary: Determining appropriate utility specifications for discrete choice models is time-consuming and prone to errors due to exponential growth in possible specifications with the number of variables. This paper proposes an algorithm that translates the task into a multi-objective combinatorial optimization problem and uses a variant of the variable neighborhood search algorithm to generate promising model specifications. The algorithm proves to effectively assist modelers in developing interpretable and powerful models by providing relevant insights in reasonable amounts of time.

JOURNAL OF CHOICE MODELLING (2021)

Article Transportation Science & Technology

Are commuter air taxis coming to your city? A ranking of 40 cities in the United States

Julien Haan, Laurie A. Garrow, Aude Marzuoli, Satadru Roy, Michel Bierlaire

Summary: This study calculates the air taxi commuter demand for the 40 most populous combined statistical areas (CSAs) in the U.S. using cell phone data, census data, and a mode choice model. The demand is concentrated in a few CSAs, with New York City, Los Angeles, and Washington, D.C. generating 33 percent of the overall air taxi demand.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2021)

Article Transportation Science & Technology

Passenger-centric timetable rescheduling: A user equilibrium approach

S. Binder, M. Y. Maknoon, Sh Sharif Azadeh, M. Bierlaire

Summary: This study presents a passenger-centric approach for timetable rescheduling in case of railway disruptions, using a multi-objective algorithm to find high-quality solutions efficiently on Swiss and Dutch railway networks.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2021)

Article Economics

Evaluating the predictive abilities of mixed logit models with unobserved inter- and intra-individual heterogeneity

Rico Krueger, Michel Bierlaire, Ricardo A. Daziano, Taha H. Rashidi, Prateek Bansal

Summary: The study evaluates the ability of mixed logit models with unobserved inter-and intra-individual heterogeneity to accurately predict individual choice behavior. Results show that these models do not significantly improve choice prediction accuracy over standard mixed logit models, even in scenarios with high levels of intra-individual taste variation. Additionally, estimation of mixed logit with unobserved heterogeneity requires significantly more computation time than standard mixed logit.

JOURNAL OF CHOICE MODELLING (2021)

Article Engineering, Civil

Bayesian Automatic Relevance Determination for Utility Function Specification in Discrete Choice Models

Filipe Rodrigues, Nicola Ortelli, Michel Bierlaire, Francisco Camara Pereira

Summary: This paper introduces a method that utilizes the Bayesian framework and automatic relevance determination to automatically determine the optimal utility function specification from a large amount of data. Experimental results show that the proposed method can accurately recover the true specifications and discover high-quality specifications in real choice data.

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS (2022)

Article Economics

Capturing trade-offs between daily scheduling choices

Janody Pougala, Tim Hillel, Michel Bierlaire

Summary: This paper proposes a new modeling approach for daily activity scheduling, integrating different dimensions of scheduling choices into a single optimization problem. By capturing the trade-offs between scheduling decisions for multiple activities, the proposed framework can generate complex and realistic distributions of starting time and duration for different activities.

JOURNAL OF CHOICE MODELLING (2022)

Article Economics

Choice-driven dial-a-ride problem for demand responsive mobility service

Sh. Sharif Azadeh, Bilge Atasoy, Moshe E. Ben-Akiva, M. Bierlaire, M. Y. Maknoon

Summary: This paper introduces a new mathematical model called a choice-driven dial-a-ride problem (CD-DARP) for operational planning of urban mobility services. By integrating with choice models and assortment optimization, a solution is proposed that outperforms dynamic DARP in efficiently reducing routing costs and improving the number of customers served.

TRANSPORTATION RESEARCH PART B-METHODOLOGICAL (2022)

Article Computer Science, Interdisciplinary Applications

A Lagrangian decomposition scheme for choice-based optimization

Meritxell Pacheco Paneque, Bernard Gendron, Shadi Sharif Azadeh, Michel Bierlaire

Summary: This paper proposes a novel Lagrangian decomposition method for solving choice-based optimization problems. By generating upper and lower bounds for the original problem and calculating the duality gap, the quality of the solutions can be assessed. Experimental results show that the decomposition method provides high-quality solutions within short computational times.

COMPUTERS & OPERATIONS RESEARCH (2022)

Proceedings Paper Computer Science, Artificial Intelligence

A chance-constraint approach for optimizing Social Engagement-based services

Michel Bierlaire, Edoardo Fadda, Lohic Fotio Tiotsop, Daniele Manerba

Summary: Social engagement is a business model that transforms service users into active participants. By modeling the behavior of contacted candidates and using concepts from utility theory, a chance-constrained optimization model is proposed to minimize costs. The proposed solution approach and its computational efficiency are investigated through experiments.

PROCEEDINGS OF THE 2022 17TH CONFERENCE ON COMPUTER SCIENCE AND INTELLIGENCE SYSTEMS (FEDCSIS) (2022)

Review Operations Research & Management Science

Vehicle sharing systems: A review and a holistic management framework

Selin Atac, Nikola Obrenovic, Michel Bierlaire

Summary: Despite using different vehicle types, different vehicle sharing systems face similar management challenges and optimization problems; a generalized and holistic VSS management framework has been created to be applicable to any vehicle type; framework components, their relationships, and tasks have been identified through systematic literature review, identifying gaps and research avenues.

EURO JOURNAL ON TRANSPORTATION AND LOGISTICS (2021)

Article Transportation Science & Technology

3-Strategy evolutionary game model for operation extensions of subway networks

Yue Zhao, Liujiang Kang, Huijun Sun, Jianjun Wu, Nsabimana Buhigiro

Summary: This study proposes a 2-population 3-strategy evolutionary game model to address the issue of subway network operation extension. The analysis reveals that the rule of maximum total fitness ensures the priority of evolutionary equilibrium strategies, and proper adjustment minutes can enhance the effectiveness of operation extension.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2024)

Article Transportation Science & Technology

Integrated optimization of container allocation and yard cranes dispatched under delayed transshipment

Hongtao Hu, Jiao Mob, Lu Zhen

Summary: This study investigates the challenges of daily storage yard management in marine container terminals considering delayed transshipment of containers. A mixed-integer linear programming model is proposed to minimize various costs associated with transportation and yard management. The improved Benders decomposition algorithm is applied to solve the problem effectively and efficiently.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2024)

Article Transportation Science & Technology

Range-constrained traffic assignment for electric vehicles under heterogeneous range anxiety

Zhandong Xu, Yiyang Peng, Guoyuan Li, Anthony Chen, Xiaobo Liu

Summary: This paper studied the impact of range anxiety among electric vehicle drivers on traffic assignment. Two types of range-constrained traffic assignment problems were defined based on discrete or continuous distributed range anxiety. Models and algorithms were proposed to solve the two types of problems. Experimental results showed the superiority of the proposed algorithm and revealed that drivers with heightened range anxiety may cause severe congestion.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2024)

Article Transportation Science & Technology

Demand forecasting and predictability identification of ride-sourcing via bidirectional spatial-temporal transformer neural processes

Chuanjia Li, Maosi Geng, Yong Chen, Zeen Cai, Zheng Zhu, Xiqun (Michael) Chen

Summary: Understanding spatial-temporal stochasticity in shared mobility is crucial, and this study introduces the Bi-STTNP prediction model that provides probabilistic predictions and uncertainty estimations for ride-sourcing demand, outperforming conventional deep learning methods. The model captures the multivariate spatial-temporal Gaussian distribution of demand and offers comprehensive uncertainty representations.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2024)

Article Transportation Science & Technology

Partial trajectory method to align and validate successive video cameras for vehicle tracking

Benjamin Coifman, Lizhe Li

Summary: This paper develops a partial trajectory method for aligning views from successive fixed cameras in order to ensure high fidelity with the actual vehicle movements. The method operates on the output of vehicle tracking to provide direct feedback and improve alignment quality. Experimental results show that this method can enhance accuracy and increase the number of vehicles in the dataset.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2024)

Article Transportation Science & Technology

Dynamic routing for the Electric Vehicle Shortest Path Problem with charging station occupancy information

Mohsen Dastpak, Fausto Errico, Ola Jabali, Federico Malucelli

Summary: This article discusses the problem of an Electric Vehicle (EV) finding the shortest route from an origin to a destination and proposes a problem model that considers the occupancy indicator information of charging stations. A Markov Decision Process formulation is presented to optimize the EV routing and charging policy. A reoptimization algorithm is developed to establish the sequence of charging station visits and charging amounts based on system updates. Results from a comprehensive computational study show that the proposed method significantly reduces waiting times and total trip duration.

TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2024)