SearcharxivSearch

arXiv subjects

Andres Fielbaum

Publications and source records attributed to Andres Fielbaum.

6 recordsLinked to original sources

Analytical modeling of a stop-less modular bus line: Optimization, feasibility, and economies of scale

Conventional bus services often struggle with inefficiencies including prolonged dwell times at heavily used stops, especially for through passengers. A stop-less autonomous modular bus service (SLAM) has been proposed to reduce dwell times by decoupling the front pod to serve stops and then coupling it to the next bus. However, the optimal service design and feasibility region remain underexplored, despite their importance for planning and deployment. We propose an analytical optimization model that characterizes the optimal design, feasibility conditions, and sources of scale economies. Three novel constraints distinguish SLAM from conventional bus services: (i) a minimum headway to ensure sufficient time for decoupling, alighting, boarding, and coupling operations, (ii) a maximum headway to guarantee all passengers arriving within a headway fit in the standby pod, and (iii) a minimum bus length constraint, requiring at least two pods per bus to run in a SLAM manner. As ridership grows, the optimal design evolves through several regimes, in which headway constraints alternate between slack and binding states, while capacity constraints shift from one active form to another. Our analysis indicates that, compared with conventional services, SLAM is most suitable at intermediate demand levels: at low demand, the fixed costs of standby pods and the minimum two-pod configuration outweigh the time-saving benefits, whereas at high demand, non-stopping operation becomes infeasible. We further decompose the sources of scale economies into four components: the Mohring effect, through-capacity economies, boarding-capacity economies, and standby-pod costs, identifying under which conditions each of them is present. The numerical results validate the theoretical analysis.

eess.SY

Fleet Sizing for the Flash Delivery Problem from Multiple Depots a Case Study in Amsterdam

In this paper, we present a novel approach for fleet sizing in the context of flash delivery, a time-sensitive delivery service that requires the fulfilment of customer requests in minutes. Our approach effectively combines individual delivery requests into groups and generates optimized operational plans that can be executed by a single vehicle or autonomous robot. The groups are formed using a modified routing approach for the flash delivery problem. Combining the groups into operational plans is done by solving an integer linear problem. To evaluate the effectiveness of our approach, we compare it against three alternative methods: fixed vehicle routing, non-pooled deliveries and a strategy encouraging the pooling of requests. The results demonstrate the value of our proposed approach, showcasing its ability to optimize the fleet and improve operational efficiency. Our experimental analysis is based on a real-world dataset provided by a Dutch retailer, allowing us to gain valuable insights into the design of flash delivery operations and to analyze the effect of the maximum allowed delay, the number of stores to pick up goods from and the employed cost functions.

cs.MA

Pooled Grocery Delivery with Tight Deadlines from Multiple Depots

We study routing for on-demand last-mile logistics with two crucial novel features: i) Multiple depots, optimizing where to pick-up every order, ii) Allowing vehicles to perform depot returns prior to being empty, thus adapting their routes to include new orders online. Both features result in shorter distances and more agile planning. We propose a scalable dynamic method to deliver orders as fast as possible. Following a rolling horizon approach, each time step the following is executed. First, define potential pick-up locations and identify which groups of orders can be transported together, with which vehicle and following which route. Then, decide which of these potential groups of orders will be executed and by which vehicle by solving an integer linear program. We simulate one day of service in Amsterdam that considers 10,000 requests, compare results to several strategies and test different scenarios. Results underpin the advantages of the proposed method

cs.MA

New sources of economies and diseconomies of scale in on-demand ridepooling systems and comparison with public transport

