Searcharxiv⌕ Search

arXiv subjects

Andrea Araldo

Publications and source records attributed to Andrea Araldo.

At least 37 records · Page 2Linked to original sources

Public Transport Network Design for Equality of Accessibility via Message Passing Neural Networks and Reinforcement Learning

Designing Public Transport (PT) networks able to satisfy mobility needs of people is essential to reduce the number of individual vehicles on the road, and thus pollution and congestion. Urban sustainability is thus tightly coupled to an efficient PT. Current approaches on Transport Network Design (TND) generally aim to optimize generalized cost, i.e., a unique number including operator and users' costs. Since we intend quality of PT as the capability of satisfying mobility needs, we focus instead on PT accessibility, i.e., the ease of reaching surrounding points of interest via PT. PT accessibility is generally unequally distributed in urban regions: suburbs generally suffer from poor PT accessibility, which condemns residents therein to be dependent on their private cars. We thus tackle the problem of designing bus lines so as to minimize the inequality in the geographical distribution of accessibility. We combine state-of-the-art Message Passing Neural Networks (MPNN) and Reinforcement Learning. We show the efficacy of our method against metaheuristics (classically used in TND) in a use case representing in simplified terms the city of Montreal.

cs.AI↗

Joint Design of Conventional Public Transport Network and Mobility on Demand

Conventional Public Transport (PT) is based on fixed lines, running with routes and schedules determined a-priori. In low-demand areas, conventional PT is inefficient. Therein, Mobility on Demand (MoD) could serve users more efficiently and with an improved quality of service (QoS). The idea of integrating MoD into PT is therefore abundantly discussed by researchers and practitioners, mainly in the form of adding MoD on top of PT. Efficiency can be instead gained if also conventional PT lines are redesigned after integrating MoD in the first or last mile. In this paper we focus on this re-design problem. We devise a bilevel optimization problem where, given a certain initial design, the upper level determines stop selection and frequency settings, while the lower level routes a fleet of MoD vehicles. We propose a solution method based on Particle Swarm Optimization (PSO) for the upper level, while we adopt Large Neighborhood Search (LNS) in the lower level. Our solution method is computationally efficient and we test it in simulations with up to 10k travel requests. Results show important operational cost savings obtained via appropriately reducing the conventional PT coverage after integrating MoD, while preserving QoS.

eess.SY↗

Can Edge Computing fulfill the requirements of automated vehicular services using 5G network ?

Communication and computation services supporting Connected and Automated Vehicles (CAVs) are characterized by stringent requirements, in terms of response time and reliability. Fulfilling these requirements is crucial for ensuring road safety and traffic optimization. The conceptually simple solution of hosting these services in the vehicles increases their cost (mainly due to the installation and maintenance of computation infrastructure) and may drain their battery excessively. Such disadvantages can be tackled via Multi-Access Edge Computing (MEC), consisting in deploying computation capability in network nodes deployed close to the devices (vehicles in this case), such as to satisfy the stringent CAV requirements. However, it is not yet clear under which conditions MEC can support CAV requirements and for which services. To shed light on this question, we conduct a simulation campaign using well-known open-source simulation tools, namely OMNeT++, Simu5G, Veins, INET, and SUMO. We are thus able to provide a reality check on MEC for CAV, pinpointing what are the computation capacities that must be installed in the MEC, to support the different services, and the amount of vehicles that a single MEC node can support. We find that such parameters must vary a lot, depending on the service considered. This study can serve as a preliminary basis for network operators to plan future deployment of MEC to support CAV.

cs.NI↗

Personalised incentives with constrained regulator's budget

