New Approach to Find Initial Basic Feasible Solution (IBFS) for Optimal Solution in Transportation Problem

Minimizing transportation time and getting optimal solutions are always considered as important factors while solving transportation problem. This paper shows a new approach for finding initial basic solution for transportation problem which reduces cost of transportation more than any transportation method such as LCM, northwest, Vogel’s approximation and so on. This method has been illustrated by taking an example;afterwards, it compares basic initial feasible solution with other methods IBF and optimal dictate solutions such as MODI and Steppingstone method.

An Effective Approach to Determine an Initial Basic Feasible Solution: A TOCM-MEDM Approach

Transportation of products from sources to destinations with minimal total cost plays an important role in logistics and supply chain management. In this article, a new and effective algorithm is introduced for finding an initial basic feasible solution of a balanced transportation problem. Number of numerical illustration is introduced and optimality of the result is also checked. Comparison of findings obtained by the new heuristic and the existing heuristics show that the method presented herein gives a better result.

A Comparative Study of Initial Basic Feasible Solution by a Least Cost Mean Method (LCMM) of Transportation Problem

Transportation Problems (TP), as is known, are a basic network problem which can be formulated as a Linear Programming Problem (LPP). Transportation networks are built up in order to save transportation cost. In the solution procedure of a TP, finding an Initial Basic Feasible Solution (IBFS) is necessary to obtain the optimal solution. Optimality gives us the optimal route that prompts either most extreme benefit or least aggregate cost whichever is required. In this research paper, a new method named Least Cost Mean Method is proposed to obtain a better IBFS where row penalty and column penalty is brought out by the mean of lowest and next lowest cost of each row and each column of the cost matrix. The method is illustrated with numerical examples. To verify the performance of the proposed method, a comparative study is also carried out and observed that it is computationally easier and yielding comparatively better solution.

Analysis of the Impact of Optimal Solutions to the Transportation Problems for Variations in Cost Using Two Reliable Approaches

In this paper, we have used two reliable approaches (theorems) to find the optimal solutions to transportation problems, using variations in costs. In real-life scenarios, transportation costs can fluctuate due to different factors. Finding optimal solutions to the transportation problem in the context of variations in cost is vital for ensuring cost efficiency, resource allocation, customer satisfaction, competitive advantage, environmental responsibility, risk mitigation, and operational fortitude in practical situations. This paper opens up new directions for the solution of transportation problems by introducing two key theorems. By using these theorems, we can develop an algorithm for identifying the optimal solution attributes and permitting accurate quantification of changes in overall transportation costs through the addition or subtraction of constants to specific rows or columns, as well as multiplication by constants inside the cost matrix. It is anticipated that the two reliable techniques presented in this study will provide theoretical insights and practical solutions to enhance the efficiency and cost-effectiveness of transportation systems. Finally, numerical illustrations are presented to verify the proposed approaches.

Solution with Singularity of Order One for Singular Integral Equation with Hilbert Kernal

The basic sets of solutions in classH(orH *) for the characteristic equation and its adjoint equation with Hilbert kernel are given respectively. Thus the expressions of solutions and its solvable conditions are simplified. On this basis the solutions and the solvable conditions in classH 1 * as well as the generalized Noether theorem for the complete equation are obtained. Key words Hilbert kernel - solution with singularity of order one - basic set of solutions - Noether theorem - characteristic equation and its adjoint equation CLC number O 175.5 Foundation item: Supported by the National Natural Science Foundation of China (19971064) and Ziqiang Invention Foundation of Wuhan University (201990336)Biography: Zhong Shou-guo(1941-), male, Professor, research direction: singular integral equations and their applications.

A Simplified Scheme of the Generalized Layered Radiative Transfer Model

