Modelling shared space users via rule-based social force model

The promotion of space sharing in order to raise the quality of community living and safety of street surroundings is increasingly accepted feature of modern urban design. In this context, the development of a shared space simulation tool is essential in helping determine whether particular shared space schemes are suitable alternatives to traditional street layouts. A simulation tool that enables urban designers to visualise pedestrians and cars trajectories, extract flow and density relation in a new shared space design, achieve solutions for optimal design features before implementation, and help getting the design closer to the system optimal. This paper presents a three-layered microscopic mathematical model which is capable of representing the behaviour of pedestrians and vehicles in shared space layouts and it is implemented in a traffic simulation tool. The top layer calculates route maps based on static obstacles in the environment. It plans the shortest path towards agents’ respective destinations by generating one or more intermediate targets. In the second layer, the Social Force Model (SFM) is modified and extended for mixed traffic to produce feasible trajectories. Since car movements are not as flexible as pedestrian movements, velocity angle constraints are included for cars. The conflicts described in the third layer are resolved by rule-based constraints for shared space users. An optimisation algorithm is applied to determine the interaction parameters of the force-based model for shared space users using empirical data. This new three-layer microscopic model can be used to simulate shared space environments and assess, for example, new street designs.     

Joint travel problem in space–time multi-state supernetworks

Joint travel problem (JTP) is an extension of the classic shortest path problem and relevant to shared mobility. A pioneering endeavor via supernetwork framework has been put forward to model two-person JTP. However, it was only addressed in the static context and with the assumption of zero waiting disutility, which resulted in no or weak synchronization among the travelers. This paper proposes a space–time multi-state supernetwork framework to address JTP for conducting one joint activity in the time-dependent context. Space–time synchronization and various choice facets related to joint travel are captured systematically. Two-person JTP is first discussed in a uni-modal transport network, and further extended to incorporate multi-modal and multi-person respectively. Stage-wise recursive formulations are proposed to find the optimal joint paths. It is found that JTP is a variant of Steiner tree problem by reduction and the number of meeting/departing points has no impact on the run-time complexity in space–time multi-state supernetworks.

     

Walking infrastructure design assessment by continuous space dynamic assignment modeling

For the planning and design of walking infrastructure, characterized by the fact that the pedestrians can choose their paths freely in two‐dimensional space, applicability of traditional discrete network models is limited. This contribution puts forward an approach for user‐optimal dynamic assignment in continuous time and space for analyzing for instance walking infrastructure in a two‐dimensional space. Contrary to network‐based approaches, the theory allows the traffic units to choose from an infinite non‐countable set of paths through the considered space. The approach first determines the continuous paths using a path choice model. Then, origin‐destination flows are assigned and traffic conditions are calculated. The approach to determine a user‐optimal assignment is heuristic and consists of a sequence of all‐or‐nothing assignments. An application example is presented, showing dynamic user equilibrium traffic flows through a realistic transfer station. The example is aimed at illustrating the dynamic aspects of the modeling approach, such as anticipation on expected flow conditions, and predicted behavior upon catching or missing a connection.     

A systematic analysis of multimodal transport systems with road space distribution and responsive bus service

A smart design of transport systems involves efficient use and allocation of the limited urban road capacity in the multimodal environment. This paper intends to understand the system-wide effect of dividing the road space to the private and public transport modes and how the public transport service provider responds to the space changes. To this end, the bimodal dynamic user equilibrium is formulated for separated road space. The Macroscopic Fundamental Diagram (MFD) model is employed to depict the dynamics of the automobile traffic for its state-dependent feature, its inclusion of hypercongestion, and its advantage of capturing network topology. The delay of a bus trip depends on the running speed which is in turn affected by bus lane capacity and ridership. Within the proposed bimodal framework, the steady-state equilibrium traffic characteristics and the optimal bus fare and service frequency are analytically derived. The counter-intuitive properties of traffic condition, modal split, and behavior of bus operator in the hypercongestion are identified. To understand the interaction between the transport authority (for system benefit maximization) and the bus operator (for its own benefit maximization), we examine how the bus operator responds to space changes and how the system benefit is influenced with the road space allocation. With responsive bus service, the condition, under which expanding bus lane capacity is beneficial to the system as a whole, has been analytically established. Then the model is applied to the dynamic framework where the space allocation changes with varying demand and demand-responsive bus service. We compare the optimal bus services under different economic objectives, evaluate the system performance of the bimodal network, and explore the dynamic space allocation strategy for the sake of social welfare maximization.     