We consider a regulator driving individual choices towards increasing social welfare by providing personal incentives. We formalise and solve this problem by maximising social welfare under a budget constraint. The personalised incentives depend on the alternatives available to each individual and on her preferences. A polynomial time approximation algorithm computes a policy within few seconds. We analytically prove that it is boundedly close to the optimum. We efficiently calculate the curve of social welfare achievable for each value of budget within a given range. This curve can be useful for the regulator to decide the appropriate amount of budget to invest. We extend our formulation to enforcement, taxation and non-personalised-incentive policies. We analytically show that our personalised-incentive policy is also optimal within this class of policies and construct close-to-optimal enforcement and proportional tax-subsidy policies. We then compare analytically and numerically our policy with other state-of-the-art policies. Finally, we simulate a large-scale application to mode choice to reduce CO2 emissions.

econ.GN↗

AccEq-DRT: Planning Demand-Responsive Transit to reduce inequality of accessibility

Accessibility measures how well a location is connected to surrounding opportunities. We focus on accessibility provided by Public Transit (PT). There is an evident inequality in the distribution of accessibility between city centers or close to main transportation corridors and suburbs. In the latter, poor PT service leads to a chronic car-dependency. Demand-Responsive Transit (DRT) is better suited for low-density areas than conventional fixed-route PT. However, its potential to tackle accessibility inequality has not yet been exploited. On the contrary, planning DRT without care to inequality (as in the methods proposed so far) can further improve the accessibility gap in urban areas. To the best of our knowledge this paper is the first to propose a DRT planning strategy, which we call AccEq-DRT, aimed at reducing accessibility inequality, while ensuring overall efficiency. To this aim, we combine a graph representation of conventional PT and a Continuous Approximation (CA) model of DRT. The two are combined in the same multi-layer graph, on which we compute accessibility. We then devise a scoring function to estimate the need of each area for an improvement, appropriately weighting population density and accessibility. Finally, we provide a bilevel optimization method, where the upper level is a heuristic to allocate DRT buses, guided by the scoring function, and the lower level performs traffic assignment. Numerical results in a simplified model of Montreal show that inequality, measured with the Atkinson index, is reduced by up to 34\%. Keywords: DRT Public, Transportation, Accessibility, Continuous Approximation, Network Design

math.OC↗

On the Computation of Accessibility Provided by Shared Mobility

Shared Mobility Services (SMS), e.g., Demand-Responsive Transit (DRT) or ride-sharing, can improve mobility in low-density areas, often poorly served by conventional Public Transport (PT). Such improvement is mostly quantified via basic performance indicators, like wait or travel time. However, accessibility indicators, measuring the ease of reaching surrounding opportunities (e.g., jobs, schools, shops, ...), would be a more comprehensive indicator. To date, no method exists to quantify the accessibility of SMS based on empirical measurements. Indeed, accessibility is generally computed on graph representations of PT networks, but SMS are dynamic and do not follow a predefined network. We propose a spatial-temporal statistical method that takes as input observed trips of a SMS acting as a feeder for PT and summarized such trips in a graph. On such a graph, we compute classic accessibility indicators. We apply our method to a MATSim simulation study concerning DRT in Paris-Saclay.

cs.CY↗

Multiple Resource Allocation in Multi-Tenant Edge Computing via Sub-modular Optimization

Edge Computing (EC) allows users to access computing resources at the network frontier, which paves the way for deploying delay-sensitive applications such as Mobile Augmented Reality (MAR). Under the EC paradigm, MAR users connect to the EC server, open sessions and send continuously frames to be processed. The EC server sends back virtual information to enhance the human perception of the world by merging it with the real environment. Resource allocation arises as a critical challenge when several MAR Service Providers (SPs) compete for limited resources at the edge of the network. In this paper, we consider EC in a multi-tenant environment where the resource owner, i.e., the Network Operator (NO), virtualizes the resources and lets SPs run their services using the allocated slice of resources. Indeed, for MAR applications, we focus on two specific resources: CPU and RAM, deployed in some edge node, e.g., a central office. We study the decision of the NO about how to partition these resources among several SPs. We model the arrival and service dynamics of users belonging to different SPs using Erlang queuing model and show that under perfect information, the interaction between the NO and SPs can be formulated as a sub-modular maximization problem under multiple Knapsack constraints. To solve the problem, we use an approximation algorithm, guaranteeing a bounded gap with respect to the optimal theoretical solution. Our numerical results show that the proposed algorithm outperforms baseline proportional allocation in terms of the number of sessions accommodated at the edge for each SP.

