首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
    
In this paper, we study the transit itinerary planning problem with incorporation of randomness that arises in transit vehicle arrival/departure and passenger transfer. We investigate two approaches to address the uncertainty: a minmax robust approach and an expectation-based probabilistic approach. We adapt a two-phase framework to mitigate computational challenges in large-scale planning problems. In phase I, we compute candidate route connections offline and store them into a database. Although expensive computation is required in phase I, it is typically performed only once over a period of time (e.g., half a year). Phase II takes place whenever a request is received, for which we query candidate route connections from the database, build a stochastic shortest-path model based on either approach listed above, and solve the model in real time. With phase I, computational requirement in phase II is substantially reduced so as to ensure real-time itinerary planning. To demonstrate the practical feasibility of our two-phase approach, we conduct extensive case studies and sensitivity analyses based on a large real-world transit network.  相似文献   

2.
    
The eco-routing problem concerned in this paper addresses the optimal route choice of eco-drivers who aim to meet an emission standard imposed by regulators, while trying to find the path with the minimum total operating cost, which consists of both travel time and fuel costs. The paper first develops fuel consumption and greenhouse gas emissions estimation models that link emission rates to a vehicle’s physical and operational properties. Unlike most studies in the literature, the emission model developed in this paper retains as many microscopic characteristics as feasible in the context of route planning. Specifically, it is able to approximate the impacts of major acceleration events associated with link changes and intersection idling, and yet does not require detailed acceleration data as inputs. The proposed eco-routing model also explicitly captures delays at intersections and the emissions associated with them. Using a simple probabilistic model, the impacts of different turning movements on eco-routing are incorporated. The proposed model is formulated as a constrained shortest path problem and solved by off-the-shelf solvers. Numerical experiments confirm that vehicle characteristics, especially weight and engine displacement, may influence eco-routing. The results also suggest that ignoring the effects of turning movements and acceleration may lead to sub-optimal routes for eco-drivers.  相似文献   

3.
The link between accessibility and social equity attracts much attention for promoting sustainability. However, there is no comprehensive approach to elevate the role of accessibility in evaluating transportation system over social equity by considering the variety of urban opportunities and population groups from green transportation perspective. Our goal is to develop such a framework to evaluate transportation equity by focusing on accessibility via transit and cycling. Applying the framework to Fresno, California, and Cincinnati, Ohio with different development patterns, we delineate service areas at block-group level with five time-thresholds. The service area is used to count the number of urban opportunities: jobs, dining, churches, libraries, parks, multi-use paths, schools. We then use statistical comparison and geographical mapping to identify accessibility gap to these opportunities between advantaged and disadvantaged groups defined by income, property value, education, vehicle ownership, race, and age. The results indicate the extent of differences in accessibility is sensitive to threshold specification of grouping population. The findings suggest that the efficiency of transit service needs to be improved to reach the same level of cycling, while they do help with the accessibility for economically disadvantaged neighborhoods. Considering school enrollment, the accessibility to opportunities in Fresno performs differently while students in Cincinnati benefit from good accessibility to most resources. The results of accessibility to multi-use paths highlight the need of providing more efficient green transportation facilities for less wealthy neighborhoods. Variation in accessibility between groups underscores the importance of developing policies to meet the needs of diverse social groups.  相似文献   

4.
    
Abstract

A multimodal trip planner that produces optimal journeys involving both public transport and private vehicle legs has to solve a number of shortest path problems, both on the road network and the public transport network. The algorithms that are used to solve these shortest path problems have been researched since the late 1950s. However, in order to provide accurate journey plans that can be trusted by the user, the variability of travel times caused by traffic congestion must be taken into consideration. This requires the use of more sophisticated time-dependent shortest path algorithms, which have only been researched in depth over the last two decades, from the mid-1990s. This paper will review and compare nine algorithms that have been proposed in the literature, discussing the advantages and disadvantages of each algorithm on the basis of five important criteria that must be considered when choosing one or more of them to implement in a multimodal trip planner.  相似文献   

5.
    
This paper presents a safety-based path finding methodology for older drivers and bicyclists in an urban area. The paths are estimated based on costs consisting of both safety and travel time. Safety is evaluated against potential risk of a crash involving an older driver (or a bicyclist) with other vehicles present on the road. To accomplish this, simple formulations are developed for safety indicators of streets and intersections, which are actually generic irrespective of the type of road user. Traffic attributes such as speed and density, driver attributes such as perception-reaction time and street attributes of length and tire-to-road friction coefficient are taken into account in building the safety indicators. Thus, the safety indicators do not necessarily require historical crash data which may or may not be available during path finding. Subsequently, a multi-objective shortest path algorithm is presented that identifies the best path (the non-inferior path) from amongst a set of selected safest paths with due considerations to travel time incurred on each. A simple application example of the proposed methodology is demonstrated on an existing street network system from the City of College Station, Texas. The contributions of this research are twofold – first, the safety indicators can be used by planners in determining high crash potential sites – streets and/or intersections – and second, the safety-based path finding methodology developed in this paper can be integrated with modern day route planning devices and tools in guiding older drivers and bicyclists within an Intelligent Transportation Systems framework.  相似文献   

