here‎, ‎we aim to develop a new algorithm for solving a multiobjective linear programming problem‎. ‎the algorithm is to obtain a solution which approximately meets the decision maker's preferences‎. ‎it is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution‎. ‎numerical examples and a simulation study are used to...

the imperialist competitive algorithm (ica) that was recently introduced has shown its good performance in optimization problems. this algorithm is inspired by competition mechanism among imperialists and colonies, in contrast to evolutionary algorithms. this paper presents optimization of bead geometry in welding process using of ica. therefore, two case studies from literature are presented t...

a parallel algorithm for generating t-ary tree sequences in reverse b-order is presented. the algorithm generates t-ary trees by 0-1 sequences, and each 0-1 sequences is generated in constant average time o(1). the algorithm is executed on a crew sm simd model, and is adaptive and cost-optimal. prior to the discussion of the parallel algorithm a new sequential generation with o(1) average time ...

in the software development process, testing is one of the most human intensive steps. many researchers try to automate test case generation to reduce the manual labor of this step. negative selection is a famous algorithm in the field of artificial immune system (ais) and many different applications has been developed using its idea. in this paper we have designed a new algorithm based on nega...

in this paper, solution of nonlinear optimal control problems and the controlled duffing oscillator, as a special class of optimal control problems, are considered and an efficient algorithm is proposed. this algorithm is based on state parametrization as a polynomial with unknown coefficients. by this method, the control and state variables can be approximated as a function of time. also, the ...

the concept of comprehensive grobner bases was introduced by weispfenning. montes has proposed an efficient algorithm for computing these bases. but he has not explicitly used buchberger's criteria in his algorithm. in this paper we prove that we can apply these criteria on montes algorithm. we propose a modified version of montes algorithm and evaluate its performance via some examples.

this paper presents a new meta-heuristic solution to find the efficient frontier using the mean-variance approach. portfolio optimization problem is a quadratic programming model and, changes to np-hard if the number of assets and constraints has increased, and it cannot be solved using common mathematical methods in a reasonable time. therefore, a heuristic or meta-heuristic algorithm should b...

in this paper, a new smooth second order sliding mode control is proposed. this algorithm is a modified form of super twisting algorithm. the super twisting guarantees the asymptotic stability, but the finite time stability of proposed method is proved with introducing a new particular lyapunov function. the proposed algorithm which is able to control nonlinear systems with matched structured u...

in this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. in this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. to tackle the problem efficiently and effectively, an effici...

in this paper, we considered solving approaches to flexible job shop problems. makespan is not a good evaluation criterion with overlapping in operations assumption. accordingly, in addition to makespan, we used total machine work loading time and critical machine work loading time as evaluation criteria. as overlapping in operations is a practical assumption in chemical, petrochemical, and gla...