182 research outputs found

    A dynamic approach to rebalancing bike-sharing systems

    Get PDF
    Bike-sharing services are flourishing in Smart Cities worldwide. They provide a low-cost and environment-friendly transportation alternative and help reduce traffic congestion. However, these new services are still under development, and several challenges need to be solved. A major problem is the management of rebalancing trucks in order to ensure that bikes and stalls in the docking stations are always available when needed, despite the fluctuations in the service demand. In this work, we propose a dynamic rebalancing strategy that exploits historical data to predict the network conditions and promptly act in case of necessity. We use Birth-Death Processes to model the stations' occupancy and decide when to redistribute bikes, and graph theory to select the rebalancing path and the stations involved. We validate the proposed framework on the data provided by New York City's bike-sharing system. The numerical simulations show that a dynamic strategy able to adapt to the fluctuating nature of the network outperforms rebalancing schemes based on a static schedule

    A simulation framework for the design of a station-based bike sharing system

    Full text link
    Many cities and towns offer nowadays to citizens a bike sharing system (BSS). When a company starts the service, several decisions have to be taken on the location and size of the rental stations, and the number of vehicles to use to re-balance the bikes in the stations, in addition to the cost and policies for the payment of the service. Also, when the service is in place, it is often necessary to modify it, in many cases to expand it. In this paper, starting from the experience gained in a real-case application, we present a simulation framework to support the tactical decisions in the design or revision of a BSS. We will also present the application of the framework to the case of Bicimia in Brescia, Italy

    A space-time model for demand in free-floating carsharing systems

    Full text link
    A novel model approach is proposed to estimate the spatiotemporal distribution of demand for free-floating carsharing. The proposed model is based on a Poisson regression model for right-censored data and estimates possibly time-varying demand rates of small subareas of a service region based on booking data with spatiotemporal information on pickups and dropoffs of cars. The approach allows operators to gain insights into the spatiotemporal distribution of demand for their service and to estimate the loss of demand due to unavailability of cars. Moreover, it can also be used as an input to improve the design of the service, through relocation techniques or to analyze the service with macrosimulation models. In addition, the approach is applied to a case study with real data

    Sustainability in passenger transport: the relevance of punctuality in rail and modal choice in commuting

    Get PDF
    The overall purpose of this PhD research is the analysis of the sustainable passenger mobility, both on long and short-distance trips. Mobility plays a central role in the social system and it is a key driving force for socio-economic, global and local development, but it produces also negative externalities on the territory. The thesis has the aim to explain the main elements of sustainable mobility from a theoretical point of view and, successively, to apply these concepts to two empirical cases with the use of Italian real data. These empirical analyses can help in underling the importance of sustainable mobility and of the efforts to improve it, influencing the transport modal choices of the commuter journeys. The first case regards the most sustainable mode of transport for medium-long distance trips, the train, and particularly the problem of delay that strongly affects the performance of the train, influencing the modal choices of commuters. The analysis is based on data collected in the period 2013-2016 on the railway line from Milano to Genoa. The second case concerns medium-short trips, focusing on the issue of home-work commuting of a medium Italian university located in two different cities (Varese and Como) in the north of Italy. The data come from a survey performed in November 2017. Finally, the last chapter draws some conclusions and mentions some upcoming evolutions of mobility that could give a strong contribution in achieving sustainability

    ์‹ค์‹œ๊ฐ„ ๋™์  ๊ณ„ํš๋ฒ• ๋ฐ ๊ฐ•ํ™”ํ•™์Šต ๊ธฐ๋ฐ˜์˜ ๊ณต๊ณต์ž์ „๊ฑฐ ์‹œ์Šคํ…œ์˜ ๋™์  ์žฌ๋ฐฐ์น˜ ์ „๋žต

    Get PDF
    ํ•™์œ„๋…ผ๋ฌธ (๋ฐ•์‚ฌ) -- ์„œ์šธ๋Œ€ํ•™๊ต ๋Œ€ํ•™์› : ๊ณต๊ณผ๋Œ€ํ•™ ๊ฑด์„คํ™˜๊ฒฝ๊ณตํ•™๋ถ€, 2020. 8. ๊ณ ์Šน์˜.The public bicycle sharing system is one of the modes of transportation that can help to relieve several urban problems, such as traffic congestion and air pollution. Because users can pick up and return bicycles anytime and anywhere a station is located, pickup or return failure can occur due to the spatiotemporal imbalances in demand. To prevent system failures, the operator should establish an appropriate repositioning strategy. As the operator makes a decision based on the predicted demand information, the accuracy of forecasting demand is an essential factor. Due to the stochastic nature of demand, however, the occurrence of prediction errors is inevitable. This study develops a stochastic dynamic model that minimizes unmet demand for rebalancing public bicycle sharing systems, taking into account the stochastic demand and the dynamic characteristics of the system. Since the repositioning mechanism corresponds to the sequential decision-making problem, this study applies the Markov decision process to the problem. To solve the Markov decision process, a dynamic programming method, which decomposes complex problems into simple subproblems to derive an exact solution. However, as a set of states and actions of the Markov decision process become more extensive, the computational complexity increases and it is intractable to derive solutions. An approximate dynamic programming method is introduced to derive an approximate solution. Further, a reinforcement learning model is applied to obtain a feasible solution in a large-scale public bicycle network. It is assumed that the predicted demand is derived from the random forest, which is a kind of machine learning technique, and that the observed demand occurred along the Poisson distribution whose mean is the predicted demand to simulate the uncertainty of the future demand. Total unmet demand is used as a key performance indicator in this study. In this study, a repositioning strategy that quickly responds to the prediction error, which means the difference between the observed demand and the predicted demand, is developed and the effectiveness is assessed. Strategies developed in previous studies or applied in the field are also modeled and compared with the results to verify the effectiveness of the strategy. Besides, the effects of various safety buffers and safety stock are examined and appropriate strategies are suggested for each situation. As a result of the analysis, the repositioning effect by the developed strategy was improved compared to the benchmark strategies. In particular, the effect of a strategy focusing on stations with high prediction errors is similar to the effect of a strategy considering all stations, but the computation time can be further reduced. Through this study, the utilization and reliability of the public bicycle system can be improved through the efficient operation without expanding the infrastructure.๊ณต๊ณต์ž์ „๊ฑฐ ์‹œ์Šคํ…œ์€ ๊ตํ†ตํ˜ผ์žก๊ณผ ๋Œ€๊ธฐ์˜ค์—ผ ๋“ฑ ์—ฌ๋Ÿฌ ๋„์‹œ๋ฌธ์ œ๋ฅผ ์™„ํ™”ํ•  ์ˆ˜ ์žˆ๋Š” ๊ตํ†ต์ˆ˜๋‹จ์ด๋‹ค. ๋Œ€์—ฌ์†Œ๊ฐ€ ์œ„์น˜ํ•œ ๊ณณ์ด๋ฉด ์–ธ์ œ ์–ด๋””์„œ๋“  ์ด์šฉ์ž๊ฐ€ ์ž์ „๊ฑฐ๋ฅผ ์ด์šฉํ•  ์ˆ˜ ์žˆ๋Š” ์‹œ์Šคํ…œ์˜ ํŠน์„ฑ์ƒ ์ˆ˜์š”์˜ ์‹œ๊ณต๊ฐ„์  ๋ถˆ๊ท ํ˜•์œผ๋กœ ์ธํ•ด ๋Œ€์—ฌ ์‹คํŒจ ๋˜๋Š” ๋ฐ˜๋‚ฉ ์‹คํŒจ๊ฐ€ ๋ฐœ์ƒํ•œ๋‹ค. ์‹œ์Šคํ…œ ์‹คํŒจ๋ฅผ ์˜ˆ๋ฐฉํ•˜๊ธฐ ์œ„ํ•ด ์šด์˜์ž๋Š” ์ ์ ˆํ•œ ์žฌ๋ฐฐ์น˜ ์ „๋žต์„ ์ˆ˜๋ฆฝํ•ด์•ผ ํ•œ๋‹ค. ์šด์˜์ž๋Š” ์˜ˆ์ธก ์ˆ˜์š” ์ •๋ณด๋ฅผ ์ „์ œ๋กœ ์˜์‚ฌ๊ฒฐ์ •์„ ํ•˜๋ฏ€๋กœ ์ˆ˜์š”์˜ˆ์ธก์˜ ์ •ํ™•์„ฑ์ด ์ค‘์š”ํ•œ ์š”์†Œ์ด๋‚˜, ์ˆ˜์š”์˜ ๋ถˆํ™•์‹ค์„ฑ์œผ๋กœ ์ธํ•ด ์˜ˆ์ธก ์˜ค์ฐจ์˜ ๋ฐœ์ƒ์ด ๋ถˆ๊ฐ€ํ”ผํ•˜๋‹ค. ๋ณธ ์—ฐ๊ตฌ์˜ ๋ชฉ์ ์€ ๊ณต๊ณต์ž์ „๊ฑฐ ์ˆ˜์š”์˜ ๋ถˆํ™•์‹ค์„ฑ๊ณผ ์‹œ์Šคํ…œ์˜ ๋™์  ํŠน์„ฑ์„ ๊ณ ๋ คํ•˜์—ฌ ๋ถˆ๋งŒ์กฑ ์ˆ˜์š”๋ฅผ ์ตœ์†Œํ™”ํ•˜๋Š” ์žฌ๋ฐฐ์น˜ ๋ชจํ˜•์„ ๊ฐœ๋ฐœํ•˜๋Š” ๊ฒƒ์ด๋‹ค. ๊ณต๊ณต์ž์ „๊ฑฐ ์žฌ๋ฐฐ์น˜ ๋ฉ”์ปค๋‹ˆ์ฆ˜์€ ์ˆœ์ฐจ์  ์˜์‚ฌ๊ฒฐ์ • ๋ฌธ์ œ์— ํ•ด๋‹นํ•˜๋ฏ€๋กœ, ๋ณธ ์—ฐ๊ตฌ์—์„œ๋Š” ์ˆœ์ฐจ์  ์˜์‚ฌ๊ฒฐ์ • ๋ฌธ์ œ๋ฅผ ๋ชจํ˜•ํ™”ํ•  ์ˆ˜ ์žˆ๋Š” ๋งˆ๋ฅด์ฝ”ํ”„ ๊ฒฐ์ • ๊ณผ์ •์„ ์ ์šฉํ•œ๋‹ค. ๋งˆ๋ฅด์ฝ”ํ”„ ๊ฒฐ์ • ๊ณผ์ •์„ ํ’€๊ธฐ ์œ„ํ•ด ๋ณต์žกํ•œ ๋ฌธ์ œ๋ฅผ ๊ฐ„๋‹จํ•œ ๋ถ€๋ฌธ์ œ๋กœ ๋ถ„ํ•ดํ•˜์—ฌ ์ •ํ™•ํ•ด๋ฅผ ๋„์ถœํ•˜๋Š” ๋™์  ๊ณ„ํš๋ฒ•์„ ์ด์šฉํ•œ๋‹ค. ํ•˜์ง€๋งŒ ๋งˆ๋ฅด์ฝ”ํ”„ ๊ฒฐ์ • ๊ณผ์ •์˜ ์ƒํƒœ ์ง‘ํ•ฉ๊ณผ ๊ฒฐ์ • ์ง‘ํ•ฉ์˜ ํฌ๊ธฐ๊ฐ€ ์ปค์ง€๋ฉด ๊ณ„์‚ฐ ๋ณต์žก๋„๊ฐ€ ์ฆ๊ฐ€ํ•˜๋ฏ€๋กœ, ๋™์  ๊ณ„ํš๋ฒ•์„ ์ด์šฉํ•œ ์ •ํ™•ํ•ด๋ฅผ ๋„์ถœํ•  ์ˆ˜ ์—†๋‹ค. ์ด๋ฅผ ํ•ด๊ฒฐํ•˜๊ธฐ ์œ„ํ•ด ๊ทผ์‚ฌ์  ๋™์  ๊ณ„ํš๋ฒ•์„ ๋„์ž…ํ•˜์—ฌ ๊ทผ์‚ฌํ•ด๋ฅผ ๋„์ถœํ•˜๋ฉฐ, ๋Œ€๊ทœ๋ชจ ๊ณต๊ณต์ž์ „๊ฑฐ ๋„คํŠธ์›Œํฌ์—์„œ ๊ฐ€๋Šฅํ•ด๋ฅผ ์–ป๊ธฐ ์œ„ํ•ด ๊ฐ•ํ™”ํ•™์Šต ๋ชจํ˜•์„ ์ ์šฉํ•œ๋‹ค. ์žฅ๋ž˜ ๊ณต๊ณต์ž์ „๊ฑฐ ์ด์šฉ์ˆ˜์š”์˜ ๋ถˆํ™•์‹ค์„ฑ์„ ๋ชจ์‚ฌํ•˜๊ธฐ ์œ„ํ•ด, ๊ธฐ๊ณ„ํ•™์Šต ๊ธฐ๋ฒ•์˜ ์ผ์ข…์ธ random forest๋กœ ์˜ˆ์ธก ์ˆ˜์š”๋ฅผ ๋„์ถœํ•˜๊ณ , ์˜ˆ์ธก ์ˆ˜์š”๋ฅผ ํ‰๊ท ์œผ๋กœ ํ•˜๋Š” ํฌ์•„์†ก ๋ถ„ํฌ๋ฅผ ๋”ฐ๋ผ ์ˆ˜์š”๋ฅผ ํ™•๋ฅ ์ ์œผ๋กœ ๋ฐœ์ƒ์‹œ์ผฐ๋‹ค. ๋ณธ ์—ฐ๊ตฌ์—์„œ๋Š” ๊ด€์ธก ์ˆ˜์š”์™€ ์˜ˆ์ธก ์ˆ˜์š” ๊ฐ„์˜ ์ฐจ์ด์ธ ์˜ˆ์ธก์˜ค์ฐจ์— ๋น ๋ฅด๊ฒŒ ๋Œ€์‘ํ•˜๋Š” ์žฌ๋ฐฐ์น˜ ์ „๋žต์„ ๊ฐœ๋ฐœํ•˜๊ณ  ํšจ๊ณผ๋ฅผ ํ‰๊ฐ€ํ•œ๋‹ค. ๊ฐœ๋ฐœ๋œ ์ „๋žต์˜ ์šฐ์ˆ˜์„ฑ์„ ๊ฒ€์ฆํ•˜๊ธฐ ์œ„ํ•ด, ๊ธฐ์กด ์—ฐ๊ตฌ์˜ ์žฌ๋ฐฐ์น˜ ์ „๋žต ๋ฐ ํ˜„์‹ค์—์„œ ์ ์šฉ๋˜๋Š” ์ „๋žต์„ ๋ชจํ˜•ํ™”ํ•˜๊ณ  ๊ฒฐ๊ณผ๋ฅผ ๋น„๊ตํ•œ๋‹ค. ๋˜ํ•œ, ์žฌ๊ณ ๋Ÿ‰์˜ ์•ˆ์ „ ๊ตฌ๊ฐ„ ๋ฐ ์•ˆ์ „์žฌ๊ณ ๋Ÿ‰์— ๊ด€ํ•œ ๋ฏผ๊ฐ๋„ ๋ถ„์„์„ ์ˆ˜ํ–‰ํ•˜์—ฌ ํ•จ์˜์ ์„ ์ œ์‹œํ•œ๋‹ค. ๊ฐœ๋ฐœ๋œ ์ „๋žต์˜ ํšจ๊ณผ๋ฅผ ๋ถ„์„ํ•œ ๊ฒฐ๊ณผ, ๊ธฐ์กด ์—ฐ๊ตฌ์˜ ์ „๋žต ๋ฐ ํ˜„์‹ค์—์„œ ์ ์šฉ๋˜๋Š” ์ „๋žต๋ณด๋‹ค ๊ฐœ์„ ๋œ ์„ฑ๋Šฅ์„ ๋ณด์ด๋ฉฐ, ํŠนํžˆ ์˜ˆ์ธก์˜ค์ฐจ๊ฐ€ ํฐ ๋Œ€์—ฌ์†Œ๋ฅผ ํƒ์ƒ‰ํ•˜๋Š” ์ „๋žต์ด ์ „์ฒด ๋Œ€์—ฌ์†Œ๋ฅผ ํƒ์ƒ‰ํ•˜๋Š” ์ „๋žต๊ณผ ์žฌ๋ฐฐ์น˜ ํšจ๊ณผ๊ฐ€ ์œ ์‚ฌํ•˜๋ฉด์„œ๋„ ๊ณ„์‚ฐ์‹œ๊ฐ„์„ ์ ˆ๊ฐํ•  ์ˆ˜ ์žˆ๋Š” ๊ฒƒ์œผ๋กœ ๋‚˜ํƒ€๋‚ฌ๋‹ค. ๊ณต๊ณต์ž์ „๊ฑฐ ์ธํ”„๋ผ๋ฅผ ํ™•๋Œ€ํ•˜์ง€ ์•Š๊ณ ๋„ ์šด์˜์˜ ํšจ์œจํ™”๋ฅผ ํ†ตํ•ด ๊ณต๊ณต์ž์ „๊ฑฐ ์‹œ์Šคํ…œ์˜ ์ด์šฉ๋ฅ  ๋ฐ ์‹ ๋ขฐ์„ฑ์„ ์ œ๊ณ ํ•  ์ˆ˜ ์žˆ๊ณ , ๊ณต๊ณต์ž์ „๊ฑฐ ์žฌ๋ฐฐ์น˜์— ๊ด€ํ•œ ์ •์ฑ…์  ํ•จ์˜์ ์„ ์ œ์‹œํ•œ๋‹ค๋Š” ์ ์—์„œ ๋ณธ ์—ฐ๊ตฌ์˜ ์˜์˜๊ฐ€ ์žˆ๋‹ค.Chapter 1. Introduction ๏ผ‘ 1.1 Research Background and Purposes ๏ผ‘ 1.2 Research Scope and Procedure ๏ผ— Chapter 2. Literature Review ๏ผ‘๏ผ 2.1 Vehicle Routing Problems ๏ผ‘๏ผ 2.2 Bicycle Repositioning Problem ๏ผ‘๏ผ’ 2.3 Markov Decision Processes ๏ผ’๏ผ“ 2.4 Implications and Contributions ๏ผ’๏ผ– Chapter 3. Model Formulation ๏ผ’๏ผ˜ 3.1 Problem Definition ๏ผ’๏ผ˜ 3.2 Markov Decision Processes ๏ผ“๏ผ” 3.3 Demand Forecasting ๏ผ”๏ผ 3.4 Key Performance Indicator (KPI) ๏ผ”๏ผ• Chapter 4. Solution Algorithms ๏ผ”๏ผ— 4.1 Exact Solution Algorithm ๏ผ”๏ผ— 4.2 Approximate Dynamic Programming ๏ผ•๏ผ 4.3 Reinforcement Learning Method ๏ผ•๏ผ’ Chapter 5. Numerical Example ๏ผ•๏ผ• 5.1 Data Overview ๏ผ•๏ผ• 5.2 Experimental Design ๏ผ–๏ผ‘ 5.3 Algorithm Performance ๏ผ–๏ผ– 5.4 Sensitivity Analysis ๏ผ—๏ผ” 5.5 Large-scale Cases ๏ผ—๏ผ– Chapter 6. Conclusions ๏ผ˜๏ผ’ 6.1 Conclusions ๏ผ˜๏ผ’ 6.2 Future Research ๏ผ˜๏ผ“ References ๏ผ˜๏ผ– ์ดˆ ๋ก ๏ผ™๏ผ’Docto

    Detecting demand outliers in transport systems

    Get PDF
    Optimisation routines used for demand management in transport systems strongly depend on accurate forecasts. Outliers caused by systematic shifts in demand cause erroneous forecasts for both current services and future services whose forecasts are based on historic demand. Transport service providers often rely on analysts to identify outlier demand and make adjustments accordingly. However, previous research on judgemental forecasting shows that such adjustments can be biased and even superfluous. Literature on automated detection and evaluation of outlier demand in this context is scarce. To date, most literature on forecasting and optimisation in transport planning does not account for demand outliers despite the negative impacts it can have. This thesis presents a novel methodology, which combines network clustering with functional data analysis and time series forecasting, to detect outliers in demand for transport systems. This thesis also contributes a simulation framework for evaluating the performance of the proposed outlier detection procedure and for quantifying the effects of outlier demand on different optimisation routines. The use of such a method as a decision support tool for analyst adjusted forecasts, and how the outlier alerts may be best communicated, is also considered. Computational studies highlight the benefits of different adjustments that analysts may take after the identification of outlier demand. Multiple empirical studies will demonstrate how the method can be applied in practice to different types of transport systems, with analyses of Deutsche Bahn railway booking data and Capital Bikeshare usage data

    Sustainability in passenger transport: the relevance of punctuality in rail and modal choice in commuting

    Get PDF
    The overall purpose of this PhD research is the analysis of the sustainable passenger mobility, both on long and short-distance trips. Mobility plays a central role in the social system and it is a key driving force for socio-economic, global and local development, but it produces also negative externalities on the territory. The thesis has the aim to explain the main elements of sustainable mobility from a theoretical point of view and, successively, to apply these concepts to two empirical cases with the use of Italian real data. These empirical analyses can help in underling the importance of sustainable mobility and of the efforts to improve it, influencing the transport modal choices of the commuter journeys. The first case regards the most sustainable mode of transport for medium-long distance trips, the train, and particularly the problem of delay that strongly affects the performance of the train, influencing the modal choices of commuters. The analysis is based on data collected in the period 2013-2016 on the railway line from Milano to Genoa. The second case concerns medium-short trips, focusing on the issue of home-work commuting of a medium Italian university located in two different cities (Varese and Como) in the north of Italy. The data come from a survey performed in November 2017. Finally, the last chapter draws some conclusions and mentions some upcoming evolutions of mobility that could give a strong contribution in achieving sustainability

    A space-time model for demand in free-floating carsharing systems

    Get PDF
    A novel model approach is proposed to estimate the spatiotemporal distribution of demand for free-floating carsharing. The proposed model is based on a Poisson regression model for right-censored data and estimates possibly time-varying demand rates of small subareas of a service region based on booking data with spatiotemporal information on pickups and dropoffs of cars. The approach allows operators to gain insights into the spatiotemporal distribution of demand for their service and to estimate the loss of demand due to unavailability of cars. Moreover, it can also be used as an input to improve the design of the service, through relocation techniques or to analyze the service with macrosimulation models. In addition, the approach is applied to a case study with real data
    • โ€ฆ
    corecore