scholarly journals Timetable Design for Minimizing Passenger Travel Time and Congestion for a Single Metro Line

2018 ◽  
Vol 30 (1) ◽  
pp. 21-33 ◽  
Author(s):  
Yi Shen ◽  
Gang Ren ◽  
Yang Liu
Keyword(s):  
Travel Time ◽  
Optimization Problem ◽  
Programming Model ◽  
Optimization Method ◽  
Flow State ◽  
Passenger Travel ◽  
Operation Period ◽  
Recursive Optimization ◽  
Timetable Optimization ◽  
Dependent Demand

This paper brings a proposal for a timetable optimization model for minimizing the passenger travel time and congestion for a single metro line under time-dependent demand. The model is an integer-programming model that systemically considers the passenger travel time, the capacity of trains, and the capacity of platforms. A multi-objective function and a recursive optimization method are presented to solve the optimization problem. Using the model we can obtain an efficient timetable with minimal passenger travel time and minimal number of congestion events on platforms. Moreover, by increasing the number of dispatches, the critical point from congestion state to free-flow state and the optimal timetable with minimal cost for avoiding congestion on platforms can be obtained. The effectiveness of the model is evaluated by a real example. A half-regular timetable with fixed headways in each operation period and an irregular timetable with unfixed headway are investigated for comparison.

scholarly journals Stop Plan of Express and Local Train for Regional Rail Transit Line

2018 ◽  
Vol 2018 ◽  
pp. 1-11 ◽  
Author(s):  
Qin Luo ◽  
Yufei Hou ◽  
Wei Li ◽  
Xiongfei Zhang
Keyword(s):  
Energy Consumption ◽  
Travel Time ◽  
Programming Model ◽  
Urban Rail Transit ◽  
Rail Transit ◽  
Long Distance ◽  
Passenger Travel ◽  
Urban Rail ◽  
Proposed Model ◽  
Rail Line

The urban rail transit line operating in the express and local train mode can solve the problem of disequilibrium passenger flow and space and meet the rapid arrival demand of long-distance passengers. In this paper, the Logit model is used to analyze the behavior of passengers choosing trains by considering the sensitivity of travel time and travel distance. Then, based on the composition of passenger travel time, an integer programming model for train stop scheme, aimed at minimizing the total passenger travel time, is proposed. Finally, combined with a certain regional rail line in Shenzhen, the plan is solved by genetic algorithm and evaluated through the time benefit, carrying capacity, and energy consumption efficiency. The simulation result shows that although the capacity is reduced by 6 trains, the optimized travel time per person is 10.34 min, and the energy consumption is saved by about 16%, which proves that the proposed model is efficient and feasible.

scholarly journals Optimizing Lock Operations and Ship Arrivals through Multiple Locks on Inland Waterways

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Hongxu Guan ◽  
Yanmin Xu ◽  
Longhao Li ◽  
Xin Huang
Keyword(s):  
Optimization Problem ◽  
Programming Model ◽  
Waiting Times ◽  
Optimization Method ◽  
Mixed Integer ◽  
Neighborhood Search ◽  
Large Neighborhood Search ◽  
Inland Waterways ◽  
Information Availability ◽  
Inland Waterway

Locks are important components of a waterway system. To improve the efficiency of inland waterway transport, it is important to ensure ships passing locks without having to spend unnecessary waiting times at lock entrances. Meanwhile, with the trends towards digitalized and smart waterways, it is also worth investigating how the information availability could contribute to optimizing lock operations and ship arrivals on inland waterways. Therefore, this paper proposes an optimization method to schedule ships’ arrivals and their placements in locks on inland waterways, based on a mixed-integer programming model, and solves the optimization problem with large neighborhood search based heuristics. The optimization objective is threefold: first, optimizing the arrival sequence of ships at the locks; second, maximize the utilization of each lockage operation; and third, reducing the overall time that each ship spends from entering the waterway area till leaving the last lock on the waterway. Simulations are carried out to evaluate the performance of the proposed method.

scholarly journals An Optimization Method of Passenger Assignment for Customized Bus

2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Yang Cao ◽  
Jian Wang
Keyword(s):  
Travel Time ◽  
Waiting Time ◽  
Optimization Problem ◽  
Economic Cost ◽  
Optimization Method ◽  
Urban China ◽  
Simulation Based ◽  
Average Travel Time ◽  
Passenger Assignment ◽  
Near Future

