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 tran...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.展开更多
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 dif...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.展开更多
With a brief review of the ESP (English for Special Purpose) teaching in Medical Schools over the past 30 years, this paper elaborates on the changes and situation of English teaching and leaming in some Medical Sch...With a brief review of the ESP (English for Special Purpose) teaching in Medical Schools over the past 30 years, this paper elaborates on the changes and situation of English teaching and leaming in some Medical Schools. Through a survey which throws light on the importance of ESP, the paper analyzes the problems facing Medical Schools, such as materials suitable for medical students who want to cultivate their ability in listening, speaking, reading, writing and translating in their own field and teachers who are supposed to be qualified for medical English teaching, and then discusses the top priorities in these Medical Schools and examines what has been done and will be done in order to work out practicable approaches to meet the requirements of medical students.展开更多
The traveling salesman problem (TSP) is a classical optimization problem and it is one of a class of NP- Problem. This paper presents a new method named multiagent approach based genetic algorithm and ant colony sys...The traveling salesman problem (TSP) is a classical optimization problem and it is one of a class of NP- Problem. This paper presents a new method named multiagent approach based genetic algorithm and ant colony system to solve the TSP. Three kinds of agents with different function were designed in the multi-agent architecture proposed by this paper. The first kind of agent is ant colony optimization agent and its function is generating the new solution continuously. The second kind of agent is selection agent, crossover agent and mutation agent, their function is optimizing the current solutions group. The third kind of agent is fast local searching agent and its function is optimizing the best solution from the beginning of the trial. At the end of this paper, the experimental results have shown that the proposed hybrid ap proach has good performance with respect to the quality of solution and the speed of computation.展开更多
The present work deals with the calculation of transition probability between two diabatic potentials coupled by any arbitrary coupling. The method presented in this work is applicable to any type of coupling while fo...The present work deals with the calculation of transition probability between two diabatic potentials coupled by any arbitrary coupling. The method presented in this work is applicable to any type of coupling while for numerical calculations we have assumed the arbitrary coupling as Gaussian coupling. This arbitrary coupling is expressed as a collection of Dirac delta functions and by the use of the transfer matrix technique the transition probability from one diabatic potential to another diabatic potential is calculated. We examine our approach by considering the case of two constant potentials coupled by Gaussian coupling as an arbitrary coupling.展开更多
In this paper we have obtained the existence of weak solutions of the small disturbance equations of steady two-dimension flow [GRAPHICS] with Riemann date [GRAPHICS] where v+ greater-than-or-equal-to 0, v- greater-th...In this paper we have obtained the existence of weak solutions of the small disturbance equations of steady two-dimension flow [GRAPHICS] with Riemann date [GRAPHICS] where v+ greater-than-or-equal-to 0, v- greater-than-or-equal-to 0 and u- less-than-or-equal-to u+ by introducing 'artificial' viscosity terms and employing Helley's theorem. The setting under our consideration is a nonstrictly hyperbolic system. our analysis in this article is quite fundamental.展开更多
The present manuscript examines the circular restricted gravitational three-body problem (CRGTBP) by the introduction of a new approach through the power series method. In addition, certain computational algorithms wi...The present manuscript examines the circular restricted gravitational three-body problem (CRGTBP) by the introduction of a new approach through the power series method. In addition, certain computational algorithms with the aid of Mathematica software are specifically designed for the problem. The algorithms or rather mathematical modules are established to determine the velocity and position of the third body’s motion. In fact, the modules led to accurate results and thus proved the new approach to be efficient.展开更多
In this paper, a cubic objective programming problem (COPP) is defined. Introduced a new modification to solve a cubic objective programming problem. Suggested an algorithm for its solution. Also reported the algorith...In this paper, a cubic objective programming problem (COPP) is defined. Introduced a new modification to solve a cubic objective programming problem. Suggested an algorithm for its solution. Also reported the algorithm of the usual simplex method. Application talks about how the developed algorithm can be used to unravel non-linear. The proposed technique, modification simplex technique, can be used with the constructed numerical examples an illustrative numerical problems are given to demonstrate the algorithms.展开更多
文摘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.
文摘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.
文摘With a brief review of the ESP (English for Special Purpose) teaching in Medical Schools over the past 30 years, this paper elaborates on the changes and situation of English teaching and leaming in some Medical Schools. Through a survey which throws light on the importance of ESP, the paper analyzes the problems facing Medical Schools, such as materials suitable for medical students who want to cultivate their ability in listening, speaking, reading, writing and translating in their own field and teachers who are supposed to be qualified for medical English teaching, and then discusses the top priorities in these Medical Schools and examines what has been done and will be done in order to work out practicable approaches to meet the requirements of medical students.
基金Supported by the National Natural Science Foun-dation of China (69973016)
文摘The traveling salesman problem (TSP) is a classical optimization problem and it is one of a class of NP- Problem. This paper presents a new method named multiagent approach based genetic algorithm and ant colony system to solve the TSP. Three kinds of agents with different function were designed in the multi-agent architecture proposed by this paper. The first kind of agent is ant colony optimization agent and its function is generating the new solution continuously. The second kind of agent is selection agent, crossover agent and mutation agent, their function is optimizing the current solutions group. The third kind of agent is fast local searching agent and its function is optimizing the best solution from the beginning of the trial. At the end of this paper, the experimental results have shown that the proposed hybrid ap proach has good performance with respect to the quality of solution and the speed of computation.
文摘The present work deals with the calculation of transition probability between two diabatic potentials coupled by any arbitrary coupling. The method presented in this work is applicable to any type of coupling while for numerical calculations we have assumed the arbitrary coupling as Gaussian coupling. This arbitrary coupling is expressed as a collection of Dirac delta functions and by the use of the transfer matrix technique the transition probability from one diabatic potential to another diabatic potential is calculated. We examine our approach by considering the case of two constant potentials coupled by Gaussian coupling as an arbitrary coupling.
文摘In this paper we have obtained the existence of weak solutions of the small disturbance equations of steady two-dimension flow [GRAPHICS] with Riemann date [GRAPHICS] where v+ greater-than-or-equal-to 0, v- greater-than-or-equal-to 0 and u- less-than-or-equal-to u+ by introducing 'artificial' viscosity terms and employing Helley's theorem. The setting under our consideration is a nonstrictly hyperbolic system. our analysis in this article is quite fundamental.
文摘The present manuscript examines the circular restricted gravitational three-body problem (CRGTBP) by the introduction of a new approach through the power series method. In addition, certain computational algorithms with the aid of Mathematica software are specifically designed for the problem. The algorithms or rather mathematical modules are established to determine the velocity and position of the third body’s motion. In fact, the modules led to accurate results and thus proved the new approach to be efficient.
文摘In this paper, a cubic objective programming problem (COPP) is defined. Introduced a new modification to solve a cubic objective programming problem. Suggested an algorithm for its solution. Also reported the algorithm of the usual simplex method. Application talks about how the developed algorithm can be used to unravel non-linear. The proposed technique, modification simplex technique, can be used with the constructed numerical examples an illustrative numerical problems are given to demonstrate the algorithms.