István Szüts

35106125600

Publications - 4

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