6.
    
In order to plan for, and achieve, a sustainable and accessible transport system, research and policies alike recognize a need to implement and enhance alternative transport options in favor of the private car. Moreover, these sustainable alternatives need to offer sufficient levels of accessibility regardless of where people live or work. We present and discuss an approach for capturing and evaluating perceived accessibility, with the ability to differentiate between individuals. Levels of perceived accessibility are compared before and after a fictive car use restriction, and between residential areas, using data from 2711 residents of Malmö, Sweden. A main conclusion is that levels of perceived accessibility become significantly lower for car users when they are limited in their options for daily travel. The difference is more substantive for frequent car users, who already travel less by sustainable modes today. There are also significant differences in levels of perceived accessibility in the restricted scenario, depending on where individuals live. These novel findings may not come as a surprise, but they emphasize the importance of including and analyzing perceptions of car users when designing accessible and sustainable transport systems. The paper ends with a discussion on how to facilitate the transition from current transport systems to an inclusive and accessible system.  相似文献   

7.
    
Climate change (CC) potentially affects people travel behaviour, due to extreme weather conditions. This is particularly true for pedestrians, that are more exposed to weather conditions. Introducing the effect of this change in transport modelling allows to analyse and plan walking networks taking into consideration the climatic variable. The aim of this work is to develop a tool that can support planning and design of walking networks, by assessing the effects of actions oriented to increase resilience with respect to extreme weather conditions (CC adaptation).An integrated approach is used, thus combining transport and land-use planning concepts with elements of outdoor thermal comfort and network accessibility. Walking networks are analysed through centrality indexes, including thermal comfort aspects into a general cost function of links and weighted nodes. The method has been applied to the walking network inside the Campus of the University of Catania (Italy), which includes different functions and where pedestrian paths are barely used by people. Results confirm that this tool is sensitive to the variables representing weather conditions and it can measure the influence of CC adaptation measures (e.g. vegetation) on walking attitude and on the performance of the walking network.  相似文献   

8.
    
A bicriterion shortest path problem with a general nonadditive cost seeks to optimize a combination of two path costs, one of which is evaluated by a nonlinear function. This paper first identifies a number of emerging transportation applications for which such a shortest path problem might be considered a core subproblem. We propose to first approximate the general nonlinear cost function with a piecewise linear counterpart, and then solve each linear subproblem sequentially. A specialized algorithm is developed to solve the subproblems, which makes use of the efficient path set (or the convex hull) to update upper and lower bounds of the original problem. Conditions under which the solution to a subproblem must belong to the efficient path set are specified. Accordingly, we show that the optimal path must be efficient if the nonlinear cost function is concave. If the optimal path to a subproblem is not efficient, partial path enumeration, implemented using a simple K-shortest path ranking procedure, is conducted to close the gap. The proposed algorithm includes strategies aiming to expedite path enumeration by using upper bounds derived from the efficient path set. Numerical experiments are conducted to demonstrate correctness and effectiveness of the proposed algorithm.  相似文献   

9.
    
Ad hoc shared ride trip planning (SRTP) utilizes mobile devices, geo-sensors and wireless networks to match on-the-fly individual travel demand with transport supply. It represents one of many alternatives to single occupancy vehicle use. This paper outlines a SRTP approach via a two-phase algorithm based on user preferences in a time-dependent routing. Whereas current algorithms use minimization of travel time as the only optimization criterion in trip planning, in the framework presented here, the user can specify multiple trip preferences including travel time, walking time, number of transfers between cars and trip length. Various scenarios are simulated in the city of Tehran (Iran) to demonstrate how preference settings affect the routes of ad hoc shared journeys.  相似文献   

10.
    
