—Community detection is one of the most important issues in complex networks. In this paper, integrating Infomap and Simulated Annealing (SA) algorithm, and based on the thought of optimizationof the modularity function, the authors are proposing a novel algorithm Infomap-SA for detecting community. In order to verify the accuracy and efficiency of this algorithm, the performance of this algor...

In this paper, an efficient optimization algorithm is proposed based on Particle Swarm Optimization (PSO) and Simulated Annealing (SA) to optimize truss structures. The proposed algorithm utilizes the PSO for finding high fitness regions in the search space and the SA is used to perform further investigation in these regions. This strategy helps to use of information obtained by swarm in an opt...

The following paper describes and discusses the suitability of the particle swarm optimization (PSO), of the simulated annealing algorithm (SA) and of the genetic algorithm (GA) for the employment with blind adaptation of the directional characteristic of array antennas. By means of extensive simulations, it was confirmed that the suggested PSO and SA and the improved GA are able to follow dyna...

Sea port container terminals play an important role in the national and regional economy. The integrated scheduling of handling equipment has been recently investigated in literature to improve the performance of the container terminals. In this paper, an integrated scheduling of quay cranes and automated guided vehicles is formulated as a mixed integer linear programming model. This model mini...

the urban waste collection is one of the major municipal activities that involves large expenditures and difficult operational problems. also, waste collection and disposal have high expenses such as investment cost (i.e. vehicles fleet) and high operational cost (i.e. fuel, maintenance). in fact, making slight improvements in this issue lead to a huge saving in municipal consumption. some inci...

task assignment problem (tap) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. tap is a combinatorial optimization problem and np-complete. this paper proposes a hybrid meta-heuristic algorithm for solving tap in a h...

this paper investigates the problem of selecting and scheduling a set of projects among available projects. each project consists of several tasks and to perform each one some resource is required. the objective is to maximize total benefit. the paper constructs a mathematical formulation in form of mixed integer linear programming model. three effective metaheuristics in form of the imperialis...

Simulated Annealing (SA) is a powerful stochastic search method that can produce very high quality solutions for hard combinatorial optimization problem. In this paper, we applied this SA method to optimize our 3D hierarchical reconstruction neural network (NN). This NN deals with complicated task to reconstruct a complete representation of a given object relying only on a limited number of vie...

In Network-on-Chip (NoC) application design, coresearch, genetic algorithms and neural networks [1] are based to-node mapping is an important but intractable optimization on empirical techniques in nature. Simulated annealing (SA) problem. In the paper, we use simulated annealing to tackle the [7] is a generic probabilistic meta-algorithm for the global mapping problem in 2D mesh NoCs. In parti...

Lot-sizing problems (LSPs) belong to the class of production planning problems in which the availability quantities of the production plan are always considered as a decision variable. This paper aims at developing a new mathematical model for the multi-level capacitated LSP with setup times, safety stock deficit, shortage, and different production manners. Since the proposed linear mixed integ...