The minimum crossing number problem is among the oldest and most fundamental problems arising in the area of automatic graph drawing. In this paper, eight population-based meta-heuristic algorithms are utilized to tackle the minimum crossing number problem for two special types of graphs, namely complete graphs and complete bipartite graphs. A 2-page book drawing representation is employed for ...

due to its simplicity radix-2 is a popular algorithm to implement fast fourier transform. radix - 2 p algorithms have the same order of computational complexity as higher radices algorithms, but still retain the simplicity of radix-2 . by defining a new concept, twiddle factor template , in this paper we propose a method for exact calculation of multiplicative complexity for radix-2 p algorithm...

no unique method has been so far specified for determining the number of neurons in hidden layers of multi-layer perceptron (mlp) neural networks used for prediction. the present research is intended to optimize the number of neurons using two meta-heuristic procedures namely genetic and hill climbing algorithms. the data used in the present research for prediction are consumption data of water...

in this paper, trajectory generation for the 4 dof arm of surena iii humanoid robot with the purpose of optimizing energy and avoiding a moving obstacle is presented. for this purpose, first, kinematic equations for a seven dof manipulator are derived. then, using the lagrange method, an explicit dynamics model for the arm is developed. in the next step, in order to generate the desired traject...

background trauma still stands atop of the list of emergencies. transfer of these patients via emergency medical services (ems) dispatch is critical with regard to importance of timing. this aspect has achieved greater importance due to population increase and telephone triage. objectives we aimed to decrease unnecessary emergency medical services (ems) missions via a computer program designed ...

in this paper, genetic algorithms (gas) are employed to control simultaneous linear systems in both state and output feedback. first, the similarity transformation is applied to obtain parameterized controllers. this requires solution of a system of equations and also some non-linear inequalities. gas are used to solve these equations and inequalities. therefore, the paper presents an analytica...

we give an algorithm, called t*, for finding the k shortest simplepaths connecting a certain pair of nodes, s and t, in a acyclic digraph.first the nodes of the graph are labeled according to the topologicalordering. then for node i an ordered list of simple s − i paths iscreated. the length of the list is at most k and it is created by usingtournament trees. we prove the correctness of t* and ...

optimization is an important methodology for activities in planning and design. the transportation designers are able to introduce better projects when they can save time and cost of travel for project by optimization methods. most of the optimization problems in engineering are more complicated than they can be solved by custom optimization methods. the most common and available methods are he...

periodic vehicle routing problem focuses on establishing a plan of visits to clients over a given time horizon so as to satisfy some service level while optimizing the routes used in each time period. this paper presents a new effective heuristic algorithm based on data mining tools for periodic vehicle routing problem (pvrp). the related results of proposed algorithm are compared with the resu...

this paper addresses a reliable facility location problem with considering facility capacity constraints. in reliable facility location problem some facilities may become unavailable from time to time. if a facility fails, its clients should refer to other facilities by paying the cost of retransfer to these facilities. hence, the fail of facilities leads to disruptions in facility location dec...