Naslov
On the Efficiency of the GAP-Algorithm on Planar 3-TPc Problem

Autori
Dušak, Vesna

Izvornik
Proceedings of the 13th International Conference on Iformation Technology Interfaces ITI '91, Cavtat (1330-1012) 1 (1991); 441-446

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
Degenerated Transportation Problem; GAP - algorithm; Simulation

Sažetak
The Transportation Problem of linear programming often have a degenerated basis solution. It provides a decomposition of the basic spanning tree because several alternating bases may appear from the same exstreme point. The construction of the GAP - base may help in proces of searching the flow which will strung subgraphs to the unique basis tree structure. The General Alternating Path Algorithm (GAP - algorithm) for a Capacitated Transportation Problem establishes the unique basis tree in a special way and avoids zero-steps. The characteristics of a Three - index Capacitated Transportation Problem (3-TPc problem) and the possible aplication of the GAP - algorithm to the solution of that problem are described in this article. Olso, in article is discused the efficiency of the GAP - algorithm for a plannar 3 - TPc problem with input parameters gived by simulation.

Izvorni jezik
Engleski

Znanstvena područja
Informacijske i komunikacijske znanosti

POVEZANOST RADA