cs.DC↗

Adaptive Transit Design: Optimizing Fixed and Demand Responsive Multi-Modal Transportation via Continuous Approximation

In most cities, transit consists solely of fixed-route transportation, whence the inherent limited Quality of Service for travellers in suburban areas and during off-peak periods. On the other hand, completely replacing fixed-route (FR) with demand-responsive (DR) transit would imply a huge operational cost. It is still unclear how to integrate DR transportation into current transit systems to take full advantage of it. We propose a Continuous Approximation model of a transit system that gets the best from fixed-route and DR transportation. Our model allows deciding whether to deploy a FR or a DR feeder, in each sub-region of an urban conurbation and each time of day, and to redesign the line frequencies and the stop spacing of the main trunk service. Since such a transit design can adapt to the spatial and temporal variation of the demand, we call it Adaptive Transit. Numerical results show that, with respect to conventional transit, Adaptive Transit significantly improves user-related cost, by drastically reducing access time to the main trunk service. Such benefits are particularly remarkable in the suburbs. Moreover, the generalized cost, including agency and user cost, is also reduced. These findings are also confirmed in scenarios with automated vehicles. Our model can assist in planning future-generation transit systems, able to improve urban mobility by appropriately combining fixed and DR transportation.

econ.GN↗

A graph-database approach to assess the impact of demand-responsive services on public transit accessibility

This paper proposes an approach to analyze the impact of multimodal Public Transit (PT), combining conventional fixed-route transit and Demand-Responsive Transit (DRT), on equality in transport accessibility distribution. We construct a graph model of multimodal PT in Neo4j, based on General Transit Feed Specification (GTFS) data, modeling DRT analytically (using continuous approximation). We quantify service quality on any location using an accessibility measure, indicating how easily other places or opportunities can be reached. We quantify inequality of accessibility distribution. We state the problem of allocating a DRT fleet to minimize inequality and show its NP-completeness. We showcase our approach on the transportation network of the French town of Royan.

physics.soc-ph↗

PoolLines: Modeling Carpooling as Ephemeral Lines in GTFS for effective integration with Public Transit

In carpooling systems, a set of drivers owning a private car can accept a small detour to pick-up and drop-off other riders. However, carpooling is widely used for long-distance trips, where rider-driver matching can be done days ahead. Making carpooling a viable option for daily commute is more challenging, as trips are shorter and, proportionally, the detours tolerated by drivers are more tight. As a consequence, finding riders and drivers sharing close-enough origins, destinations and departure time is less likely, which limits potential matching. In this paper we propose an Integrated System, where carpooling matching is synchronized with Public Transit (PT) schedules, so as to serve as a feeder service to PT in the first mile. Driver detours are proposed towards PT selected stations, which are used as consolidation points, thus increasing matching probability. We present a computationally efficient method to represent PT schedules and drivers trajectory in a single General Transit Feed Specification database, which allows to compute multimodal rider journeys using any off the shelf planners. We showcase our approach in the metropolitan area of Portland, Oregon, considering 8k randomly generated trips. We show the benefits of our Integrated System. We find that 10% more riders find a feasible matching with respect to the status quo, where carpooling and PT are operated separately. We release our code as open source.

cs.OH↗

Large-Scale Allocation of Personalized Incentives

