The Methodology Analysis of Traffic Volume Data Processing of Regional Road Network Based on Bi-Level Programming Models

2013 ◽  
Vol 397-400 ◽  
pp. 2191-2195
Author(s):  
Xiao Li Meng ◽  
Da Wei Chen
Keyword(s):  
Genetic Algorithm ◽  
Data Processing ◽  
Shortest Path ◽  
Road Network ◽  
Programming Model ◽  
Traffic Volume ◽  
Programming Models ◽  
Traffic Planning ◽  
Volume Data ◽  
Distribution Matrix

The data processing of traffic volume is a key issue in the traffic planning. In order to solve the problem of data processing on traffic volume, the bi-level programming model built is employed to work out production-attraction value of each district and O-D distribution matrix. In this model, upper part is to calculate the minimized variance between investigated value and calculated value. While the lower part of this model aims at the fact that travelers turn to the shortest path. The upper model is solved by genetic algorithm. And the result from an example application reveals that we can obtain reasonable production-attraction value and O-D distribution matrix by this method.

Research on Printed Wiring Boards Manufacture Based on Optimization

2013 ◽  
Vol 312 ◽  
pp. 506-510
Author(s):  
Jiang Ze Hu ◽  
An Ni Peng ◽  
Xin Zhong Lu
Keyword(s):  
Genetic Algorithm ◽  
Simulated Annealing ◽  
Shortest Path ◽  
Ant Colony Algorithm ◽  
Simulated Annealing Algorithm ◽  
Programming Model ◽  
Printed Wiring Boards ◽  
Tool Switching ◽  
Annealing Algorithm ◽  
Better Than

The efficiency E of a punch for making printed wiring boards is decided by its cost and time. The weight of cost and time is different in different companies. In this paper, we establish a bi-object programming model to measure E. We use an algorithm for obtaining an order of tool switching. Considering how to calculate the shortest path for every tool, we compare three modern optimizationalgorithms. We find Ant colony Algorithm is best in computing the shortest path, but it will cost a lot of time in running. Genetic Algorithm is better than Simulated Annealing Algorithm in time and cost. We make some improvements on these algorithms.

scholarly journals Managing Traffic Data through Clustering and Radial Basis Functions

2021 ◽  
Vol 13 (5) ◽  
pp. 2846
Author(s):  
Heber Hernández ◽  
Elisabete Alberdi ◽  
Heriberto Pérez-Acebo ◽  
Irantzu Álvarez ◽  
María José García ◽  
...  
Keyword(s):  
Radial Basis Functions ◽  
Road Network ◽  
Traffic Volume ◽  
Basis Functions ◽  
Pavement Management ◽  
Volume Data ◽  
Linear Type ◽  
The Real ◽  
The Road ◽  
Radial Basis

Due to the importance of road transport an adequate identification of the various road network levels is necessary for an efficient and sustainable management of the road infrastructure. Additionally, traffic values are key data for any pavement management system. In this work traffic volume data of 2019 in the Basque Autonomous Community (Spain) were analyzed and modeled. Having a multidimensional sample, the average annual daily traffic (AADT) was considered as the main variable of interest, which is used in many areas of the road network management. First, an exploratory analysis was performed, from which descriptive statistical information was obtained continuing with the clustering by various variables in order to standardize its behavior by translation. In a second stage, the variable of interest was estimated in the entire road network of the studied country using linear-based radial basis functions (RBFs). The estimated model was compared with the sample statistically, evaluating the estimation using cross-validation and highest-traffic sectors are defined. From the analysis, it was observed that the clustering analysis is useful for identifying the real importance of each road segment, as a function of the real traffic volume and not based on other criteria. It was also observed that interpolation methods based on linear-type radial basis functions (RBF) can be used as a preliminary method to estimate the AADT.

Analisis Kinerja dan Pengaruh Pelebaran Jalan serta Pembuatan Median Jalan (Studi Kasus Jalan Temanggung Tilung Kota Palangkaraya)

2018 ◽  
Vol 7 (1) ◽  
pp. 51-60
Author(s):  
Fitri Wulandari ◽  
Nirwana Puspasari ◽  
Noviyanthy Handayani
Keyword(s):  
Data Retrieval ◽  
Service Level ◽  
Traffic Volume ◽  
Primary Data ◽  
Volume Data ◽  
Saturation Degree ◽  
The Road ◽  
Before And After ◽  
Road Widening ◽  
The Way

Jalan Temanggung Tilung is a 2/2 UD type road (two undirected two-way lanes) with a road width of 5.5 meters, which is a connecting road between two major roads, namely the RTA road. Milono and the path of G. Obos. Over time, the volume of traffic through these roads increases every year, plus roadside activities that also increase cause congestion at several points of the way. To overcome this problem, the local government carried out road widening to increase the capacity and level of road services. The study was conducted to determine the amount of traffic volume, performance, service level of the Temanggung Tilung road section at peak traffic hours before and after road widening. Data retrieval is done by the direct survey to the field to obtain primary data in the form of geometric road data, two-way traffic volume data, and side obstacle data. Performance analysis refers to the 1997 Indonesian Road Capacity Manual (MKJI) for urban roads. From the results of data processing, before increasing the road (Type 2/2 UD), the traffic volume that passes through the path is 842 pcs/hour and after road widening (Type 4/2 UD) the traffic volume for two directions is 973 pcs/hour, with route A equaling 528 pcs/hour and direction B equaling 445 pcs/hour. Based on the analysis of road performance before road enhancement, the capacity = 2551 pcs/hour, saturation degree = 0.331, and the service level of the two-way road are level B. Based on the analysis of the performance of the way after increasing the way, the direction capacity A = 2686 pcs/hour and direction B = 2674 pcs /hour, saturation degree for direction A = 0.196 and direction B = 0.166, service level for road direction A and direction B increase to level A

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.

Application of Genetic Algorithm in modeling of Shortest Path problem

2020 ◽  
Author(s):  
Zhihui Yang ◽  
Huiwen Xia ◽  
Fuwen Su ◽  
Jiayu Zhao ◽  
Fan Feng
Keyword(s):  
Genetic Algorithm ◽  
Shortest Path ◽  
Shortest Path Problem
Sign in / Sign up

Export Citation Format

Share Document