Wireless sensor networks have been deployed for many applications such as surveillance an area or a set of targets and lifetime maximization is one the most important challenges in wireless sensor networks. When a set of sensor nodes dropped into a field by aircraft or manually to monitor a set of targets, scheduling sensor nodes to monitor deployed targets is necessary to prolong network lifet...

The paper proposes a novel evolutionary optimization approach of solving a multi-robot stick-carrying problem. The problem refers to determine the time-optimal trajectory of a stick, being carried by two robots, from a given starting position to a predefined goal position amidst static obstacles in a robot world-map. The problem has been solved using a new hybrid evolutionary algorithm. Hybridi...

In this study, solutions for machinery layout with the aim of reducing transportation costs will be discussed. To do this, imperialist competitive algorithm (ICA), which is a very complicated and effective meta-heuristic algorithm is introduced. In the offered algorithm, different kinds of machinery layout are considered in single-row as country and then the best possible layout is developed ba...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

The traveling salesman problem (TSP) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. The TSP is probably the most famous and extensively studied problem in the field of combinatorial optimization. Because this problem is an NP-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

This paper deal with the problem of no-wait hybrid flow shop which sequence dependent setup times, ready time and machine availability constraint. Minimizing the mean tardiness is considered as the objective to develop the optimal scheduling algorithm. To do so, an efficient hybrid imperialist competitive algorithm (HICA) is proposed to tackle this problem. Our proposed algorithm is compared to...