the travelling salesmen problem (tsp) is one of the most important and famous combinational optimization problems that aim to find the shortest tour. in this problem, the salesman starts to move from an arbitrary place called depot and after visiting all nodes, finally comes back to depot. solving this problem seems hard because program statement is simple and leads this problem belonging to np...

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 aim of a multi-mode resource-constrained project scheduling problem (mrcpsp) is to assign resource(s) with the restricted capacity to an execution mode of activities by considering relationship constraints, to achieve pre-determined objective(s). these goals vary with managers or decision makers of any organization who should determine suitable objective(s) considering organization strategi...

we consider the queueing maximal covering location-allocation problem (qm-clap) with an m/m/1 queueing system. we propose a new solution procedure based on decomposition of the problem into smaller sub-problems. we solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic grasp. we also solve the entire model with grasp. computational results for these ...

This chapter introduces and overviews an emerging methodology in search and optimisation. One of the key aims of these new approaches, which have been termed hyper-heuristics, is to raise the level of generality at which optimisation systems can operate. An objective is that hyper-heuristics will lead to more general systems that are able to handle a wide range of problem domains rather than cu...

In this research, an integrated inventory problem is formulated for a single-vendor multiple-retailer supply chain that works according to the vendor managed inventory policy. The model is derived based on the economic order quantity in which shortages with penalty costs at the retailers` level is permitted. As predicting customer demand is the most important problem in inventory systems and th...

location-allocation is a combinatorial optimization problem, and is defined as non deterministic polynomial hard (np) hard optimization. therefore, solution of such a problem should be shifted from exact to heuristic or meta heuristic due to the complexity of the problem. locating medical centers and allocating injuries of an earthquake to them has high importance in earthquake disaster managem...

This paper presents a comprehensive survey of the meta-heuristic optimization algorithms on text clustering applications and highlights its main procedures. These Artificial Intelligence (AI) are recognized as promising swarm intelligence methods due to their successful ability solve machine learning problems, especially problems. reviews all relevant literature meta-heuristic-based application...