Exploring trade-offs in frequency allocation in a transit network using bus route patterns: Methodology and application to large-scale urban systems

2015 ◽  
Vol 81 ◽  
pp. 577-595 ◽  
Author(s):  
İ. Ömer Verbas ◽  
Hani S. Mahmassani
Keyword(s):  
Large Scale ◽  
Urban Systems ◽  
Frequency Allocation ◽  
Transit Network ◽  
Trade Offs

Engineering in the time of cholera: overcoming institutional and political challenges to rebuild Zimbabwe's water and sanitation infrastructure in the aftermath of the 2008 cholera epidemic

2013 ◽  
Vol 3 (2) ◽  
pp. 222-229 ◽  
Author(s):  
Clarissa Brocklehurst ◽  
Murtaza Malik ◽  
Kiwe Sebunya ◽  
Peter Salama
Keyword(s):  
Urban Areas ◽  
Large Scale ◽  
Humanitarian Aid ◽  
Urban Systems ◽  
Political Crisis ◽  
Rapid Improvement ◽  
Cholera Epidemic ◽  
Rapid Action ◽  
Water And Sanitation Infrastructure ◽  
Urban Rehabilitation

A devastating cholera epidemic swept Zimbabwe in 2008, causing over 90,000 cases, and leaving more than 4,000 dead. The epidemic raged predominantly in urban areas, and the cause could be traced to the slow deterioration of Zimbabwe's water and sewerage utilities during the economic and political crisis that had gripped the country since the late 1990s. Rapid improvement was needed if the country was to avoid another cholera outbreak. In this context, donors, development agencies and government departments joined forces to work in a unique partnership, and to implement a programme of swift improvements that went beyond emergency humanitarian aid but did not require the time or massive investment associated with full-scale urban rehabilitation. The interventions ranged from supply of water treatment chemicals and sewer rods to advocacy and policy advice. The authors analyse the factors that made the programme effective and the challenges that partners faced. The case of Zimbabwe offers valuable lessons for other countries transitioning from emergency to development, and particularly those that need to take rapid action to upgrade failing urban systems. It illustrates that there is a ‘middle path’ between short-term humanitarian aid delivered in urban areas and large-scale urban rehabilitation, which can provide timely and highly effective results.

Research on Hyperpaths in the Urban Rail Transit Network

2014 ◽  
Vol 488-489 ◽  
pp. 1439-1443
Author(s):  
Jin Hai Li ◽  
Jian Feng Liu
Keyword(s):  
Large Scale ◽  
Urban Rail Transit ◽  
Rail Transit ◽  
Transit Network ◽  
Travel Costs ◽  
Urban Rail ◽  
Distinctive Structure ◽  
Feasible Path ◽  
Definition Of ◽  
Urban Rail Transit Network

Hyperpaths enumeration is one of the basic procedures in many traffic planning issues. As a result of its distinctive structure, hyperpaths in Urban Rail Transit Network (URTN) are different from those in road network. Typically, one may never visit a station more than once and would never transfer from one line to another that has been visited in a loopless URTN, meaning that stations a hyperpath traversed cannot be repeated, neither do lines in loopless networks. This paper studies the relationships between feasible path and the shortest path in terms of travel costs. In this paper, a new definition of hyperpath in URTN is proposed and a new algorithm based on the breadth first searching (BFS) method is presented to enumerate the hyperpaths. The algorithm can safely avoid hyperpath omission and can even be applied in networks containing loops as well. The influence of parameters on hyperpaths is studied by experimentally finding hyperpaths in the subway network in Beijing. A group of suggested parameter pairs are then given. Finally, a numerical experiment is used to illustrate the validity of the proposed algorithm. The results imply the significance of the convergence of the BFS algorithm which can be used to search hyperpaths in large scale URTN even with loop.

scholarly journals Mapping the adaptive landscape of a major agricultural pathogen reveals evolutionary constraints across heterogeneous environments

2021 ◽  
Author(s):  
Anik Dutta ◽  
Fanny E. Hartmann ◽  
Carolina Sardinha Francisco ◽  
Bruce A. McDonald ◽  
Daniel Croll
Keyword(s):  
Life History ◽  
Large Scale ◽  
Life History Traits ◽  
Genetic Correlations ◽  
Stress Factors ◽  
Life History Trait ◽  
Adaptive Landscape ◽  
Heterogeneous Environments ◽  
Growth Responses ◽  
Trade Offs