Container vessel fleet deployment for liner shipping with stochastic dependencies in shipping demand

The problem of optimal container vessels deployment is one of great significance for the liner shipping industry. Although the pioneering work on this problem dates back to the early 1990s, only until recently have researchers started to acknowledge and account for the significant amount of uncertainty present in shipping demand in real world container shipping. In this paper, new analytical results are presented to further relax the input requirements for this problem. Specifically, only the mean and variance of the maximum shipping demand are required to be known. An optional symmetry assumption is shown to further reduce the feasible region and deployment cost for typical confidence levels. Moreover, unlike previous work that tends to ignore stochastic dependencies between the shipping demands on the various routes (that are known to exist in the real world), our models account for such dependencies in the most general setting to date. A salient feature of our modeling approach is that the exact dependence structure does not need to be specified, something that is hard, if not simply impossible, to determine in practice. A numerical case study is provided to illustrate the proposed models.     

Dynamic blocking for railyards: Part I. Homogeneous traffic

This paper and its companion present a study of railroad classification yard strategies that allow for blocks of destinations to be assigned to classification tracks in different ways, depending on the time of day, week or month. With the same number of tracks, more classifications can be handled by this method. The paper examines homogeneous traffic; that is, traffic patterns where all blocks have the same amount of traffic, where cars for all blocks depart equally frequently from the yard and where the overall traffic flow does not change with time. The results represent the beginning of a better understanding of yard operations, which should be useful for designing new yards, planning expansions of existing ones and evaluating the impact of changes (planned and unplanned) on traffic patterns. The paper concentrates on two sorting strategies: sorting by train (perhaps the most commonly used strategy in the United States today), and triangular sorting. For both strategies, formulas are given for the minimum number of tracks, number of switches and for the total space requirements. For triangular sorting, the yard delay and total space depend on the time chosen between reswitches. These two measures of performance can be reduced if one is willing to accept a sorting effort slightly higher than minimum. The trade-off can be explored numerically. For sorting by train, yard delay and total space are not significantly affected by the sorting method; there is no such trade-off. It appears that sorting by train results in less work, delay and space requirements than triangular sorting, at least in most instances when either could be used. Triangular sorting, however, can be used when there are not enough tracks to allow sorting by train.     

Coordinated ramp metering for freeway networks – A model-predictive hierarchical control approach

A nonlinear model-predictive hierarchical control approach is presented for coordinated ramp metering of freeway networks. The utilized hierarchical structure consists of three layers: the estimation/prediction layer, the optimization layer and the direct control layer. The previously designed optimal control tool AMOC (Advanced Motorway Optimal Control) is incorporated in the second layer while the local feedback control strategy ALINEA is used in the third layer. Simulation results are presented for the Amsterdam ring-road. The proposed approach outperforms uncoordinated local ramp metering and its efficiency approaches the one obtained by an optimal open-loop solution. It is demonstrated that metering of all on-ramps, including freeway-to-freeway intersections, with sufficient ramp storage space leads to the optimal utilization of the available infrastructure.     

Modeling duration choice in space–time multi-state supernetworks for individual activity-travel scheduling

Multi-state supernetworks have been advanced recently for modeling individual activity-travel scheduling decisions. The main advantage is that multi-dimensional choice facets are modeled simultaneously within an integral framework, supporting systematic assessments of a large spectrum of policies and emerging modalities. However, duration choice of activities and home-stay has not been incorporated in this formalism yet. This study models duration choice in the state-of-the-art multi-state supernetworks. An activity link with flexible duration is transformed into a time-expanded bipartite network; a home location is transformed into multiple time-expanded locations. Along with these extensions, multi-state supernetworks can also be coherently expanded in space–time. The derived properties are that any path through a space–time supernetwork still represents a consistent activity-travel pattern, duration choice are explicitly associated with activity timing, duration and chain, and home-based tours are generated endogenously. A forward recursive formulation is proposed to find the optimal patterns with the optimal worst-case run-time complexity. Consequently, the trade-off between travel and time allocation to activities and home-stay can be systematically captured.     

Do parking requirements significantly increase the area dedicated to parking? A test of the effect of parking requirements values in Los Angeles County

