В статье определена зависимость между конкурентной стратегией и оперативным уровнем управления логистической системой предприятия. Представлено решение...

In this paper, we develop a simple algorithm for obtaining the global solution to a small scale fixed-charge transportation problem (FCTP). The procedure itself is very quick. The proposed method solves FCTP by decomposing the problem into series of smaller sub-problems, which is novel and can...

The problem of finding an appropriate transportation plan for a transport company collaborating with a window manufacturer to reduce transport costs by minimizing the total distance travelled and provide a minimum car fleet is presented in this paper. The problem involves 3 major manufacturing...

This paper considers the Red–Blue Transportation Problem (Red–Blue TP), a generalization of the transportation problem where supply nodes are partitioned into two sets and so-called exclusionary constraints are imposed. We encountered a special case of this problem in a hospital context,...

In this note we investigate the computational complexity of the transportation problem with a permutable demand vector, TP-PD for short. In the TP-PD, the goal is to permute the elements of the given integer demand vector b=(b 1 ,…,b n ) in order to minimize the overall transportation costs....

In this note we investigate the computational complexity of the transportation problem with a permutable demand vector, TP-PD for short. In the TP-PD, the goal is to permute the elements of the given integer demand vector b=(b <Subscript>1</Subscript>,…,b <Subscript>n</Subscript>) in order to minimize the overall transportation costs....</subscript></subscript>

We consider two person zero-sum repeated games with lack of information on one side and with payoffs of special “separable” form. The solutions for these games are reduced to the solutions for families of special transportation type problems with recursive structure. We illustrate our...

LetG=(U,V,E) be a bipartite graph with weights of its edgesc <Subscript> ij </Subscript>. For the assignment and transportation problem given by such a graph we propose efficient procedures for partitioning the edge setE into three classes:E <Subscript>o</Subscript> is the set of edgesij withx <Subscript> ij </Subscript>=0 for each optimum solution (0-persistent...</subscript></subscript></subscript>

Transportation Problem (TP) is one of the basic operational research problems, which plays an important role in many practical applications. In this paper, a bio-inspired mathematical model is proposed to handle the Linear Transportation Problem (LTP) in directed networks by modifying the...