Michele D. Simoni
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Michele D. Simoni has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
Christian G. Claudel
Department of Civil, Architectural, and Environmental Engineering, University of Texas, Austin, Texas 78712
5 shared publications- Adam J. Pel
Delft University of Technology
1 shared publication - Bin Ran
Department of Modern Urban Traffic Technologies and Urban Intelligent Transportation Systems, Southeast University, Nanjing 211189, China
1 shared publication - Christian Claudel
The University of Texas at Austin
1 shared publication Edoardo Marcucci
University of Roma Tre
1 shared publicationErhan Kutanoglu
1 shared publication
Latest Publications
- Open Access
- 24 November 2025
- Published by Elsevier in Computers, Environment and Urban Systems
- Vol. 124
Leveraging sidewalk robots for walkability-related analyses
- 24 November 2025
- Published by Elsevier in Computers, Environment and Urban Systems
- Vol. 124
Open AccessLeveraging sidewalk robots for walkability-related analyses
- Open Access
- 23 August 2025
- Published by Elsevier in Case Studies on Transport Policy
- Vol. 22
Impact of exogenous events on the demand for on-demand ridepooling in Hamburg
- 23 August 2025
- Published by Elsevier in Case Studies on Transport Policy
- Vol. 22
Open AccessImpact of exogenous events on the demand for on-demand ridepooling in Hamburg
- 15 April 2024
- Published by Elsevier in Transportation Research Part A: Policy and Practice
- Vol. 183
Urban network geofencing with dynamic speed limit policy via deep reinforcement learning
- 15 April 2024
- Published by Elsevier in Transportation Research Part A: Policy and Practice
- Vol. 183
Urban network geofencing with dynamic speed limit policy via deep reinforcement learning
- Open Access
- 5 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (8) , 9091-9102
Parking Guidance and Geofencing for Last-Mile Delivery Operations
The current shortage of road and parking capacity to accommodate freight traffic poses a significant challenge in cities. This study develops and analyzes alternative traffic management strategies for last-mile delivery operations. Three alternative implementations of parking guidance involving allocating commercial vehicles to dedicated loading/unloading bays are investigated alongside a vehicle-specific geofence strategy. Methodologically, an agent-based model framework is employed to reproduce the interactions among (parking and cruising) carriers, the surrounding traffic, and a traffic controller. An efficient metaheuristic is integrated with simulation to address the corresponding optimization. The effectiveness of the strategies in reducing traffic congestion and other externalities varies depending on the level and configuration of freight demand. Among the parking guidance strategies, those weighing more on carriers’ convenience mitigate potential risks of equity and acceptability issues but at the cost of an efficiency loss. Geofencing is less problematic due to the minor operational modifications, offering comparable traffic performance improvement for low and medium demand levels.
- 5 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Intelligent Transportation Systems
- Vol. 25 (8) , 9091-9102
Open AccessParking Guidance and Geofencing for Last-Mile Delivery Operations
The current shortage of road and parking capacity to accommodate freight traffic poses a significant challenge in cities. This study develops and analyzes alternative traffic management strategies for last-mile delivery operations. Three alternative implementations of parking guidance involving allocating commercial vehicles to dedicated loading/unloading bays are investigated alongside a vehicle-specific geofence strategy. Methodologically, an agent-based model framework is employed to reproduce the interactions among (parking and cruising) carriers, the surrounding traffic, and a traffic controller. An efficient metaheuristic is integrated with simulation to address the corresponding optimization. The effectiveness of the strategies in reducing traffic congestion and other externalities varies depending on the level and configuration of freight demand. Among the parking guidance strategies, those weighing more on carriers’ convenience mitigate potential risks of equity and acceptability issues but at the cost of an efficiency loss. Geofencing is less problematic due to the minor operational modifications, offering comparable traffic performance improvement for low and medium demand levels.
- Open Access
Surrogate-based Real-time Curbside Management for Ride-hailing and Delivery Operations
The present work investigates surrogate model-based optimization for real-time curbside traffic management operations. An optimization problem is formulated to minimize the congestion on roadway segments caused by vehicles stopping on the segment (e.g., ride-hailing or delivery operations) and implemented in a model predictive control framework. A hybrid simulation approach where main traffic flows interact with individually modeled stopping vehicles is adopted. Due to its non-linearity, the optimization problem is coupled with a meta-heuristic. However, because simulations are time expensive and hence unsuitable for real-time control, a trained surrogate model that takes the decision variables as inputs and approximates the objective function is employed to replace the simulation within the meta-heuristic algorithm. Several modeling techniques (i.e., linear regression, polynomial regression, neural network, radial basis network, regression tree ensemble, and Gaussian process regression) are compared based on their accuracy in reproducing solutions to the problem and computational tractability for real-time control under different configurations of simulation parameters. It is found that Gaussian process regression is the most suited for use as a surrogate model for the given problem. Finally, a realistic application with multiple ride-hailing vehicle operations is presented. The proposed approach for controlling the stop positions of vehicles is able to achieve an improvement of 20.65% over the uncontrolled case. The example shows the potential of the proposed approach in reducing the negative impacts of stopping vehicles and favorable computational properties.
Open AccessSurrogate-based Real-time Curbside Management for Ride-hailing and Delivery Operations
The present work investigates surrogate model-based optimization for real-time curbside traffic management operations. An optimization problem is formulated to minimize the congestion on roadway segments caused by vehicles stopping on the segment (e.g., ride-hailing or delivery operations) and implemented in a model predictive control framework. A hybrid simulation approach where main traffic flows interact with individually modeled stopping vehicles is adopted. Due to its non-linearity, the optimization problem is coupled with a meta-heuristic. However, because simulations are time expensive and hence unsuitable for real-time control, a trained surrogate model that takes the decision variables as inputs and approximates the objective function is employed to replace the simulation within the meta-heuristic algorithm. Several modeling techniques (i.e., linear regression, polynomial regression, neural network, radial basis network, regression tree ensemble, and Gaussian process regression) are compared based on their accuracy in reproducing solutions to the problem and computational tractability for real-time control under different configurations of simulation parameters. It is found that Gaussian process regression is the most suited for use as a surrogate model for the given problem. Finally, a realistic application with multiple ride-hailing vehicle operations is presented. The proposed approach for controlling the stop positions of vehicles is able to achieve an improvement of 20.65% over the uncontrolled case. The example shows the potential of the proposed approach in reducing the negative impacts of stopping vehicles and favorable computational properties.
- Top Cited PapersOpen Access
- 16 February 2023
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 149
Crowdsourced on-demand food delivery: An order batching and assignment algorithm
- 16 February 2023
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 149
Top Cited PapersOpen AccessCrowdsourced on-demand food delivery: An order batching and assignment algorithm
- 1 November 2020
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 54 (6) , 1516-1534
A Fast Lax–Hopf Algorithm to Solve the Lighthill–Whitham–Richards Traffic Flow Model on Networks
Efficient and exact algorithms are important for performing fast and accurate traffic network simulations with macroscopic traffic models. In this paper, we extend the semianalytical Lax–Hopf algorithm in order to compute link inflows and outflows with the Lighthill–Whitham–Richards (LWR) model. Our proposed fast Lax–Hopf algorithm has a very low computational complexity. We demonstrate that some of the original algorithm’s operations (associated with the initial conditions) can be discarded, leading to a faster computation of boundary demands/supplies in network simulation problems for general concave fundamental diagrams (FDs). Moreover, the computational cost can be further reduced for triangular FDs and specific space–time discretizations. The resulting formulation has a performance comparable to the link transmission model and because it solves the original LWR model for a wide range of FD shapes, with any initial configuration, it is suitable to solve a broad range of traffic operations problems. As part of the analysis, we compare the performance of the proposed scheme with that of other well-known computational methods.
- 1 November 2020
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Transportation Science
- Vol. 54 (6) , 1516-1534
A Fast Lax–Hopf Algorithm to Solve the Lighthill–Whitham–Richards Traffic Flow Model on Networks
Efficient and exact algorithms are important for performing fast and accurate traffic network simulations with macroscopic traffic models. In this paper, we extend the semianalytical Lax–Hopf algorithm in order to compute link inflows and outflows with the Lighthill–Whitham–Richards (LWR) model. Our proposed fast Lax–Hopf algorithm has a very low computational complexity. We demonstrate that some of the original algorithm’s operations (associated with the initial conditions) can be discarded, leading to a faster computation of boundary demands/supplies in network simulation problems for general concave fundamental diagrams (FDs). Moreover, the computational cost can be further reduced for triangular FDs and specific space–time discretizations. The resulting formulation has a performance comparable to the link transmission model and because it solves the original LWR model for a wide range of FD shapes, with any initial configuration, it is suitable to solve a broad range of traffic operations problems. As part of the analysis, we compare the performance of the proposed scheme with that of other well-known computational methods.
- 8 July 2019
- Published by Springer Nature in Transportation
- Vol. 47 (4) , 1933-1954
Potential last-mile impacts of crowdshipping services: a simulation-based evaluation
- 8 July 2019
- Published by Springer Nature in Transportation
- Vol. 47 (4) , 1933-1954
Potential last-mile impacts of crowdshipping services: a simulation-based evaluation
- Top Cited Papers
- 1 January 2019
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 98, 167-185
Congestion pricing in a world of self-driving vehicles: An analysis of different strategies in alternative future scenarios
- 1 January 2019
- Published by Elsevier in Transportation Research Part C: Emerging Technologies
- Vol. 98, 167-185
Top Cited PapersCongestion pricing in a world of self-driving vehicles: An analysis of different strategies in alternative future scenarios
- Open Access
Congestion Pricing in a World of Self-driving vehicles: an Analysis of Different Strategies in Alternative Future Scenarios
The introduction of autonomous (self-driving) and shared autonomous vehicles (AVs and SAVs) will affect travel destinations and distances, mode choice, and congestion. From a traffic perspective, although some congestion reduction may be achieved (thanks to fewer crashes and tighter headways), car-trip frequencies and vehicle miles traveled (VMT) are likely to rise significantly, reducing the benefits of driverless vehicles. Congestion pricing (CP) and road tolls are key tools for moderating demand and incentivizing more socially and environmentally optimal travel choices. This work develops multiple CP and tolling strategies in alternative future scenarios, and investigates their effects on the Austin, Texas network conditions and traveler welfare, using the agent-based simulation model MATSim. Results suggest that, while all pricing strategies reduce congestion, their social welfare impacts differ in meaningful ways. More complex and advanced strategies perform better in terms of traffic conditions and traveler welfare, depending on the development of the mobility landscape of autonomous driving. The possibility to refund users by reinvesting toll revenues as traveler budgets plays a salient role in the overall efficiency of each CP strategy as well as in the public acceptability.
Open AccessCongestion Pricing in a World of Self-driving vehicles: an Analysis of Different Strategies in Alternative Future Scenarios
The introduction of autonomous (self-driving) and shared autonomous vehicles (AVs and SAVs) will affect travel destinations and distances, mode choice, and congestion. From a traffic perspective, although some congestion reduction may be achieved (thanks to fewer crashes and tighter headways), car-trip frequencies and vehicle miles traveled (VMT) are likely to rise significantly, reducing the benefits of driverless vehicles. Congestion pricing (CP) and road tolls are key tools for moderating demand and incentivizing more socially and environmentally optimal travel choices. This work develops multiple CP and tolling strategies in alternative future scenarios, and investigates their effects on the Austin, Texas network conditions and traveler welfare, using the agent-based simulation model MATSim. Results suggest that, while all pricing strategies reduce congestion, their social welfare impacts differ in meaningful ways. More complex and advanced strategies perform better in terms of traffic conditions and traveler welfare, depending on the development of the mobility landscape of autonomous driving. The possibility to refund users by reinvesting toll revenues as traveler budgets plays a salient role in the overall efficiency of each CP strategy as well as in the public acceptability.