No Arabic abstract
Public-transit systems face a number of operational challenges: (a) changing ridership patterns requiring optimization of fixed line services, (b) optimizing vehicle-to-trip assignments to reduce maintenance and operation codes, and (c) ensuring equitable and fair coverage to areas with low ridership. Optimizing these objectives presents a hard computational problem due to the size and complexity of the decision space. State-of-the-art methods formulate these problems as variants of the vehicle routing problem and use data-driven heuristics for optimizing the procedures. However, the evaluation and training of these algorithms require large datasets that provide realistic coverage of various operational uncertainties. This paper presents a dynamic simulation platform, called Transit-Gym, that can bridge this gap by providing the ability to simulate scenarios, focusing on variation of demand models, variations of route networks, and variations of vehicle-to-trip assignments. The central contribution of this work is a domain-specific language and associated experimentation tool-chain and infrastructure to enable subject-matter experts to intuitively specify, simulate, and analyze large-scale transit scenarios and their parametric variations. Of particular significance is an integrated microscopic energy consumption model that also helps to analyze the energy cost of various transit decisions made by the transportation agency of a city.
The outbreak of coronavirus disease 2019 (COVID-19) has led to significant challenges for schools, workplaces and communities to return to operations during the pandemic, while policymakers need to balance between individuals safety and operational efficiency. In this paper, we present a mixed-integer programming model for redesigning routes and bus schedules for the University of Michigan (UM)s campus bus system, to prepare for students return in the 2020 Fall semester. To ensure less than 15-minute travel time for all routes and to enforce social distancing among passengers, we propose a hub-and-spoke design and utilize real data of student activities to identify hub locations and reduce the number of bus stops used in the new routes. The new bus routes, although using only 50% or even fewer seats in each bus, can still satisfy peak-hour demand in regular semesters at UM. We sample a variety of scenarios that cover variations of peak demand, social-distancing requirements, broken-down buses or no-shows of drivers, to demonstrate the system resiliency of the new routes and schedules via simulation. Our approach can be generalized to redesign public transit systems with social distancing requirement during the pandemic, to reduce passengers infection risk.
The performance of multimodal mobility systems relies on the seamless integration of conventional mass transit services and the advent of Mobility-on-Demand (MoD) services. Prior work is limited to individually improving various transport networks operations or linking a new mode to an existing system. In this work, we attempt to solve transit network design and pricing problems of multimodal mobility systems en masse. An operator (public transit agency or private transit operator) determines the frequency settings of the mass transit system, flows of the MoD service, and prices for each trip to optimize the overall welfare. A primal-dual approach, inspired by the market design literature, yields a compact mixed integer linear programming (MILP) formulation. However, a key computational challenge remains in allocating an exponential number of hybrid modes accessible to travelers. We provide a tractable solution approach through a decomposition scheme and approximation algorithm that accelerates the computation and enables optimization of large-scale problem instances. Using a case study in Nashville, Tennessee, we demonstrate the value of the proposed model. We also show that our algorithm reduces the average runtime by 60% compared to advanced MILP solvers. This result seeks to establish a generic and simple-to-implement way of revamping and redesigning regional mobility systems in order to meet the increase in travel demand and integrate traditional fixed-line mass transit systems with new demand-responsive services.
Despite their potential of increasing operational efficiency, transparency, and safety, the use of Localization and Tracking Systems (LTSs) in warehouse environments remains seldom. One reason is the lack of market transparency and stakeholders trust in the systems performance as a consequence of poor use of Test and Evaluation (T&E) methods and transferability of the obtained T&E results. The T&E 4Log (Test and Evaluation for Logistics) Framework was developed to examine how the transferability of T&E results to practical scenarios in warehouse environments can be increased. Conventional T&E approaches are integrated and extended under consideration of the warehouse environment, logistics applications, and domain-specific requirements, into an application-driven T&E framework. The application of the proposed framework in standard and application-dependent test cases leads to a set of performance criteria and corresponding application-specific requirements. This enables a well-founded identification of suitable LTSs for given warehouse applications. The T&E 4Log Framework was implemented at the Institute for Technical Logistics (ITL) and validated by T&E of a reflector-based Light Detection and Ranging (LiDAR) LTS, a contour-based LiDAR LTS, and an Ultra-Wideband (UWB) LTS for the exemplary applications Automated Pallet Booking, Goods Tracking, and Autonomous Forklift Navigation.
The design of provably correct controllers for continuous-state stochastic systems crucially depends on approximate finite-state abstractions and their accuracy quantification. For this quantification, one generally uses approximate stochastic simulation relations, whose constant precision limits the achievable guarantees on the control design. This limitation especially affects higher dimensional stochastic systems and complex formal specifications. This work allows for variable precision by defining a simulation relation that contains multiple precision layers. For bi-layered simulation relations, we develop a robust dynamic programming approach yielding a lower bound on the satisfaction probability of temporal logic specifications. We illustrate the benefit of bi-layered simulation relations for linear stochastic systems in an example.
The vulnerability of artificial intelligence (AI) and machine learning (ML) against adversarial disturbances and attacks significantly restricts their applicability in safety-critical systems including cyber-physical systems (CPS) equipped with neural network components at various stages of sensing and control. This paper addresses the reachable set estimation and safety verification problems for dynamical systems embedded with neural network components serving as feedback controllers. The closed-loop system can be abstracted in the form of a continuous-time sampled-data system under the control of a neural network controller. First, a novel reachable set computation method in adaptation to simulations generated out of neural networks is developed. The reachability analysis of a class of feedforward neural networks called multilayer perceptrons (MLP) with general activation functions is performed in the framework of interval arithmetic. Then, in combination with reachability methods developed for various dynamical system classes modeled by ordinary differential equations, a recursive algorithm is developed for over-approximating the reachable set of the closed-loop system. The safety verification for neural network control systems can be performed by examining the emptiness of the intersection between the over-approximation of reachable sets and unsafe sets. The effectiveness of the proposed approach has been validated with evaluations on a robotic arm model and an adaptive cruise control system.