scholarly journals The Depth-First Optimal Strategy Path Generation Algorithm for Passengers in a Metro Network

2020 ◽  
Vol 12 (13) ◽  
pp. 5365 ◽  
Author(s):  
Kai Lu ◽  
Tao Tang ◽  
Chunhai Gao
Keyword(s):  
Shortest Path ◽  
Optimal Strategy ◽  
Path Generation ◽  
Generation Algorithm ◽  
Transit Network ◽  
Multiple Paths ◽  
Shortest Path Analysis ◽  
Passenger Assignment ◽  
Passenger Behavior ◽  
Metro Network

Passenger behavior analysis is a key issue in passenger assignment research, in which the path choice is a fundamental component. A highly complex transit network offers multiple paths for each origin–destination (OD) pair and thus resulting in more flexible choices for each passenger. To reflect a passenger’s flexible choice for the transit network, the optimal strategy was proposed by other researchers to determine passenger choice behavior. However, only strategy links have been searched in the optimal strategy algorithm and these links cannot complete the whole path. To determine the paths for each OD pair, this study proposes the depth-first path generation algorithm, in which a strategy node concept is newly defined. The proposed algorithm was applied to the Beijing metro network. The results show that, in comparison to the shortest path and the K-shortest path analysis, the proposed depth-first optimal strategy path generation algorithm better represents the passenger behavior more reliably and flexibly.

scholarly journals Passenger Behavior Simulation in Congested Urban Rail Transit System: A Capacity-Limited Optimal Strategy Model for Passenger Assignment

Complexity ◽  
2022 ◽  
Vol 2022 ◽  
pp. 1-13
Author(s):  
Kai Lu ◽  
Nan Cao
Keyword(s):  
Optimal Strategy ◽  
Urban Rail Transit ◽  
Transit Assignment ◽  
Transit System ◽  
Behavior Simulation ◽  
Strategy Model ◽  
Metropolitan Cities ◽  
Urban Rail ◽  
Passenger Assignment ◽  
Passenger Behavior

Optimal strategy, one of the main transit assignment models, can better demonstrate the flexibility for passengers using routes in a transit network. According to the basic optimal strategy model, passengers can board trains based on their frequency without any capacity limitation. In the metropolitan cities such as Beijing, Shanghai, and Hong Kong, morning commuters face huge transit problems. Especially for the metro system, there is heavy rush in metro stations. Owing to the limited train capacity, some passengers cannot board the first coming train and need to wait for the next one. To better demonstrate the behavior of passengers pertaining to the limited train capacity, we consider capacity constraints for the basic optimal strategy model to represent the real situation. We have proposed a simulation-based algorithm to solve the model and apply it to the Beijing Subway to demonstrate the feasibility of the model. The application of the proposed approach has been demonstrated using the computational results for transit networks originating from practice.

scholarly journals Fault-Tolerant Energy-Efficient Priority-Based Routing Scheme for the Multisink Healthcare Sensor Networks

2012 ◽  
Vol 2012 ◽  
pp. 1-11 ◽  
Author(s):  
Ather Saeed ◽  
Andrew Stranieri ◽  
Richard Dazeley
Keyword(s):  
Sensor Networks ◽  
Shortest Path ◽  
Fault Tolerant ◽  
Cost Effective ◽  
Well Being ◽  
Habitat Monitoring ◽  
Data Packets ◽  
Routing Scheme ◽  
Multiple Paths ◽  
Timely Dissemination

Wireless sensor networks (WSNs) are widely used in battle fields, logistic applications, healthcare, habitat monitoring, environmental monitoring, home security, and variety of other areas. The existing routing algorithms focus on the delivery of data packets to the sink using the shortest path; however, calculating the shortest path is not a cost-effective solution while disseminating datasets of interest to the nearest sink node. The approach presented in this paper extends the existing PBR (priority-based routing) protocol by providing a new fault-tolerant multipath priority-based routing (FT-MPPBR) scheme, which not only balances the energy consumption while selecting multiple paths but also balances the workload of the node closest to the sink. The nodes closer to the sink dissipate more energy and can become the source of a communication bottleneck. Simulation results for the proposed routing scheme are encouraging and clearly show that the FT-MPPBR has outperformed the existing PBR schemes in terms of prolonging the network lifetime and reliability. In healthcare sensor networks, timely dissemination of datasets is critical for the well-being of a patient. This research further extends the PBR architecture for supporting computational intensive analysis by transferring datasets of interest to the sensor grid node for improved communication and better throughput.