This study proposes an optimization method of passenger assignment on customized buses (CB). Our proposed method guarantees benefits to passengers by balancing the elements of travel time, waiting time, delay, and economic cost. The optimization problem was solved using a Branch and Bound (B&B) algorithm based on the shortest path for the selected stations. A simulation-based evaluation of the proposed optimization method was conducted. We find that a CB service can save 38.33% in average travel time, 38.33% in average waiting time, and 27.78% in delay penalties, all at an acceptable ticket price. The variations are caused by different degrees of busload. A detailed investigation revealed that a CB can significantly reduce travel time, waiting time, and delays, with the degree of benefits showing a decreasing trend with corresponding increases in busload. This finding indicates that CBs with smaller busloads can more flexibly transport passengers and provide a greater level of benefits. At the same time, a small busload strategy can be implemented more easily and in the near future on a test basis in urban China areas.

scholarly journals Optimization Method of Customized Shuttle Bus Lines under Random Condition

Algorithms ◽  
2021 ◽  
Vol 14 (2) ◽  
pp. 52
Author(s):  
Zhichao Sun ◽  
Kang Zhou ◽  
Xinzheng Yang ◽  
Xiao Peng ◽  
Rui Song
Keyword(s):  
Travel Time ◽  
Travel Demand ◽  
Operating Cost ◽  
Optimization Method ◽  
Routing Problem ◽  
Hybrid Intelligent Algorithm ◽  
Passenger Travel ◽  
Time Requirements ◽  
The Cost ◽  
Stochastic Constraints

Transit network optimization can effectively improve transit efficiency, improve traffic conditions, and reduce the pollution of the environment. In order to better meet the travel demands of passengers, the factors influencing passengers’ satisfaction with a customized bus are fully analyzed. Taking the minimum operating cost of the enterprise as the objective and considering the random travel time constraints of passengers, the customized bus routes are optimized. The K-means clustering analysis is used to classify the passengers’ needs based on the analysis of the passenger travel demand of the customized shuttle bus, and the time stochastic uncertainty under the operating environment of the customized shuttle bus line is fully considered. On the basis of meeting the passenger travel time requirements and minimizing the cost of service operation, an optimization model that maximizes the overall satisfaction of passengers and public transit enterprises is structured. The smaller the value of the objective function is, the lower the operating cost. When the value is negative, it means there is profit. The model is processed by the deterministic processing method of random constraints, and then the hybrid intelligent algorithm is used to solve the model. A stochastic simulation technique is used to train stochastic constraints to approximate uncertain functions. Then, the improved immune clonal algorithm is used to solve the vehicle routing problem. Finally, it is proved by a case that the method can reasonably and efficiently realize the optimization of the customized shuttle bus lines in the region.

The Improvement of Newton Method and the Validation of Optimization Idea of Blind Walking Repeatedly

2011 ◽  
Vol 250-253 ◽  
pp. 4061-4064
Author(s):  
Chun Ling Zhang
Keyword(s):  
Saddle Point ◽  
Newton Method ◽  
Optimization Problem ◽  
Initial Point ◽  
Optimization Method ◽  
Maximum Point ◽  
Optimal Result ◽  
Feasible Domain ◽  
Parallel Arithmetic ◽  
Newton Direction

The existence of maximum point, oddity point and saddle point often leads to computation failure. The optimization idea is based on the reality that the optimum towards the local minimum related the initial point. After getting several optimal results with different initial point, the best result is taken as the final optimal result. The arithmetic improvement of multi-dimension Newton method is improved. The improvement is important for the optimization method with grads convergence rule or searching direction constructed by grads. A computational example with a saddle point, maximum point and oddity point is studied by multi-dimension Newton method, damped Newton method and Newton direction method. The importance of the idea of blind walking repeatedly is testified. Owing to the parallel arithmetic of modernistic optimization method, it does not need to study optimization problem with seriate feasible domain by modernistic optimization method.

scholarly journals Optimal Placement and Sizing of D-STATCOM in Radial and Meshed Distribution Networks Using a Discrete-Continuous Version of the Genetic Algorithm

Electronics ◽  
2021 ◽  
Vol 10 (12) ◽  
pp. 1452
Author(s):  
Cristian Mateo Castiblanco-Pérez ◽  
David Esteban Toro-Rodríguez ◽  
Oscar Danilo Montoya ◽  
Diego Armando Giral-Ramírez
Keyword(s):  
Genetic Algorithm ◽  
Objective Function ◽  
Programming Model ◽  
Distribution Networks ◽  
Optimization Method ◽  
Optimal Placement ◽  
Mixed Integer ◽  
Power Balance ◽  
Continuous Version ◽  
Discrete Part