Lane changes occur as many times as turning movements are needed while following a designated path. The cost of a route with many lane changes is likely to be more expensive than that with less lane changes, and unrealistic paths with impractical lane changes should be avoided for drivers' safety. In this regard, a new algorithm is developed in this study to find the realistic shortest path considering lane changing. The proposed algorithm is a modified link‐labeling Dijkstra algorithm considering the effective lane‐changing time that is a parametric function of the prevailing travel speed and traffic density. The parameters were estimated using microscopic traffic simulation data, and the numerical test demonstrated the performance of the proposed algorithm. It was found that the magnitude of the effect of the effective lane‐changing time on determining the realistic shortest path is nontrivial, and the proposed algorithm has capability to exclude links successfully where the required lane changes are practically impossible. Copyright © 2015 John Wiley & Sons, Ltd.  相似文献   

11.
    
Bus driver scheduling aims to find the minimum number of bus drivers to cover a published timetable of a bus company. When scheduling bus drivers, contractual working rules must be enforced, thus complicating the problem. In this research, we develop a column generation algorithm that decomposes this complicated problem into a master problem and a series of pricing subproblems. The master problem selects optimal duties from a set of known feasible duties, and the pricing subproblem augments the feasible duty set to improve the solution obtained in the master problem. The proposed algorithm is empirically applied to the realistic problems of several bus companies. The numerical results show that the proposed column generation algorithm can solve real‐world problems and obtain bus driver schedules that are better than those developed and used by the bus companies. Copyright © 2016 John Wiley & Sons, Ltd.  相似文献   

12.
    
Social equity is increasingly becoming an important objective in transport planning and project evaluation. This paper provides a framework and an empirical investigation in the Greater Toronto and Hamilton Area (GTHA) examining the links between public transit accessibility and the risks of social exclusion, simply understood as the suppressed ability to conduct daily activities at normal levels. Specifically, we use a large-sample travel survey to present a new transport-geography concept termed participation deserts, neighbourhood-level clusters of lower than expected activity participation. We then use multivariate models to estimate where, and for whom, improvements in transit accessibility will effectively increase activity participation and reduce risks of transport-related social exclusion. Our results show that neighbourhoods with high concentrations of low-income and zero-car households located outside of major transit corridors are the most sensitive to having improvements in accessibility increase daily activity participation rates. We contend that transit investments providing better connections to these neighbourhoods would have the greatest benefit in terms of alleviating existing inequalities and reducing the risks of social exclusion. The ability for transport investments to liberate suppressed activity participation is not currently being predicted or valued in existing transport evaluation methodologies, but there is great potential in doing so in order to capture the social equity benefits associated with increasing transit accessibility.  相似文献   

13.
This study investigates the impact of using a concept map-based ‘mashup’ (www.accessadvisr.net) to provide volunteered (i.e. user contributed) ease of access information to travellers with limited mobility. A scenario-based user trial, centred around journey planning, was undertaken with 20 participants, divided equally between (1) those who have physical restrictions on their mobility, due to disability, illness or injury, and (2) those with practical mobility constraints due to being parents with young children who have to use a child’s pushchair when using public transport. Both user groups found the concept useful, but its potential impact was less for the pushchair user group. There were mixed views in relation to the ability of the mashup to convey the trustworthiness, credibility and reliability of information necessary for journey planning. The study identified a number of key information-related user requirements which help enable effective design of user contributed web-based resources for travellers with mobility-related issues.  相似文献   

14.
    
When discussing the future of cities, there is a tendency to focus on technology that will make cities and mobilities more sustainable. A bit further down the line the question of understanding or changing everyday practice arises – how to get people to transform their current mobility practice, or to adjust to the technologies introduced. As a key to understanding and changing practice I argue that storytelling plays a crucial role on different scales. In line with this, the concept of structural stories can be used to understand how specific framings of modes of transport guides everyday practices. To illustrate this, I will use the example of a concept of redesigning Copenhagen’s streets. On these streets space is redistributed so that pedestrians, cyclists and busses get more space, and more space is created for public places and city life. Consequently, the space allocated for cars and parking is scaled down.  相似文献   

15.
    
Travel times are generally stochastic and spatially correlated in congested road networks. However, very few existing route guidance systems (RGS) can provide reliable guidance services to aid travellers planning their trips with taking account explicitly travel time reliability constraint. This study aims to develop such a RGS with particular consideration of travellers' concern on travel time reliability in congested road networks with uncertainty. In this study, the spatially dependent reliable shortest path problem (SD‐RSPP) is formulated as a multi‐criteria shortest path‐finding problem in road networks with correlated link travel times. Three effective dominance conditions are established for links with different levels of travel time correlations. An efficient algorithm is proposed to solve SD‐RSPP by adaptively using three established dominance conditions. The complexities of road networks in reality are also explicitly considered. To demonstrate the applicability of proposed algorithm, a comprehensive case study is carried out in Hong Kong. The results of case study show that the proposed solution algorithm is robust to take account of travellers' multiple routing criteria. Computational results demonstrate that the proposed solution algorithm can determine the reliable shortest path on real‐time basis for large‐scale road networks. Copyright © 2016 John Wiley & Sons, Ltd.  相似文献   

