The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...

the ever severe dynamic competitive environment has led to increasing complexity of strategic decision making in giant organizations. strategy formulation is one of basic processes in achieving long range goals. since, in ordinary methods considering all factors and their significance in accomplishing individual goals are almost impossible. here, a new approach based on clustering method is pro...

this paper presents a New Technique for Route Selection (NTRS) in DSR routing protocol to minimize the load by choosing the most stable path. Our proposal mechanism estimates the stability of the path by means of the received signal strength. Simulation results are used to draw conclusions regarding to use our proposed technique in route selection with DSR and compared it with the standard DSR ...

as dyes are the most important pollutants of many industrial wastewaters. a large amount of reactive black 5 enters the environment in iran because of the use of this dye in iran's textile industries, so the goal of this study was to survey the catalytic ozonation process with bone char in removal of reactive black 5 dye from synthetic wastewater. in this experimental study bone char (bc) was p...

Vehicular ad hoc networks (VANETs) are a particular type of Mobile ad hoc networks (MANET) in which the vehicles are considered as nodes. Due to rapid topology changing and frequent disconnection makes it difficult to design an efficient routing protocol for routing data among vehicles. In this paper, a new routing protocol based on glowworm swarm optimization algorithm is provided. Using the g...

guiding vehicles to their destination under dynamic traffic conditions is an important topic in the field of intelligent transportation systems (its). nowadays, many complex systems can be controlled by using multi agent systems. adaptation with the current condition is an important feature of the agents. in this research, formulation of dynamic guidance for vehicles has been investigated based...

in this paper, an efficient fault-tolerant routing algorithm for mobile ad-hoc networks (manets) is presented. the proposed algorithm increases the network fault-tolerance using natural redundancy of ad-hoc networks. this algorithm is carried out in two stages; 1) the selection of backup nodes 2) the selection of backup route(s). in the first stage, the proposed algorithm chooses nodes with the...

There are many routing algorithms are presented for Mobile Ad hoc Network such as Destination sequenced Distance Vector (DSDV) which is known as proactive routing algorithm based on routing table, due to continuously updating routing tables, it consumes large portion of network capacity. Another is Ad hoc on Demand Distance Vector (AODV) is known as reactive algorithm. In this algorithm, when p...