In this paper, firstly, a simplified version （SGRTM） of the generalized layered radiative transfer model （GRTM） within the canopy, developed by us, is presented. It reduces the information requirement of inputted sky diffuse radiation, as well as of canopy morphology, and in turn saves computer resources. Results from the SGRTM agree perfectly with those of the GRTM. Secondly, by applying the linear superposition principle of the optics and by using the basic solutions of the GRTM for radiative transfer within the canopy under the condition of assumed zero soil reflectance, two sets of explicit analytical solutions of radiative transfer within the canopy with any soil reflectance magnitude are derived： one for incident diffuse, and the other for direct beam radiation. The explicit analytical solutions need two sets of basic solutions of canopy reflectance and transmittance under zero soil reflectance, run by the model for both diffuse and direct beam radiation. One set of basic solutions is the canopy reflectance αf （written as α1 for direct beam radiation） and transmittance βf （written as β1 for direction beam radiation） with zero soil reflectance for the downward radiation from above the canopy （i.e. sky）, and the other set is the canopy reflectance （αb） and transmittance βb for the upward radiation from below the canopy （i.e., ground）. Under the condition of the same plant architecture in the vertical layers, and the same leaf adaxial and abaxial optical properties in the canopies for the uniform diffuse radiation, the explicit solutions need only one set of basic solutions, because under this condition the two basic solutions are equal, i.e., αf = αb and βf = βb. Using the explicit analytical solutions, the fractions of any kind of incident solar radiation reflected from （defined as surface albedo, or canopy reflectance）, transmitted through （defined as canopy transmittance）, and absorbed by （defined as canopy absorptance） the canopy and other properties pertinent to the radiative transfer within the canopy can be estimated easily on the ground surface below the canopy （soil or snow surface） with any reflectance magnitudes. The simplified transfer model is proven to have a similar accuracy compared to the detailed model, as well as very efficient computing.

Two-phase Method without Any Artificial Variable

A method is provided to achieve an initial basic feasible solution of a linear programming in this paper. This method dose not need introducing any artificial variable, but needs only solving an auxiliary linear programming. Compared with the traditional two-phase method, it has advantages of saving the memories and reducing the computational efforts.

RECIPROCAL THEOREM METHOD FOR THE FORCED VIBRATIONOF ELASTIC THICK RECTANGULAR PLATES

In this paper, reciprocal theorem method (RTM) is generalized to solve the problems for the forced vibration of thick rectangular plates based on the Reissner's theory. The paper derives the dynamic basic solution of thick rectangular; and the exact analytical solution of the steady-state responses of thick rectangular plates with three clamped edges and one free edge under harmonic uniformly distributed disturbing forces is found by RTM. It is regarded as a simple, convenient and general method for calculating the steady-stare responses of forced vibration of thick rectangular plates.

Incessant Allocation Method for Solving Transportation Problems

Industries require planning in transporting their products from production centres to the users end with minimal transporting cost to maximize profit. This process is known as Transportation Problem which is used to analyze and minimize transportation cost. This problem is well discussed in operation research for its wide application in various fields, such as scheduling, personnel assignment, product mix problems and many others, so that this problem is really not confined to transportation or distribution only. In the solution procedure of a transportation problem, finding an initial basic feasible solution is the prerequisite to obtain the optimal solution. Again, development is a continuous and endless process to find the best among the bests. The growing complexity of management calls for development of sound methods and techniques for solution of the problems. Considering these factors, this research aims to propose an algorithm “Incessant Allocation Method” to obtain an initial basic feasible solution for the transportation problems. Several numbers of numerical problems are also solved to justify the method. Obtained results show that the proposed algorithm is effective in solving transportation problems.

Reciprocal Theorem Method for Solving the Problems of Bending of Thick

In this paper,reciprocal theorem method(RTM) is generalized to solve theof bending of thick rectangular plates based on Reissner’s theory.First,the paper gives the basic solution of the bending of thick rectangular platesand then the exact analytical solution of the bending of thick rectangular plate withthree clamped edges and one free edge under umiformly distributed load is found byRTM, finally, we analyze numerical results of the sohution.

A New Approach to Solve Transportation Problems

Finding an initial basic feasible solution is the prime requirement to obtain an optimal solution for the transportation problems. In this article, a new approach is proposed to find an initial basic feasible solution for the transportation problems. The method is also illustrated with numerical examples.

A Note on a Generalized Network Flow Model for Manufacturing Process

Manufacturing network flow （MNF） is a generalized network model that overcomes the limitation of an ordinary network flow in modeling more complicated manufacturing scenarios, in particular the synthesis of different materials into one product and/or the distilling of one type of material into many different products. Though a network simplex method for solving a simplified version of MNF has been outlined in the literature, more research work is still needed to give a complete answer whether some classical duality and optimality results of the classical network flow problem can be extended in MNF. In this paper, we propose an algorithmic method for obtaining an initial basic feasible solution to start the existing network simplex algorithm, and present a network-based approach to checking the dual feasibility conditions. These results are an extension of those of the ordinary network flow problem.