In this paper, we introduce a new approach for solving the traveling salesman problems (TSP) and provide a solution algorithm for a variant of this problem. The concept of the proposed method is based on the Hungarian algorithm, which has been used to solve an assignment problem for reaching an optimal solution. We introduced a new fittest criterion for crossing over such problems, and illu...

For a nonsmooth multiobjective mathematical programming problem governed by infinitely many constraints‎, ‎we define a new gap function that generalizes the definitions of this concept in other articles‎. ‎Then‎, ‎we characterize the efficient‎, ‎weakly efficient‎, ‎and properly efficient solutions of the problem utilizing this new gap function‎. ‎Our results are based on $(Phi,rho)-$invexity‎,...

Transportation problem is a linear programming which considers minimum cost for shipping a product from some origins to other destinations such as from factories to warehouse, or from a warehouse to supermarkets. To solve this problem simplex algorithmis utilized. In real projects costs and the value of supply and demands are fuzzy numbers and it is expected that optimal solutions for determini...

In the original formulation of the problem, the Budach mouse is a kind of finite automaton with a very simple program, a cycle of states, q0 d1 −→ q1 d2 −→ . . . qn−1 dn −→ q0, with d1, . . . , dn ∈ {N,E}. The mouse moves among integer points in the octant of the Cartesian plane delimited by the lines y = 0 and y = x. It begins on (1, 0), at state q0, and advances in steps which increase the st...

in the deregulated power systems, transmission congestion is one of the significant and main problems of the electrical networks which can cause incremental cost in the energy. this problem has resulted to new challenging issues in different parts of power systems which there was not in the traditional systems or at least had very little importance. transmission congestion happens when the maxi...