In this paper, we propose an O(n) time algorithm for the Hitchcock transportation problem with n demand points and xed number of supply points. When the number of supply points is very small and the number of demand points is much larger than that of supply points, our algorithm is e cient. If we have m supply points, the time complexity of our algorithm is bounded by O((m!) 2 n) .

In this study criterion of maximum profit intensity for transportation problems, in contrast to the known criteria of minimum expenses or minimum time for transportation, is considered. This criterion synthesizes financial and time factors and has real economic sense. According to the purpose of this paper, the algorithm of the solution of such a transportation problem is constructed. It is sho...

In this paper, an application of real-coded Genetic Algorithm (RCGA) for integer linear programming in a production-transportation problem has been discussed. In this discussion, firstly, the model has been developed under the assumption that a company produces a single commodity in different factories, situated at different places. The raw material cost, production cost as well as marketing co...

In this paper a tolls and transit frequencies optimization problem has been reduced to a specific equivalent equilibrium assignment problem and its local solution conditions have been stated. A specific fixed-point approach algorithm has also been devised, introducing a hyper-network consisting of a multi-modal transportation network combined with a specific investment network. Based on a test ...

The linear multiobjective transportation problem is a special type of vector minimum problem in which constraints are all equality type and the objectives are conicting in nature. This paper presents an application of fuzzy goal programming to the linear multiobjective transportation problem. In this paper, we use a special type of nonlinear (hyperbolic and exponential) membership functions to ...

we introduce an implicit method for nding a common element of the set of solutions of systems of equilibrium problems and the set of common xed points of a sequence of nonexpansive mappings and a representation of nonexpansive mappings. then we prove the strong convergence of the proposed implicit schemes to the unique solution of a variational inequality, which is the optimality condition fo...