Minimum parking requirements (MPRs) are the norm for urban and suburban development in the United States (Davidson et al., 2002). The justification for MPRs is that overflow parking will occupy nearby street or off-street parking. Shoup (1999a) and Willson (1995) provide cases where there is reason to believe that parking space requirements have forced parcel developers to place more parking than they would in the absence of parking requirements. However, to our knowledge the existing literature does not test the effect of parking minimums on the amount of lot space devoted to parking beyond a few case studies. This paper tests the hypothesis that MPRs bind for most land uses using data on suburban office, commercial, industrial and retail property sales from Los Angeles County using both direct and indirect approaches. Our indirect test of the effects of parking requirements is similar to the one used by Glaeser and Gyourko (2003). A simple theoretical model shows that the marginal value of additional parking to the sale price of a building should be equal to the cost of land plus the cost of parking construction. We estimate the marginal values of parking and lot area with spatial methods using a large data set from the Los Angeles area non-residential property sales and find that for most of the property types the marginal value of parking is significantly below that of the parcel area. In addition, we directly examine required and supplied parking and find that on average parking supplied is quite close to the required amount.     

On the distribution of urban road space for multimodal congested networks

Transport systems in real cities are complex with many modes of transport sharing and competing for limited road space. This work intends to understand how space distributions for modes and interactions among modes affect network traffic performance. While the connection between performance of transport systems and general land allocation is the subject of extensive research, space allocation for interacting modes of transport is an open research question. Quantifying the impact of road space distribution on the performance of a congested multimodal transport system with a dynamic aggregated model remains a challenge. In this paper, a multimodal macroscopic fundamental diagram (MFD) is developed to represent the traffic dynamics of a multimodal transport system. Optimization is performed with the objective of minimizing the total passenger hours traveled (PHT) to serve the total demand by redistributing road space among modes. Pricing strategies are also investigated to provide a higher demand shift to more efficient modes. We find by an application to a bi-modal two-region city that (i) the proposed model captures the operational characteristics of each mode, and (ii) optimal dynamic space distribution strategies can be developed. In practice, the approach can serve as a physical dynamic model to inform space distribution strategies for policy makers with different goals of mobility.     

Solving the logistic problems with optimal resource assignment using fuzzy logic methods

Fuzzy approach of optimal resource assignment regarding the given demands in the scope of transportation will be presented in the article. The basis of the research is the crisp solution which is also presented in the article. The basic solution was upgraded in order to be able to handle vaguely (i.e. fuzzily) defined requirements and resource properties. The optimal resource configuration is calculated with the aid of Hungarian algorithm which uses the data calculated with the fuzzy methods for its inputs. The approach described is presented on the example of a military convoy formation. Copyright © 2011 John Wiley & Sons, Ltd.     

Optimisation of motorway operations via ramp metering and variable speed limits

This paper presents a modelling and optimisation framework for deriving ramp metering and variable speed control strategies. We formulate the optimal control problems aiming to minimise the travel delay on motorways based upon a macroscopic cell transmission model of traffic. The optimal ramp metering optimisation is formulated as a linear programming (LP) while the variable speed control problem is formulated as a mixed integer LP. The optimisation models are applied to a real scenario over a section of M25 motorway in the UK. This paper also includes various analyses on the sensitivity of the optimal control solutions with respect to different network configurations and model assumptions.     

Compliance and data quality in GPS-based studies

Recent years have witnessed a growing volume of papers describing the use of GPS technology and other tracking technologies for obtaining data on time–space activities. These methods have several advantages over traditional methods of time–space data collection in terms of accuracy, resolution and length of the possible data collection period. However, to date, no work has been done on the compliance rates among participants and the resulting validity of the collected data. This paper presents a method that combines the use of a GPS receiver with Radio Frequency Identification (RFID) technology that was implemented in research on time–space activities of elderly persons with cognitive impairment. The method presented in this paper enables monitoring the level of compliance of the participants during their participation in the study and presents a unique opportunity to examine the extent to which participants in a GPS based study are able to comply with study requirements. Healthy older adults and those with cognitive decline were found to be generally compliant with a complex study protocol. These results serve as another step into the acceptance of GPS based studies as a valid methodology for mobility data collection.     

An improved car‐following model for railway traffic