On-demand ridepooling (ODRP) can become a powerful alternative to reduce congestion and emissions, if it attracts private car users. Therefore, it is crucial to identify the strategic phenomena that determine when ODRP systems can run efficiently. In this paper, we analyze the performance of an ODRP system, in which the fleet of low-capacity vehicles is endogenously adapted to the demand, and operated in a zone covered by a single transit line. The routing of the on-demand fleet follows some of the rules of public transport systems; namely, it is not-for-profit, some users can be required to walk, and all requests must be served. Considering both users' and operators' costs we identify two sources of scale economies: when demand grows, the average cost is reduced due to a) an equivalent of the Mohring Effect (also present in public transport), and b) due to matching users with more similar routes when they are assigned to the vehicles, which we call Better-matching Effect. A counter-balance force, called Flex-route Effect, is observed when the vehicle loads increase and users face longer detours. We find a specific demand range in which the latter effect dominates the others, imposing diseconomies of scale when only users' costs are considered. Such a phenomenon emerges because the routes are not fixed; hence, it is not observed in traditional public transport systems. However, when considering both users' and operators' costs, scale economies prevail. Our simulations show that relaxing door-to-door vehicle requirements to allow short walks is crucial for the performance of ODRP. In fact, we observe that an ODRP system with human-driven vehicles and walks allowed has a total cost at a similar level to that of a door-to-door ODRP system with driverless vehicles.

physics.soc-ph

Anticipatory routing methods for an on-demand ridepooling mobility system

One of the most relevant challenges regarding on-demand ridepooling relates to the spatial imbalances of the demand, which induce a mismatch between the position of the vehicles and the origins of the emerging requests. Most ridepooling models face this problem through rebalancing methods only, i.e., moving idle vehicles towards areas with high rejections rate, which is done independently from routing and vehicle-to-orders assignments, so that vehicles serving passengers (a large portion of the total fleet) remain unaffected. This paper introduces two types of techniques for anticipatory routing that affect how vehicles are assigned to users and how to route vehicles to serve such users, so that the whole operation of the system is modified to reach more efficient states for future requests. Both techniques do not require any assumption or exogenous knowledge about the future demand, as they depend only on current and recent requests. Firstly, we introduce rewards that reduce the cost of an assignment between a vehicle and a group of passengers if the vehicle gets routed towards a high-demand zone. Secondly, we include a small set of artificial requests, whose request times are in the near future and whose origins are sampled from a probability distribution that mimics observed generation rates. These artificial requests are to be assigned together with the real requests. We test these techniques using a set of real rides from Manhattan. Introducing rewards can diminish the rejection rate to about nine-tenths of its original value. On the other hand, including future requests can reduce users' traveling times by about one-fifth, but increasing rejections. Both methods increase the vehicles-hour-traveled by about 10%. Spatial analysis reveals that vehicles are indeed moved towards the most demanded areas, such that the reduction in rejections rate is achieved mostly there.

eess.SY

How to split the costs among travellers sharing a ride? Aligning system's optimum with users' equilibrium

How to form groups in a mobility system that offers shared rides, and how to split the costs within the travellers of a group, are non-trivial tasks, as two objectives conflict: 1) minimising the total costs of the system, and 2) making each user content with her assignment. Aligning both objectives is challenging, as users are not aware of the externalities induced to the rest of the system. In this paper, we propose protocols to share the costs within a ride so that optimal solutions can also constitute equilibria. To do this, we model the situation as a game. We show that the traditional notions of equilibrium in game theory (Nash and Strong) are not useful here, and prove that determining whether a Strong Equilibrium exists is an NP-Complete problem. Hence, we propose three alternative equilibrium notions (stronger than Nash and weaker than Strong), depending on how users can coordinate, that effectively represent stable ways to match the users. We then propose three cost-sharing protocols, for which the optimal solutions are an equilibrium for each of the mentioned intermediate notions of equilibrium. The game we study can be seen as a game-version of the well-known \textit{set cover problem}. Numerical simulations for Amsterdam reveal that our protocols can achieve stable solutions that are always close to the optimum, that there exists a trade-off between total users' costs and how equal do they distribute among them, and that having a central coordinator can have a large impact.

cs.GT