AbstractThe adaptive potential of pathogens in novel or heterogeneous environments underpins the risk of disease epidemics. Antagonistic pleiotropy or differential resource allocation among life-history traits can constrain pathogen adaptation. However, we lack understanding of how the genetic architecture of individual traits can generate trade-offs. Here, we report a large-scale study based on 145 global strains of the fungal wheat pathogen Zymoseptoria tritici from four continents. We measured 50 life-history traits, including virulence and reproduction on 12 different wheat hosts and growth responses to several abiotic stressors. To elucidate the genetic basis of adaptation, we used genome-wide association mapping coupled with genetic correlation analyses. We show that most traits are governed by polygenic architectures and are highly heritable suggesting that adaptation proceeds mainly through allele frequency shifts at many loci. We identified negative genetic correlations among traits related to host colonization and survival in stressful environments. Such genetic constraints indicate that pleiotropic effects could limit the pathogen’s ability to cause host damage. In contrast, adaptation to abiotic stress factors was likely facilitated by synergistic pleiotropy. Our study illustrates how comprehensive mapping of life-history trait architectures across diverse environments allows to predict evolutionary trajectories of pathogens confronted with environmental perturbations.

scholarly journals An integrated life cycle and water footprint assessment of nonfood crops based bioenergy production

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Jun Li ◽  
Fengyin Xiong ◽  
Zhuo Chen
Keyword(s):  
Life Cycle ◽  
Environmental Sustainability ◽  
Large Scale ◽  
Water Footprint ◽  
Arable Land ◽  
Integrated Analysis ◽  
Actual Performance ◽  
Bioenergy Production ◽  
Trade Offs ◽  
Hybrid Pennisetum

AbstractBiomass gasification, especially distribution to power generation, is considered as a promising way to tackle global energy and environmental challenges. However, previous researches on integrated analysis of the greenhouse gases (GHG) abatement potentials associated with biomass electrification are sparse and few have taken the freshwater utilization into account within a coherent framework, though both energy and water scarcity are lying in the central concerns in China’s environmental policy. This study employs a Life cycle assessment (LCA) model to analyse the actual performance combined with water footprint (WF) assessment methods. The inextricable trade-offs between three representative energy-producing technologies are explored based on three categories of non-food crops (maize, sorghum and hybrid pennisetum) cultivated in marginal arable land. WF results demonstrate that the Hybrid pennisetum system has the largest impact on the water resources whereas the other two technology options exhibit the characteristics of environmental sustainability. The large variances in contribution ratio between the four sub-processes in terms of total impacts are reflected by the LCA results. The Anaerobic Digestion process is found to be the main contributor whereas the Digestate management process is shown to be able to effectively mitigate the negative environmental impacts with an absolute share. Sensitivity analysis is implemented to detect the impacts of loss ratios variation, as silage mass and methane, on final results. The methane loss has the largest influence on the Hybrid pennisetum system, followed by the Maize system. Above all, the Sorghum system demonstrates the best performance amongst the considered assessment categories. Our study builds a pilot reference for further driving large-scale project of bioenergy production and conversion. The synergy of combined WF-LCA method allows us to conduct a comprehensive assessment and to provide insights into environmental and resource management.

scholarly journals System design for inferring colony-level pollination activity through miniature bee-mounted sensors

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Haron M. Abdel-Raziq ◽  
Daniel M. Palmer ◽  
Phoebe A. Koenig ◽  
Alyosha C. Molnar ◽  
Kirstin H. Petersen
Keyword(s):  
Data Acquisition ◽  
Honey Bees ◽  
Large Scale ◽  
Physical World ◽  
Cluttered Environments ◽  
Robotic Mapping ◽  
Large Scale Data ◽  
Trade Offs ◽  
Large Numbers ◽  
Engineered Systems

AbstractIn digital agriculture, large-scale data acquisition and analysis can improve farm management by allowing growers to constantly monitor the state of a field. Deploying large autonomous robot teams to navigate and monitor cluttered environments, however, is difficult and costly. Here, we present methods that would allow us to leverage managed colonies of honey bees equipped with miniature flight recorders to monitor orchard pollination activity. Tracking honey bee flights can inform estimates of crop pollination, allowing growers to improve yield and resource allocation. Honey bees are adept at maneuvering complex environments and collectively pool information about nectar and pollen sources through thousands of daily flights. Additionally, colonies are present in orchards before and during bloom for many crops, as growers often rent hives to ensure successful pollination. We characterize existing Angle-Sensitive Pixels (ASPs) for use in flight recorders and calculate memory and resolution trade-offs. We further integrate ASP data into a colony foraging simulator and show how large numbers of flights refine system accuracy, using methods from robotic mapping literature. Our results indicate promising potential for such agricultural monitoring, where we leverage the superiority of social insects to sense the physical world, while providing data acquisition on par with explicitly engineered systems.

Transit Network Frequency Setting With Multi-Agent Simulation to Capture Activity-Based Mode Substitution