In this paper, we propose a new discrete-continuous codification of the Chu–Beasley genetic algorithm to address the optimal placement and sizing problem of the distribution static compensators (D-STATCOM) in electrical distribution grids. The discrete part of the codification determines the nodes where D-STATCOM will be installed. The continuous part of the codification regulates their sizes. The objective function considered in this study is the minimization of the annual operative costs regarding energy losses and installation investments in D-STATCOM. This objective function is subject to the classical power balance constraints and devices’ capabilities. The proposed discrete-continuous version of the genetic algorithm solves the mixed-integer non-linear programming model that the classical power balance generates. Numerical validations in the 33 test feeder with radial and meshed configurations show that the proposed approach effectively minimizes the annual operating costs of the grid. In addition, the GAMS software compares the results of the proposed optimization method, which allows demonstrating its efficiency and robustness.

Parameter study and optimization design of a hat oblique tunnel portal

2021 ◽  
pp. 095440972110140
Author(s):  
Zijian Guo ◽  
Tanghong Liu ◽  
Wenhui Li ◽  
Yutao Xia
Keyword(s):  
High Speed ◽  
Optimization Design ◽  
Pareto Front ◽  
Optimization Problem ◽  
Optimization Method ◽  
Design Parameters ◽  
Parameter Study ◽  
Buffer Structure ◽  
Tunnel Entrance ◽  
The Ideal

The present work focuses on the aerodynamic problems resulting from a high-speed train (HST) passing through a tunnel. Numerical simulations were employed to obtain the numerical results, and they were verified by a moving-model test. Two responses, [Formula: see text] (coefficient of the peak-to-peak pressure of a single fluctuation) and[Formula: see text] (pressure value of micro-pressure wave), were studied with regard to the three building parameters of the portal-hat buffer structure of the tunnel entrance and exit. The MOPSO (multi-objective particle swarm optimization) method was employed to solve the optimization problem in order to find the minimum [Formula: see text] and[Formula: see text]. Results showed that the effects of the three design parameters on [Formula: see text] were not monotonous, and the influences of[Formula: see text] (the oblique angle of the portal) and [Formula: see text] (the height of the hat structure) were more significant than that of[Formula: see text] (the angle between the vertical line of the portal and the hat). Monotonically decreasing responses were found in [Formula: see text] for [Formula: see text] and[Formula: see text]. The Pareto front of [Formula: see text] and[Formula: see text]was obtained. The ideal single-objective optimums for each response located at the ends of the Pareto front had values of 1.0560 for [Formula: see text] and 101.8 Pa for[Formula: see text].

Development and Evaluation of Cooperative Intersection Management Algorithm under Connected and Automated Vehicles Environment

2021 ◽  
pp. 036119812199458
Author(s):  
Slobodan Gutesa ◽  
Joyoung Lee ◽  
Dejan Besenski
Keyword(s):  
Travel Time ◽  
Information Exchange ◽  
Fixed Time ◽  
Optimization Method ◽  
Time Signal ◽  
Market Penetration ◽  
Automated Vehicles ◽  
Automated Driving ◽  
Concept Evaluation ◽  
Intersection Management

Recent technological advancements in the automotive and transportation industry established a firm foundation for development and implementation of various connected and automated vehicle solutions around the globe. Wireless communication technologies such as the dedicated short-range communication protocol are enabling information exchange between vehicles and infrastructure. This research paper introduces an intersection management strategy for a corridor with automated vehicles utilizing vehicular trajectory-driven optimization method. Trajectory-Driven Optimization for Automated Driving provides an optimal trajectory for automated vehicles based on current vehicle position, prevailing traffic, and signal status on the corridor. All inputs are used by the control algorithm to provide optimal trajectories for automated vehicles, resulting in the reduction of vehicle delay along the signalized corridor with fixed-time signal control. The concept evaluation through microsimulation reveals that, even with low market penetration (i.e., less than 10%), the technology reduces overall travel time of the corridor by 2%. Further increase in market penetration produces travel time and fuel consumption reductions of up to 19.5% and 22.5%, respectively.

Sign in / Sign up

Export Citation Format

Share Document