共查询到19条相似文献,搜索用时 15 毫秒
1.
This paper introduces a new dynamic green bike repositioning problem (DGBRP) that simultaneously minimizes the total unmet demand of the bike-sharing system and the fuel and CO2 emission cost of the repositioning vehicle over an operational period. The problem determines the route and the number of bikes loaded and unloaded at each visited node over a multi-period operational horizon during which the cycling demand at each node varies from time to time. To handle the dynamic nature of the problem, this study adopts a rolling horizon approach to break down the proposed problem into a set of stages, in which a static bike repositioning sub-problem is solved in each stage. An enhanced artificial bee colony (EABC) algorithm and a route truncation heuristic are jointly used to optimize the route design in each stage, and the loading and unloading heuristic is used to tackle the loading and unloading sub-problem along the route in a given stage. Numerical results show that the EABC algorithm outperforms Genetic Algorithm in solving the routing sub-problem. Computation experiments are performed to illustrate the effect of the stage duration on the two objective values, and the results show that longer stage duration leads to higher total unmet demand and total fuel and CO2 emission cost. Numerical studies are also performed to illustrate the effects of the weight and the loading and unloading times on the two objective values and the tradeoff between the two objectives. 相似文献
2.
Free-floating bike sharing (FFBS) is an innovative bike sharing model. FFBS saves on start-up cost, in comparison to station-based bike sharing (SBBS), by avoiding construction of expensive docking stations and kiosk machines. FFBS prevents bike theft and offers significant opportunities for smart management by tracking bikes in real-time with built-in GPS. However, like SBBS, the success of FFBS depends on the efficiency of its rebalancing operations to serve the maximal demand as possible.Bicycle rebalancing refers to the reestablishment of the number of bikes at sites to desired quantities by using a fleet of vehicles transporting the bicycles. Static rebalancing for SBBS is a challenging combinatorial optimization problem. FFBS takes it a step further, with an increase in the scale of the problem. This article is the first effort in a series of studies of FFBS planning and management, tackling static rebalancing with single and multiple vehicles. We present a Novel Mixed Integer Linear Program for solving the Static Complete Rebalancing Problem. The proposed formulation, can not only handle single as well as multiple vehicles, but also allows for multiple visits to a node by the same vehicle. We present a hybrid nested large neighborhood search with variable neighborhood descent algorithm, which is both effective and efficient in solving static complete rebalancing problems for large-scale bike sharing programs.Computational experiments were carried out on the 1 Commodity Pickup and Delivery Traveling Salesman Problem (1-PDTSP) instances used previously in the literature and on three new sets of instances, two (one real-life and one general) based on Share-A-Bull Bikes (SABB) FFBS program recently launched at the Tampa campus of University of South Florida and the other based on Divvy SBBS in Chicago. Computational experiments on the 1-PDTSP instances demonstrate that the proposed algorithm outperforms a tabu search algorithm and is highly competitive with exact algorithms previously reported in the literature for solving static rebalancing problems in SBSS. Computational experiments on the SABB and Divvy instances, demonstrate that the proposed algorithm is able to deal with the increase in scale of the static rebalancing problem pertaining to both FFBS and SBBS, while deriving high-quality solutions in a reasonable amount of CPU time. 相似文献
3.
The problem of designing a layout of bike stations for public bike‐sharing systems entails selecting a number of stations and then constructing them within a planning area having many bike traffic zones and candidate bike stations. In this paper, we proposed a mathematical model to formulate the layout of public bike stations with the objective of minimizing users' total travel time and investment budget constraints. The model can guarantee that the needs for picking up and dropping off bikes amidst all bike travel demands are satisfied. Using this model, the number and locations of bike stations and the number of bikes and parking lockers at each bike station can be simultaneously determined. A typical example solved by lingo solver is created to illustrate the proposed model. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
4.
Determining the number and location of depots for winter road maintenance (WRM) represents one of the important strategic decisions while planning WRM activities. However, most organizations dealing with WRM make empirically based decisions. Optimizing the number and location of WRM depots has the potential to achieve considerable cost savings, improve mobility and efficiency, as well as reduce environmental impacts. This paper presents two optimization models. The first model determines the location of WRM depots by minimizing the total distance travelled by maintenance vehicles. The second model determines the optimum number and location of WRM depots by minimizing total transportation costs and capital expenditure and operational expenditure of the depots. The models are then applied to the district road network in Serbia. Results show that their application could lead to significant reductions in WRM costs. 相似文献
5.
To determine the spatial distribution of rental stations and bikeways in a public bike system, this paper proposes a facility location and network design model. The model is developed as a multi-objective programing problem that considers four objectives (minimizing cyclist risk, maximizing cyclist comfort, minimizing adverse impacts on traffic and maximizing service coverage) and multiple constraints (monetary budget, network connectivity, station spacing, bikeway types, station number and value ranges of decision variables). The ε-constraint method solves the programing problem for the public bike system in Daan District, Taipei City, Taiwan. The nine non-dominated alternatives generated are all markedly better than existing locations of rental stations and bikeways. Scenario analysis results indicate that increasing the construction budget for bikeways significantly improves cyclist safety and comfort whilst increasing the adverse impact on traffic. Planners can use this model to develop public bike systems that spatially integrate rental stations and bikeway networks. 相似文献
6.
This study analyzes the potential benefits and drawbacks of taxi sharing using agent-based modeling. New York City (NYC) taxis are examined as a case study to evaluate the advantages and disadvantages of ride sharing using both traditional taxis (with shifts) and shared autonomous taxis. Compared to existing studies analyzing ride sharing using NYC taxi data, our contributions are that (1) we proposed a model that incorporates individual heterogeneous preferences; (2) we compared traditional taxis to autonomous taxis; and (3) we examined the spatial change of service coverage due to ride sharing. Our results show that switching from traditional taxis to shared autonomous taxis can potentially reduce the fleet size by 59% while maintaining the service level and without significant increase in wait time for the riders. The benefit of ride sharing is significant with increased occupancy rate (from 1.2 to 3), decreased total travel distance (up to 55%), and reduced carbon emissions (up to 866 metric tonnes per day). Dynamic ride sharing, wich allows shared trips to be formed among many groups of riders, up to the taxi capacity, increases system flexibility. Constraining the sharing to be only between two groups limits the sharing participation to be at the 50–75% level. However, the reduced fleet from ride sharing and autonomous driving may cause taxis to focus on areas of higher demands and lower the service levels in the suburban regions of the city. 相似文献
7.
The station-free sharing bike is a new sharing traffic mode that has been deployed in a large scale in China in the early 2017. Without docking stations, this system allows the sharing bike to be parked in any proper places. This study aimed to develop a dynamic demand forecasting model for station-free bike sharing using the deep learning approach. The spatial and temporal analyses were first conducted to investigate the mobility pattern of the station-free bike sharing. The result indicates the imbalanced spatial and temporal demand of bike sharing trips. The long short-term memory neural networks (LSTM NNs) were then developed to predict the bike sharing trip production and attraction at TAZ for different time intervals, including the 10-min, 15-min, 20-min and 30-min intervals. The validation results suggested that the developed LSTM NNs have reasonable good prediction accuracy in trip productions and attractions for different time intervals. The statistical models and recently developed machine learning methods were also developed to benchmark the LSTM NN. The comparison results suggested that the LSTM NNs provide better prediction accuracy than both conventional statistical models and advanced machine learning methods for different time intervals. The developed LSTM NNs can be used to predict the gap between the inflow and outflow of the sharing bike trips at a TAZ, which provide useful information for rebalancing the sharing bike in the system. 相似文献
8.
In this paper, we examine the operation of electric vehicles in urban car sharing networks. After surveying strategic and operational differences and comparing them to gasoline-fueled cars, a simulation study was carried out. The proposed discrete event simulation tool covered important operational characteristics of electric vehicles, including realistic charging routines. Different vehicle types were compared under various conditions and on multiple markets to determine their performance. The data obtained indicated the competitiveness of electric vehicles in car sharing networks. Key success factors included advantageous relations between the market environment (e.g. electricity and fuel prices) and important characteristics of electric cars (e.g. price and range). 相似文献
9.
为了解决城市共享单车的乱停乱放问题,本文基于北京市的共享单车出行大数据,提出了共享单车停放需求预测的多项Logit模型。首先分析了单车停放需求的影响因素,然后选取了时间、空间及天气方面的12个因素为自变量,通过Wald检验分析了这些因素与停放需求的相关性和显著性,基于多项Logit模型建立了共享单车的停放需求预测模型。结果表明:工作日、时段、商业区、所临道路类型、临近轨交站、高温、下雨、以及风力等级与共享单车停放需求显著相关;构建的预测模型总体预测准确率为77.5%,其中对出现频率最高的低停放需求预测准确率高达86.49%。 相似文献
10.
Ford Motor Company 《运输规划与技术》2013,36(3):177-183
In the search for low pollution, low noise, multi‐fuel vehicles capable of adapting to almost any source of energy available, the electric vehicle continues to be suggested in a variety of forms. In the long‐term view, working on the hypothesis that either solar or nuclear energy can provide the only inexhaustible energy supplies, electric propulsion will undoubtedly have a significant role to perform, and it could provide a useful means of transport in the transition period out of the current dependency on crude oil. There are, however, some grave question marks hanging over the viability of electric vehicles on a large scale both in terms of their energy efficiency and practicality. This paper describes the state of development and discusses the future prospects. 相似文献
11.
A fleet sizing problem (FSP) in a road freight transportation company with heterogeneous fleet and its own technical back‐up facilities is considered in the paper. The mathematical model of the decision problem is formulated in terms of multiple objective mathematical programming based on queuing theory. Technical and economical criteria as well as interests of different stakeholders are taken into account in the problem formulation. The solution procedure is composed of two steps. In the first one a sample of Pareto‐optimal solutions is generated by an original program called MEGROS. In the second step this set is reviewed and evaluated, according to the Decision Maker's (DM's) model of preferences. The evaluation of solutions is carried out with an application of an interactive multiple criteria analysis method, called Light Beam Search (LBS). Finally, the DM selects the most desirable, compromise solution. 相似文献
12.
AbstractCar-following (CF) models are fundamental in the replication of traffic flow and thus they have received considerable attention. This attention needs to be reflected upon at particular points in time. CF models are in a continuous state of improvement due to their significant role in traffic micro-simulations, intelligent transportation systems and safety engineering models. This paper presents a review of existing CF models. It classifies them into classic and artificial intelligence models. It discusses the capability of the models and potential limitations that need to be considered in their improvement. This paper also reviews the studies investigating the impacts of heavy vehicles in traffic stream and on CF behaviour. The findings of the study provide promising directions for future research and suggest revisiting the existing models to accommodate different behaviours of drivers in heterogeneous traffic, in particular, heavy vehicles in traffic. 相似文献
13.
This study gains insight into individual motivations for choosing to own and use autonomous vehicles and develops a model for autonomous vehicle long-term choice decisions. A stated preference questionnaire is distributed to 721 individuals living across Israel and North America. Based on the characteristics of their current commutes, individuals are presented with various scenarios and asked to choose the car they would use for their commute. A vehicle choice model which includes three options is estimated:
- (1)Continue to commute using a regular car that you have in your possession.
- (2)Buy and shift to commuting using a privately-owned autonomous vehicle (PAV).
- (3)Shift to using a shared-autonomous vehicle (SAV), from a fleet of on-demand cars for your commute.
14.
Recently, electric vehicles are gaining importance which helps to reduce dependency on oil, increases energy efficiency of transportation, reduces carbon emissions and noise, and avoids tail pipe emissions. Because of short daily driving distances, high mileage, and intermediate waiting time, fossil-fuelled taxi vehicles are ideal candidates for being replaced by battery electric vehicles (BEVs). Moreover, taxi BEVs would increase visibility of electric mobility and therefore encourage others to purchase an electric vehicle. Prior to replacing conventional taxis with BEVs, a suitable charging infrastructure has to be established. This infrastructure consists of a sufficiently dense network of charging stations taking into account the lower driving ranges of BEVs.In this case study we propose a decision support system for placing charging stations in order to satisfy the charging demand of electric taxi vehicles. Operational taxi data from about 800 vehicles is used to identify and estimate the charging demand for electric taxis based on frequent origins and destinations of trips. Next, a variant of the maximal covering location problem is formulated and solved to satisfy as much charging demand as possible with a limited number of charging stations. Already existing fast charging locations are considered in the optimization problem. In this work, we focus on finding regions in which charging stations should be placed rather than exact locations. The exact location within an area is identified in a post-optimization phase (e.g., by authorities), where environmental conditions are considered, e.g., the capacity of the power network, availability of space, and legal issues.Our approach is implemented in the city of Vienna, Austria, in the course of an applied research project that has been conducted in 2014. Local authorities, power network operators, representatives of taxi driver guilds as well as a radio taxi provider participated in the project and identified exact locations for charging stations based on our decision support system. 相似文献
15.
The recent concerns on environmental issues have expedited the technological development of alternative fuel vehicles (AFVs), but the deployment of AFVs still remains at the initial stage mainly because of the lack of refuelling facilities. Recognising this, researchers have conducted various studies, proposing a variety of approaches to strategically locating refuelling stations. This paper presents a comprehensive review of the approaches, focusing more on applications than computational issues. The review identifies two main elements of the approaches: location modelling and refuelling demand estimation. Examining how the elements were handled in refuelling location studies, this paper suggests that future refuelling location models should properly reflect the intricate and various perspectives of three major AFV stakeholders: drivers, government agencies and refuelling service providers. This study is expected to help researchers efficiently set up their refuelling location problems and identify critical factors for seeking the solutions. 相似文献
16.
This paper introduces a fleet size and mix dial-a-ride problem with multiple passenger types and a heterogeneous fleet of reconfigurable vehicles. In this new variant of the dial-a-ride problem, en-route modifications of the vehicle’s inner configuration are allowed. The main consequence is that the vehicle capacity is defined by a set of configurations and the choice of vehicle configuration is associated with binary decision variables.The problem is modeled as a mixed-integer program derived from the model of the heterogeneous dial-a-ride problem. Vehicle reconfiguration is a lever to efficiently reduce transportation costs, but the number of passengers and vehicle fleet setting make this problem intractable for exact solution methods. A large neighborhood search metaheuristic combined with a set covering component with a reactive mechanism to automatically adjust its parameters is therefore proposed. The resulting framework is evaluated against benchmarks from the literature, used for similar routing problems. It is also applied to a real case, in the context of the transportation of disabled children from their home to medical centers in the city of Lyon, France. 相似文献
17.
Motivated by the growth of ridesourcing services and the expected advent of fully-autonomous vehicles (AVs), this paper defines, models, and compares assignment strategies for a shared-use AV mobility service (SAMS). Specifically, the paper presents the on-demand SAMS with no shared rides, defined as a fleet of AVs, controlled by a central operator, that provides direct origin-to-destination service to travelers who request rides via a mobile application and expect to be picked up within a few minutes. The underlying operational problem associated with the on-demand SAMS with no shared rides is a sequential (i.e. dynamic or time-dependent) stochastic control problem. The AV fleet operator must assign AVs to open traveler requests in real-time as traveler requests enter the system dynamically and stochastically. As there is likely no optimal policy for this sequential stochastic control problem, this paper presents and compares six AV-traveler assignment strategies (i.e. control policies). An agent-based simulation tool is employed to model the dynamic system of AVs, travelers, and the intelligent SAMS fleet operator, as well as, to compare assignment strategies across various scenarios. The results show that optimization-based AV-traveler assignment strategies, strategies that allow en-route pickup AVs to be diverted to new traveler requests, and strategies that incorporate en-route drop-off AVs in the assignment problem, reduce fleet miles and decrease traveler wait times. The more-sophisticated AV-traveler assignment strategies significantly improve operational efficiency when fleet utilization is high (e.g. during the morning or evening peak); conversely, when fleet utilization is low, simply assigning traveler requests sequentially to the nearest idle AV is comparable to more-advanced strategies. Simulation results also indicate that the spatial distribution of traveler requests significantly impacts the empty fleet miles generated by the on-demand SAMS. 相似文献
18.
A vehicle assignment problem (VAP) in a road, long‐haul, passenger transportation company with heterogeneous fleet of buses is considered in the paper. The mathematical model of the VAP is formulated in terms of multiobjective, combinatorial optimization. It has a strategic, long‐term character and takes into account four criteria that represent interests of both passengers and the company's management. The decision consists in the definition of weekly operating frequency (number of rides per week) of buses on international routes between Polish and Western European cities. The VAP is solved in a step‐wise procedure. In the first step a sample of efficient (Pareto‐optimal) solutions is generated using an original metaheuristic method called Pareto Memetic Algorithm (PMA). In the second step this sample is reviewed and evaluated by the Decision Maker (DM). In this phase an interactive, multiple criteria analysis method with graphical facilities, called Light Beam Search (LBS), is applied. The method helps the DM to define his/her preferences, direct the search process and select the most satisfactory solution. 相似文献
19.
This study investigates the routing aspects of battery electric vehicle (BEV) drivers and their effects on the overall traffic network performance. BEVs have unique characteristics such as range limitation, long battery recharging time, and recuperation of energy lost during the deceleration phase if equipped with regenerative braking system (RBS). In addition, the energy consumption rate per unit distance traveled is lower at moderate speed than at higher speed. This raises two interesting questions: (i) whether these characteristics of BEVs will lead to different route selection compared to conventional internal combustion engine vehicles (ICEVs), and (ii) whether such route selection implications of BEVs will affect the network performance. With the increasing market penetration of BEVs, these questions are becoming more important. This study formulates a multi-class dynamic user equilibrium (MCDUE) model to determine the equilibrium flows for mixed traffic consisting of BEVs and ICEVs. A simulation-based solution procedure is proposed for the MCDUE model. In the MCDUE model, BEVs select routes to minimize the generalized cost which includes route travel time, energy related costs and range anxiety cost, and ICEVs to minimize route travel time. Results from numerical experiments illustrate that BEV drivers select routes with lower speed to conserve and recuperate battery energy while ICEV drivers select shortest travel time routes. They also illustrate that the differences in route choice behavior of BEV and ICEV drivers can synergistically lead to reduction in total travel time and the network performance towards system optimum under certain conditions. 相似文献