We consider a regulator willing to drive individual choices towards increasing social welfare by providing incentives to a large population of individuals. For that purpose, we formalize and solve the problem of finding an optimal personalized-incentive policy: optimal in the sense that it maximizes social welfare under an incentive budget constraint, personalized in the sense that the incentives proposed depend on the alternatives available to each individual, as well as her preferences. We propose a polynomial time approximation algorithm that computes a policy within few seconds and we analytically prove that it is boundedly close to the optimum. We then extend the problem to efficiently calculate the Maximum Social Welfare Curve, which gives the maximum social welfare achievable for a range of incentive budgets (not just one value). This curve is a valuable practical tool for the regulator to determine the right incentive budget to invest. Finally, we simulate a large-scale application to mode choice in a French department (about 200 thousands individuals) and illustrate the effectiveness of the proposed personalized-incentive policy in reducing CO2 emissions.

econ.EM↗

Equity Scores for Public Transit Lines from Open-Data and Accessibility Measures

Current transit suffers from an evident inequity: the level of service of transit in suburbs is much less satisfying than in city centers. As a consequence, private cars are still the dominant transportation mode for suburban people, which results in congestion and pollution. To achieve sustainability goals and reduce car-dependency, transit should be (re)designed around equity. To this aim, it is necessary to (i) quantify the "level of equity" of the transit system and (ii) provide an indicator that scores the transit lines that contribute the most to keep transit equitable. This indicator could suggest on which lines the transit operator must invest to increase the service level (frequency or coverage) in order to reduce inequity in the system. To the best of our knowledge, this paper is the first to tackle (ii). To this aim, we propose efficient scoring methods that rely solely on open data, which allows us to perform the analysis on multiple cities (7 in this paper). Our method can be used to guide large-scale iterative optimization algorithms to improve accessibility equity.

cs.CY↗

Coalitional Game-Theoretical Approach to Coinvestment with Application to Edge Computing

We propose in this paper a coinvestment plan between several stakeholders of different types, namely a physical network owner, operating network nodes, e.g. a network operator or a tower company, and a set of service providers willing to use these resources to provide services as video streaming, augmented reality, autonomous driving assistance, etc. One such scenario is that of deployment of Edge Computing resources. Indeed, although the latter technology is ready, the high Capital Expenditure (CAPEX) cost of such resources is the barrier to its deployment. For this reason, a solid economical framework to guide the investment and the returns of the stakeholders is key to solve this issue. We formalize the coinvestment framework using coalitional game theory. We provide a solution to calculate how to divide the profits and costs among the stakeholders, taking into account their characteristics: traffic load, revenues, utility function. We prove that it is always possible to form the grand coalition composed of all the stakeholders, by showing that our game is convex. We derive the payoff of the stakeholders using the Shapley value concept, and elaborate on some properties of our game. We show our solution in simulation.

cs.GT↗

Market Design for Tradable Mobility Credits

Tradable mobility credit (TMC) schemes are an approach to travel demand management that have received significant attention in recent years. This paper proposes and analyzes alternative market models for a TMC system -- focusing on market design aspects such as allocation/expiration of tokens, rules governing trading, transaction fees, and regulator intervention -- and develops a methodology to explicitly model the dis-aggregate behavior of individuals within the market. Extensive simulation experiments are conducted within a combined mode and departure time context for the morning commute problem to compare the performance of the alternative designs relative to congestion pricing and a no-control scenario. The simulation experiments employ a day-to-day assignment framework wherein transportation demand is modeled using a logit-mixture model with income effects and supply is modeled using a standard bottleneck model. The results indicate that small fixed transaction fees can effectively mitigate undesirable behavior in the market without a significant loss in efficiency (total welfare) whereas proportional transaction fees are less effective both in terms of efficiency and in avoiding undesirable market behavior. Further, an allocation of tokens in continuous time can be beneficial in dealing with non-recurrent events and avoiding concentrated trading activity. In the presence of income effects, despite small fixed transaction fees, the TMC system yields a marginally higher social welfare than congestion pricing while attaining revenue neutrality. Further, it is more robust in the presence of forecasting errors and non-recurrent events due to the adaptiveness of the market. Finally, as expected, the TMC scheme is more equitable (when revenues from congestion pricing are not redistributed) although it is not guaranteed to be Pareto-improving when tokens are distributed equally.