In this paper, we propose an improved traffic model for simulating train movement in railway traffic. The proposed model is based on optimal velocity car‐following model. In order to test the proposed model, we use it to simulate the train movement with fixed‐block system. In simulations, we analyze and discuss the space–time diagram of railway traffic flow and the trajectories of train movement. Simulation results demonstrate that the proposed model can be successfully used for simulating the train movement in railway traffic. From the space–time diagram, we find some complex phenomena of train flow, which are observed in real railway traffic, such as train delays. By analyzing the trajectories of train movement, some dynamic characteristics of trains can be reproduced. Copyright © 2011 John Wiley & Sons, Ltd.     

密闭空间空气净化用滤材检测设备设计研究

随着机动车辆的普及,人们呆在密闭空间即驾乘室以及室内的时间会逐渐拉长,如何有效的控制密闭空间的PM2.5浓度值值得我们去探讨和研究。通过对密闭空间空气净化原理的分析,采用激光粒子计数方法,设计了密闭空间空气净化检验流程及相配套的检测设备,将密闭空间(含室内及驾乘室)大气中的PM2.5含量控制在标准要求的浓度值以内。     

Optimization of emergency crossovers and signals for emergency operations in rail rapid transit

This paper presents a methodology for designing rail transit systems to meet operating requirements when track maintenance or failure cause sections of tracks to be unavailable for service. The methodology can be also used to establish the requirements for the continuity of operations during construction. The main objective of the paper is to develop a tool which performs trade-offs between system costs and level of services during emergencies/construction. Several alternatives, including various signal and control systems, number and types of crossovers and corresponding operating strategies, are developed and evaluated against capital investments. Operating measures and strategies for the selected alternative can be recommended before the design phase is completed, because the designer, by using this methodology, is aware of the capacities attained during emergencies and construction.     

A simulation-based vessel-truck coordination strategy for lighterage terminals

Lighterage contributes significantly to the maritime industry since thousand tons of necessary supplies have to be delivered to mother vessels anchored near sea every day. A single lighter waits to receive cargoes from multiple suppliers at the berth, while the trucks wait for their turns to enter the terminal. Due to the limited space, the terminal operation becomes vulnerable to the lack of coordination of their arrivals. In this study, despite a traditional industry, we are interested in applying the emerging technologies to improve the operation efficiency. We develop a simulation-based coordination strategy to construct coordinated schedules for both the lighters and suppliers to reduce congestions in the lighterage terminal The discrete event simulation model is developed based on understanding the real-world terminal in Singapore, and the controlled arrival method, determining coordinated arrival schedules of trucks, is introduced and embedded to the simulation model. The simulation model is tuned up with a benchmark setting of 6-month historical data. To find the optimal strategy, an advanced bi-objective simulation optimization algorithm is employed. According to our findings, the proposed strategy could significantly improve the efficiency of both lighters and trucks in various indicators. At the end, a mobile application prototype is proposed to deliver the coordinated schedules to different parties, and improve the communication between parties.     

Scheduling highway work zones with genetic algorithm considering the impact of traffic diversion

Highway work zones caused excessive delay to road users. To reduce user and maintenance costs, work zones shall be designed and scheduled accordingly. An analytical model is developed to jointly optimize work zone lengths and schedule as well as diverted traffic volume for highway maintenance projects, considering time‐varying demand, variable maintenance cost, and various production rates of maintenance crew. With a genetic algorithm, an iterative procedure is developed to search for the optimal solution. A numerical example is illustrated, in which various traffic mitigation plans for a highway maintenance project are evaluated. A sensitivity analysis is conducted, and results indicate the threshold volumes for various conditions (e.g., maintenance crews and capacity of the work zone) at which diverting traffic is desirable. This study demonstrates an effective approach to search for the optimal work zone schedule, which is also applicable to evaluate the effectiveness of traffic diversion plans for a pre‐planned work zone schedule. Copyright © 2012 John Wiley & Sons, Ltd.     

An Internet-based geographic information system that integrates data,models and users for transportation applications

This paper is concerned with the development of an Internet-based geographic information system (GIS) that brings together spatio-temporal data, models and users in a single efficient framework to be used for a wide range of transportation applications – planning, engineering and operational. The functional requirements of the system are outlined taking into consideration the various enabling technologies, such as Internet tools, large-scale databases and distributed computing systems. Implementation issues as well as the necessary models needed to support the system are briefly discussed.