wireless sensor networks are the new generation of networks that typically are formed great numbers of nodes and the communications of these nodes are done as wireless. the main goal of these networks is collecting data from neighboring environment of network sensors. since the sensor nodes are battery operated and there is no possibility of charging or replacing the batteries, the lifetime of ...

the traveling salesman problem (tsp) is a well-known combinatorial optimization problem and holds a central place in logistics management. the tsp has received much attention because of its practical applications in industrial problems. many exact, heuristic and metaheuristic approaches have been proposed to solve tsp in recent years. in this paper, a modified ant colony optimization (maco) is ...

Given a heuristic estimate of the relative safety of a hybrid dynamical system trajectory, we transform the initial safety problem for dynamical systems into a global optimization problem. We introduce MLLO-IQ and MLLO-RIQ, two new information-based optimization algorithms. After demonstrating their strengths and weaknesses, we describe the class of problems for which diierent optimization meth...

Presently, the introduction of intelligent models to optimize structural problems has become an important issue in civil engineering and almost all other fields of engineering. Optimization models in artificial intelligence have enabled us to provide powerful and practical solutions to structural optimization problems. In this study, a novel method for optimizing structures as well as solving s...

The Charged System Search (CSS) is combined to chaos to solve mathematical global optimization problems. The CSS is a recently developed meta-heuristic optimization technique inspired by the governing laws of physics and mechanics. The present study introduces chaos into the CSS in order to increase its global search mobility for a better global optimization. Nine chaos-based CSS (CCSS) methods...

Meta-heuristic search algorithms are developed to solve optimization problems. Such algorithms are appropriate for global searches because of their global exploration and local exploitation abilities. Swarm intelligence (SI) algorithms comprise a branch of meta-heuristic algorithms that imitate the behavior of insects, birds, fishes, and other natural phenomena to find solutions for complex opt...

the determination of the ultimate pit limit (upl) is the first step in the open pit mine planning process. in this stage that parts of the mineral deposit that are economic to mine are determined. there are several mathematical, heuristic and meta-heuristic algorithms to determine upl. the optimization criterion in these algorithms is maximization of the total profit whilst satisfying the...

A new approach is proposed incorporating heuristic optimization algorithm with a switch to a local search algorithm for the multidisciplinary design of solid launch vehicle at conceptual level. Heuristic optimization algorithms such as Genetic Algorithm often may locate near optimum solutions at the expense of large function evaluations. Local search algorithms including both gradient and non g...

the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...