Use of a virtual milling system to generate power-aware tool paths for 2.5-dimensional pocket machining

2019 ◽  
Vol 233 (13) ◽  
pp. 2419-2435 ◽  
Author(s):  
David Manuel Ochoa González ◽  
Joao Carlos Espindola Ferreira
Keyword(s):  
Power Consumption ◽  
Tool Path ◽  
Tool Path Generation ◽  
Path Generation ◽  
Machining Time ◽  
Power Requirement ◽  
Pocket Machining ◽  
Direction Parallel ◽  
Generation Algorithm ◽  
Tool Paths

Traditional (direction-parallel and contour-parallel) and non-traditional (trochoidal) tool paths are generated by specialized geometric algorithms based on the pocket shape and various parameters. However, the tool paths generated with those methods do not usually consider the required machining power. In this work, a method for generating power-aware tool paths is presented, which uses the power consumption estimation for the calculation of the tool path. A virtual milling system was developed to integrate with the tool path generation algorithm in order to obtain tool paths with precise power requirement control. The virtual milling system and the tests used to calibrate it are described within this article, as well as the proposed tool path generation algorithm. Results from machining a test pocket are presented, including the real and the estimated power requirements. Those results were compared with a contour-parallel tool path strategy, which has a shorter machining time but has higher in-process power consumption.

scholarly journals Roaming Path Generation Algorithm and Optimization Based On Bezier Curve

2018 ◽  
Vol 51 (17) ◽  
pp. 339-345 ◽  
Author(s):  
Jiayao Li ◽  
Ruizhi Sun ◽  
Chunming Cheng ◽  
Sicong Li
Keyword(s):  
Bézier Curve ◽  
Bezier Curve ◽  
Path Generation ◽  
Generation Algorithm

Lofting-based spiral tool path generation algorithm for milling a pocket with an island

2016 ◽  
Vol 88 (5-8) ◽  
pp. 2169-2178 ◽  
Author(s):  
Zhiping Liu ◽  
Xiongbing Li ◽  
Yongfeng Song ◽  
Bing Yi ◽  
Feng Chen
Keyword(s):  
Tool Path ◽  
Tool Path Generation ◽  
Path Generation ◽  
Generation Algorithm ◽  
Spiral Tool Path

Urban Rail Transit Network Fare Analysis

2014 ◽  
Vol 641-642 ◽  
pp. 753-756
Author(s):  
Ke Yang ◽  
Jun Fang Jia
Keyword(s):  
Urban Rail Transit ◽  
Rail Transit ◽  
Transit Network ◽  
Ticket Pricing ◽  
Urban Rail ◽  
Urban Rail Transit Network ◽  
Relevant Factors ◽  
Metro Network

This article analyzes the relevant factors of urban rail transit fare pricing. Some cities with metro network were selected to study the level of rail transit fares. By analyzing and comparing the characteristics of the networks, this article draws some conclusions and recommendations about the ticket pricing of urban rail transit.

A New Tool-Path Generation Algorithm for Sculptured Surface Using Taper-Cutter

2007 ◽  
Vol 10-12 ◽  
pp. 308-311
Author(s):  
Li Cheng Fan ◽  
L.N. Sun ◽  
Zhi Jiang Du
Keyword(s):  
Path Planning ◽  
Tool Path ◽  
Tool Path Generation ◽  
Surface Model ◽  
Sculptured Surface ◽  
Path Generation ◽  
Tool Path Planning ◽  
Generation Algorithm ◽  
Mesh Approximation ◽  
Simulation And Experiment

In 3-axis NC machining, most algorithms of the sculptured surface tool-path generation are valid for ball-cutter, and the axes are designed to realize pure translation. A tool-path generation algorithm using taper-cuter is proposed in this article. And one axis of the 3-axis NC tool machine is designed to realize swing motion. The Stereo Lithography (STL) model is the most popular triangular mesh approximation of the 3D surface model. Considering the special swing mechanical and taper-cutter, arc-zigzag tool-path planning and deform Z-map grid methods are proposed, which incorporate triangular vertexes method and the Z-map method. Finally, some simulation and experiment results are provided.

Sign in / Sign up

Export Citation Format

Share Document