econ.GN↗

Pooling for First and Last Mile: Integrating Carpooling and Transit

While carpooling is widely adopted for long travels, it is by construction inefficient for daily commuting, where it is difficult to match drivers and riders, sharing similar origin, destination and time. To overcome this limitation, we present an Integrated system, which integrates carpooling into transit, in the line of the philosophy of Mobility as a Service. Carpooling acts as feeder to transit and transit stations act as consolidation points, where trips of riders and drivers meet, increasing potential matching. We present algorithms to construct multimodal rider trips (including transit and carpooling legs) and driver detours. Simulation shows that our Integrated system increases transit ridership and reduces auto-dependency, with respect to current practice, in which carpooling and transit are operated separately. Indeed, the Integrated system decreases the number of riders who are left with no feasible travel option and would thus be forced to use private cars. The simulation code is available as open source.

cs.MA↗

Assessing transportation accessibility equity via open data

We propose a methodology to assess transportation accessibility inequity in metropolitan areas. The methodology is based on the classic analysis tools of Lorenz curves and Gini indices, but the novelty resides in the fact that it can be easily applied in an automated way to several cities around the World, with no need for customized data treatment. Indeed, our equity metrics can be computed solely relying on open data, publicly available in standardized form. We showcase our method and study transp

cs.CY↗

Monkey Business: Reinforcement learning meets neighborhood search for Virtual Network Embedding

In this article, we consider the Virtual Network Embedding (VNE) problem for 5G networks slicing. This problem requires to allocate multiple Virtual Networks (VN) on a substrate virtualized physical network while maximizing among others, resource utilization, maximum number of placed VNs and network operator's benefit. We solve the online version of the problem where slices arrive over time. Inspired by the Nested Rollout Policy Adaptation (NRPA) algorithm, a variant of the well known Monte Carlo Tree Search (MCTS) that learns how to perform good simulations over time, we propose a new algorithm that we call Neighborhood Enhanced Policy Adaptation (NEPA). The key feature of our algorithm is to observe NRPA cannot exploit knowledge acquired in one branch of the state tree for another one which starts differently. NEPA learns by combining NRPA with Neighbordhood Search in a frugal manner which improves only promising solutions while keeping the running time low. We call this technique a monkey business because it comes down to jumping from one interesting branch to the other, similar to how monkeys jump from tree to tree instead of going down everytime. NEPA achieves better results in terms of acceptance ratio and revenue-to-cost ratio compared to other state-of-the-art algorithms, both on real and synthetic topologies.

cs.NI↗

Cache Allocation in Multi-Tenant Edge Computing via online Reinforcement Learning

We consider in this work Edge Computing (EC) in a multi-tenant environment: the resource owner, i.e., the Network Operator (NO), virtualizes the resources and lets third party Service Providers (SPs - tenants) run their services, which can be diverse and with heterogeneous requirements. Due to confidentiality guarantees, the NO cannot observe the nature of the traffic of SPs, which is encrypted. This makes resource allocation decisions challenging, since they must be taken based solely on observed monitoring information. We focus on one specific resource, i.e., cache space, deployed in some edge node, e.g., a base station. We study the decision of the NO about how to partition cache among several SPs in order to minimize the upstream traffic. Our goal is to optimize cache allocation using purely data-driven, model-free Reinforcement Learning (RL). Differently from most applications of RL, in which the decision policy is learned offline on a simulator, we assume no previous knowledge is available to build such a simulator. We thus apply RL in an \emph{online} fashion, i.e., the policy is learned by directly perturbing the actual system and monitoring how its performance changes. Since perturbations generate spurious traffic, we also limit them. We show in simulation that our method rapidly converges toward the theoretical optimum, we study its fairness, its sensitivity to several scenario characteristics and compare it with a method from the state-of-the-art.

cs.DC↗