2021 ◽  
pp. 036119812110569
Author(s):  
Ziyi Ma ◽  
Joseph Y. J. Chow
Keyword(s):  
Large Scale ◽  
Operating Cost ◽  
Weighted Average ◽  
Average Error ◽  
Substitution Effects ◽  
Transit Network ◽  
Agent Simulation ◽  
Bus Network ◽  
Upper Level ◽  
Route Cost

We propose a bilevel transit network frequency setting problem in which the upper level consists of analytical route cost functions and the lower level is an activity-based market equilibrium derived using MATSim-NYC. The use of MATSim in the lower-level problem incorporates sensitivity of the design process to competition from other modes, including ride-hail, and can support large-scale optimization. The proposed method is applied to the existing Brooklyn bus network, which includes 78 bus routes, 650,000 passengers per day, 550 route-km, and 4,696 bus stops. MATSim-NYC modeling of the existing bus network has a ridership-weighted average error per route of 21%. The proposed algorithm is applied to a benchmark network and confirms their predicted 20% growth in ridership using their benchmark design. Applying our proposed algorithm to their network with 78 routes and 24 periods, we have a problem with 3,744 decision variables. The algorithm converged within 10 iterations to a delta of 0.064%. Compared with the existing scenario, we increased ridership by 20% and reduced operating cost by 25%. We improved the farebox recovery ratio from the existing 0.22 to 0.35, 0.06 more than the benchmark design. Analysis of mode substitution effects suggest that 2.5% of trips would be drawn from ride-hail while 74% would come from driving.

Time-Dependent Intermodal A* Algorithm: Methodology and Implementation on a Large-Scale Network

2018 ◽  
Vol 2672 (47) ◽  
pp. 219-230 ◽  
Author(s):  
Ömer Verbas ◽  
Joshua Auld ◽  
Hubert Ley ◽  
Randy Weimer ◽  
Shon Driscoll
Keyword(s):  
Large Scale ◽  
Vehicular Network ◽  
Upper Bounds ◽  
Time Dependent ◽  
Regional Network ◽  
A Algorithm ◽  
Transit Network ◽  
Park And Ride ◽  
Large Scale Network ◽  
Scale Network

This paper proposes a time-dependent intermodal A* (TDIMA*) algorithm. The algorithm works on a multimodal network with transit, walking, and vehicular network links, and finds paths for the three major modes (transit, walking, driving) and any feasible combination thereof (e.g., park-and-ride). Turn penalties on the vehicular network and progressive transfer penalties on the transit network are considered for improved realism. Moreover, upper bounds to prevent excessive waiting and walking are introduced, as well as an upper bound on driving for the park-and-ride (PNR) mode. The algorithm is validated on the large-scale Chicago Regional network using real-world trips against the Google Directions API and the Regional Transit Authority router.

scholarly journals The PETLON Algorithm to Plan Efficiently for Task-Level-Optimal Navigation

2020 ◽  
Vol 69 ◽  
pp. 471-500
Author(s):  
Shih-Yun Lo ◽  
Shiqi Zhang ◽  
Peter Stone
Keyword(s):  
Mobile Robot ◽  
Motion Planning ◽  
Mobile Robots ◽  
Large Scale ◽  
Accurate Estimate ◽  
Indoor Environments ◽  
Task Planning ◽  
Trade Offs ◽  
High Level ◽  
Task Level

Intelligent mobile robots have recently become able to operate autonomously in large-scale indoor environments for extended periods of time. In this process, mobile robots need the capabilities of both task and motion planning. Task planning in such environments involves sequencing the robot’s high-level goals and subgoals, and typically requires reasoning about the locations of people, rooms, and objects in the environment, and their interactions to achieve a goal. One of the prerequisites for optimal task planning that is often overlooked is having an accurate estimate of the actual distance (or time) a robot needs to navigate from one location to another. State-of-the-art motion planning algorithms, though often computationally complex, are designed exactly for this purpose of finding routes through constrained spaces. In this article, we focus on integrating task and motion planning (TMP) to achieve task-level-optimal planning for robot navigation while maintaining manageable computational efficiency. To this end, we introduce TMP algorithm PETLON (Planning Efficiently for Task-Level-Optimal Navigation), including two configurations with different trade-offs over computational expenses between task and motion planning, for everyday service tasks using a mobile robot. Experiments have been conducted both in simulation and on a mobile robot using object delivery tasks in an indoor office environment. The key observation from the results is that PETLON is more efficient than a baseline approach that pre-computes motion costs of all possible navigation actions, while still producing plans that are optimal at the task level. We provide results with two different task planning paradigms in the implementation of PETLON, and offer TMP practitioners guidelines for the selection of task planners from an engineering perspective.

Sign in / Sign up

Export Citation Format

Share Document