András Bakó

24723651900

Publications - 11

Development of a sustainable optimization model for the rehabilitation of transport infrastructure

András Bakó L. Gaspar

Publication Name: Acta Polytechnica Hungarica

Publication Date: 2018-01-01

Volume: 15

Issue: 1

Page Range: 11-33

Description:

About twenty years ago, the research activities aiming at the development of the optimal maintenance and rehabilitation strategies (models) of roads and bridges started in several countries, including Hungary. In the first foreign models, the deterioration depending on time and other parameters was given by Markov transition probability matrices. Due to the inaccuracies and inconsistencies of earlier models, a continuous model upgrading could have been carried out by many researchers world-wide. Besides, basically new models appeared in the literature, which are able to describe the actual processes more reliably. The research work of the authors of the paper has concentrated on Pavement Management Systems (PMSs) and Bridge Management Systems (BMSs). Since a common financing of roads and bridges is typical, a combined model of road pavement and bridge managements was developed by the authors increasing considerably the efficient use of available funds.

Open Access: Yes

DOI: 10.12700/APH.15.1.2018.1.2

Calibration of Leontief Input/Output table parameters

J. Gáti András Bakó A. Szeghegyi L. Gaspar

Publication Name: Ines 2013 IEEE 17th International Conference on Intelligent Engineering Systems Proceedings

Publication Date: 2013-12-12

Volume: Unknown

Issue: Unknown

Page Range: 183-186

Description:

Leontief Input/Output tables are widely used for solving various economic problems. This algorithm predicts the effect of changes in an economy sector on others. The same model can also be used for solving traffic forecasting problems. The solution algorithm applied is the so-called RAS one where a certain exponential opposition function is used. A simple and fast algorithm for the determination of the parameters of this opposition function will be presented. © 2013 IEEE.

Open Access: Yes

DOI: 10.1109/INES.2013.6632807

Fast algorithm to solve the most economical path problem in sparse matrices

Kornélia Ambrus-Somogyi J. Gáti András Bakó P. Földesi

Publication Name: Ines 2012 IEEE 16th International Conference on Intelligent Engineering Systems Proceedings

Publication Date: 2012-10-01

Volume: Unknown

Issue: Unknown

Page Range: 335-339

Description:

Several variations exist of the shortest path problem depending on the type of the graph. The most common problems are the shortest path problem between two points and between every pair of points (the so called multiterminal minimal path problem). Beside this several other variations are known. One of them is the shortest path in a network having gains, the time dependent path, the shortest path in a network, where the travelling time depends on the actual traffic flow. In this paper a powerful algorithm is presented in large scale, sparse network. In long term road network planning problem sometimes the size of the network is very large - about hundred thousand. The network is usually sparse, one point is connected with average 3 or 4 points. It will be shown that the presented algorithm in this case is much more powerful. © 2012 IEEE.

Open Access: Yes

DOI: 10.1109/INES.2012.6249854

Optimization model of maintenance of engineering structures

Kornélia Ambrus-Somogyi András Bakó

Publication Name: Ines 2011 15th International Conference on Intelligent Engineering Systems Proceedings

Publication Date: 2011-08-22

Volume: Unknown

Issue: Unknown

Page Range: 73-76

Description:

In the PhD dissertation [6] optimization models were developed for the pavement management system, which could help planning the optimal maintenance work. This model can be generalized for those engineering structures, where there are several types of structures and for each structure there are many components with many different types of deterioration options and duty uses. The condition of application is: the deterioration of certain components not only depends on time, but on the extent of use. In this paper we would like to present the development of Engineering Structures Management System, the different models, and furthermore a practical application the deterioration model of car parts and the planning of their maintenance. © 2011 IEEE.

Open Access: Yes

DOI: 10.1109/INES.2011.5954722

A solution method for solving I/O and O/D tables

András Bakó P. Földesi István Szüts

Publication Name: Ines 2010 14th International Conference on Intelligent Engineering Systems Proceedings

Publication Date: 2010-07-26

Volume: Unknown

Issue: Unknown

Page Range: 195-198

Description:

The Origin-Destination (O/D) matrix is intensively used in long term traffic network planning. The matrix is used for forecasting the future traffic between the sections and for distributing the traffic. Several methods are known as a solution for this problem. In this paper it is shown that all these methods can be solved by the RAS algorithm. Furthermore we present the Input-Output table problem which also can be solved by this RAS method. © 2010 IEEE.

Open Access: Yes

DOI: 10.1109/INES.2010.5483850

Transportation network realization with an optimization method

Tamás Hartványi András Bakó István Szüts

Publication Name: Isciii 09 4th International Symposium on Computational Intelligence and Intelligent Informatics Proceedings

Publication Date: 2009-12-28

Volume: Unknown

Issue: Unknown

Page Range: 81-84

Description:

In connection with the network realization problem the main questions of the algorithm are which edges to choose and what is the budget consequence of that. These problems can be solved by exact optimization methods, but in this case the number of computational steps (additions and comparisons) is an exponential function of the number of nodes. For this reason usually heuristic methods are chosen for solving these problems. Some special problems can be formulated as maximal flow problems. To get the solution we use only maximal flow and shortest route algorithms. Thus we decrease the number of computations, but the size of the network will grow. In this paper we describe this algorithm to solve the network realization problem. Then we give a transportation network realization problem and show how to solve this problem by the some algorithms. © 2009 IEEE.

Open Access: Yes

DOI: 10.1109/ISCIII.2009.5342277

Determination the basic network algorithms with gains

András Bakó P. Földesi István Szüts

Publication Name: Studies in Computational Intelligence

Publication Date: 2009-12-01

Volume: 243

Issue: Unknown

Page Range: 447-456

Description:

Several optimalization algorithms have been proposed for the solution of the basic network flow algorithms, such as the minimal and the multiterminal minimal path of a network having cost (distance) function, maximal flow of a capacitated network. In this paper we present these algorithms in a special network in which on the edges a gain function is given. On the edge (x,y) of the network a t(x,y) transportation cost is defined. In the course of the transportation on the edge (x,y) the goods loose a part of there weight. If one unit of goods is transported from point x to point y then k(x,y) unite of goods arrive at point y, where 0

Open Access: Yes

DOI: 10.1007/978-3-642-03737-5_32

Special network algorithms with gains

Tamás Hartványi András Bakó István Szüts

Publication Name: Proceedings 2009 International Conference on Intelligent Engineering Systems Ines 2009

Publication Date: 2009-11-02

Volume: Unknown

Issue: Unknown

Page Range: 155-158

Description:

Several optimalization algorithms have been proposed for the solution the minimal and the multiterminal minimal path of a network having cost (distance) function. In this paper we present these algorithms in a special network in which on the edges a gain function is given. On the edge (x,y) of the network a t(x,y) transportation cost is defined. In the course of the transportation on the edge (x,y) the goods loose a part of there weight. If one unit of goods is transported from point x to point y then k(x,y) unite of goods arrive at point y, where 0

Open Access: Yes

DOI: 10.1109/INES.2009.4924754

Traffic Dependent Pavement Management Algorithm

Kornélia Ambrus-Somogyi András Bakó Lajos Tóth

Publication Name: 2006 IEEE International Conference on Computational Cybernetics Iccc

Publication Date: 2006-12-01

Volume: Unknown

Issue: Unknown

Page Range: Unknown

Description:

The Road Management Systems (and the PMS) usually do not take into consideration the future traffic change. The maintenance and rehabilitation actions and the development of the road network structure and the changing traffic structure modify the amount of the traffic on the road section. The deterioration process depends on mostly the volume of the traffic. That is why it is important to take into consideration the change of the traffic volume during the planning time horizon. In the lecture some techniques are shown which handle this problem: in multiperiod, long time model at each planning period the traffic volume change is take into consideration.In ranking models the problem could be handled and solved. In the case of one period Markov stabile model there is nothing to do. In the multiperiod model the problem could be solved also.

Open Access: Yes

DOI: 10.1109/ICCCYB.2006.305740

An optimization model for maintenance of engineering structures

Kornélia Ambrus-Somogyi András Bakó

Publication Name: Iccc 2005 IEEE 3rd International Conference on Computational Cybernetics Proceedings

Publication Date: 2005-12-01

Volume: 2005

Issue: Unknown

Page Range: 265-268

Description:

With the recognition that the engineering structures maintenance and repair needs far exceed the rescourses available to adress these needs, many firms have to turned to the development of ESMS (Enginnering Structures Management System) as a method to improve the allocation of these limited resources and the condition of their engineering structures. The paper provides an overviev of the need for ESMS. The concepts of level-of-service goals for functional adequacy, deterioration modeling and the relation of structural adequancy and optimization strategies for rescource allocation.

Open Access: Yes

DOI: 10.1109/ICCCYB.2005.1511584

Optimal life-time maintenance policy and deterioration process

András Bakó Lajos Tóth

Publication Name: Ines 05 IEEE 9th International Conference on Intelligent Engineering Systems Proceedings

Publication Date: 2005-01-01

Volume: 2005

Issue: Unknown

Page Range: 229-232

Description:

With the recognition that the engineering structures maintenance and repair needs far exceed the rescourses available to adress these needs, many firms have to turned to the development of ESMS (Enginnering Structures Management System) as a method to improve the allocation of these limited resources and the condition of their engineering structures. The ESMS is based on performance modelingbecause of without the actual condition of the structures and the future deterioration process any model could not be build up. The paper provides an overviev of the need for ESMS and the posibble description of the performance modeling. © 2005 IEEE.

Open Access: Yes

DOI: 10.1109/INES.2005.1555163