16.
Global Positioning System and other location-based services record vehicles’ spatial locations at discrete time stamps. Considering these recorded locations in space with given specific time stamps, this paper proposes a novel time-dependent graph model to estimate their likely space–time paths and their uncertainties within a transportation network. The proposed model adopts theories in time geography and produces the feasible network–time paths, the expected link travel times and dwell times at possible intermediate stops. A dynamic programming algorithm implements the model for both offline and real-time applications. To estimate the uncertainty, this paper also develops a method based on the potential path area for all feasible network–time paths. This paper uses a set of real-world trajectory data to illustrate the proposed model, prove the accuracy of estimated results and demonstrate the computational efficiency of the estimation algorithm.  相似文献   

17.
Accessibility is a key metric when assessing the efficiency of an urban public transportation network. This research develops a methodology for evaluating spatial accessibility of a system with multiple transportation modes in an urban area, Shanghai Hongqiao Transportation Hub (SHTH) and its surrounding area. The method measured total traveling time as an accessibility indicator, which summed the time people spent on walking, waiting, transfer and transportation in a journey from the SHTH to destinations. Spatial accessibility was classified into five levels from very high to very low. The evaluation was conducted at a cell-by-cell basis under an overall scenario and three specific scenarios. Evaluation results were presented in a series of maps. The overall accessibility scenario shows a concentric-ring trend decreasing from the SHTH to the fringe of the study area. Areas along the metro lines generally have a much higher accessibility than those along the bus lines with some exceptions where bus routes play a more important role. Metro stations identified as either time-saving or time-consuming points are mainly distributed around the urban center. Some suggestions are proposed for improving accessibility of public transportation network in the study area. The results from this study provide a scientific basis and useful information for supporting decision-making on urban planning, and assisting dwellers to travel in a time-efficient manner. The methodology offers a simple, flexible way to the spatial evaluation, metro station identification and network modification of accessibility of public transportation systems with multiple transportation modes.  相似文献   

18.
    
Automated driving is gaining increasing amounts of attention from both industry and academic communities because it is regarded as the most promising technology for improving road safety in the future. The ability to make an automated lane change is one of the most important parts of automated driving. However, there has been little research into automated lane change maneuvers, and current research has not identified a way to avoid potential collisions during lane changes, which result from the state variations of the other vehicles. One important reason is that the lane change vehicle cannot acquire accurate information regarding the other vehicles, especially the vehicles in the adjacent lane. However, vehicle-to-vehicle communication has the advantage of providing more information, and this information is more accurate than that obtained from other sensors, such as radars and lasers. Therefore, we propose a dynamic automated lane change maneuver based on vehicle-to-vehicle communication to accomplish an automated lane change and eliminate potential collisions during the lane change process. The key technologies for this maneuver are trajectory planning and trajectory tracking. Trajectory planning calculates a reference trajectory satisfying the demands of safety, comfort and traffic efficiency and updates it to avoid potential collisions until the lane change is complete. The trajectory planning method converts the planning problem into a constrained optimization problem using the lane change time and distance. This method is capable of planning a reference trajectory for a normal lane change, an emergency lane change and a change back to the original lane. A trajectory-tracking controller based on sliding mode control calculates the control inputs to make the host vehicle travel along the reference trajectory. Finally, simulations and experiments using a driving simulator are conducted. They demonstrate that the proposed dynamic automated lane change maneuver can avoid potential collisions during the lane change process effectively.  相似文献   

19.
    
In this paper, reasonable paths in transit networks are defined as possible paths that satisfy the acceptable time criterion and transfer‐walk criterion. A recursive algorithm for finding all of the reasonable paths in a transit network that does not involve a rapid increase in program run‐time with network size is presented. Realistic transit networks in Hong Kong and Guangzhou were selected as case studies of the different phases of the development of a trip planning system. Transport planning practitioners and potential users were invited to test the system to evaluate its performance. The results of the prototype evaluation were satisfactory, and the viability of the system as a useful tool for supporting decision‐making has been confirmed by the positive feedback that was obtained from survey questionnaires.  相似文献   

20.
D*Lite算法是一种非常高效的增量搜索算法,适合于动态环境下的路径规划。文章基于D*Lite算法的原理,对该算法的性能及应用于车辆路径规划的适用性进行改进,提高了算法的稳定性和结果的可靠性,并通过试验和算法评价验证了改进的D*Lite算法在复杂、动态环境下规划路径的有效性。  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号