For dynamic analyses of railway track structures, the algorithm of solution is very important. For estimating the important problems in the railway tracks such as the effects of rail joints, rail supports, rail modeling in the nearness of bridge and other problems, the models of the axially beam model on the elastic foundation can be utilized. For studying the effects of axially beam on the ela...

lsmr (least squares minimal residual) is an iterative method for the solution of the linear system of equations and leastsquares problems. this paper presents a block version of the lsmr algorithm for solving linear systems with multiple right-hand sides. the new algorithm is based on the block bidiagonalization and derived by minimizing the frobenius norm of the resid ual matrix of normal equa...

this paper proposes the exchange market algorithm (ema) to solve the combined economic and emission dispatch (ceed) problems in thermal power plants. the ema is a new, robust and efficient algorithm to exploit the global optimum point in optimization problems. existence of two seeking operators in ema provides a high ability in exploiting global optimum point. in order to show the capabilities ...

‎A natural algorithm with an optimal order of convergence is proposed for numerical solution of a class of cordial weakly singular Volterra integral equations‎. ‎The equations of this class appear in heat conduction problems with mixed boundary conditions‎. ‎The algorithm is based on a representation of the solution and compound Gaussian quadrature rules with graded meshes‎. ‎A comparative stud...

This paper proposes a novel hybrid algorithm namely APSO-BFO which combines merits of Bacterial Foraging Optimization (BFO) algorithm and Adaptive Particle Swarm Optimization (APSO) algorithm to determine the optimal PID parameters for control of nonlinear systems. To balance between exploration and exploitation, the proposed hybrid algorithm accomplishes global search over the whole search spa...

For this paper, we explored the implementation of the cuckoo search algorithm applied to the capacitated vehicle routing problem. The cuckoo search algorithm was implemented with Lévy flights with the 2-opt and double-bridge operations, and with 500 iterations for each run. The algorithm was tested on the problem instances from the Augerat benchmark dataset. The algorithm did not perform well o...

In this paper, an intelligent-gradient based algorithm is proposed to solve time optimal bang-bang control problem. The proposed algorithm is a combination of an intelligent algorithm called improved particle swarm optimization algorithm (IPSO) in the first stage of optimization process together with a gradient-based algorithm called successive quadratic programming method (SQP) in the second s...

the multiple traveling salesman problem (mtsp) is a generalization of the famous traveling salesman problem (tsp), where more than one salesman is used in the solution. although the mtsp is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. this paper presents an efficient and evolutionary optimization algorith...

In this paper, the researchers have investigated a Concatenated Robot Move (CRM) sequence problem and Minimal Part Set (MPS) schedule problem with different setup times for two-machine robotic cell. They have focused on simultaneous solving of CRM sequence and MPS schedule problems with different loading and unloading times. They have applied a Simulated Annealing (SA) algorithm to provide a go...