The decision-making of Top management team (TMT) has been a hot point in academic. The paper find out annealing algorithm method can effectively solve the decision-making optimization problem. Through considering the quality and efficiency of decision-making, applying the annealing algorithm, the optimal decision preference sequence is found. Finally, an application case is proposed. Through de...

Circles packing problem is an NP-hard problem and is difficult to solve. In this paper, a hybrid search strategy for circles packing problem is discussed. A way of generating new configuration is presented by simulating the moving of elastic objects, which can avoid the blindness of simulated annealing search and make iteration process converge fast. Inspired by the life experiences of people, ...

Average case performance of the deterministic annealing EM algorithm is evaluated for Gaussian mixture estimation problem under some additive noises. The data-averaged EM update equations with respect to hyperparameters are calculated analytically in the large data limit. We find that the EM algorithm strongly depends on the initial conditions. Moreover, by using our analysis, it becomes possib...

Bus network design is an important problem in public transportation. A main step to this design is determining the number of required terminals and their locations. This is a special type of facility location problem, which is a time-consuming, large scale, combinatorial problem. In a previous attempt by the authors, this problem had been solved by GAMS, based on a branch and bound algorithm.&...

bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. bilevel programming has been proved to be an np-hard problem. numerous algorithms have been developed for solving bilevel programming problems. these algorithms lack the required efficiency for solving a real problem. ...

In this paper, the researchers have investigated a Concatenated Robot Move (CRM) sequence problem and Minimal Part Set (MPS) schedule problem with different setup times for two-machine robotic cell. They have focused on simultaneous solving of CRM sequence and MPS schedule problems with different loading and unloading times. They have applied a Simulated Annealing (SA) algorithm to provide a go...

The intelligent water drop algorithm is a swarm-based metaheuristic algorithm, inspired by the characteristics of water drops in the river and the environmental changes resulting from the action of the flowing river. Since its appearance as an alternative stochastic optimization method, the algorithm has found applications in solving a wide range of combinatorial and functional optimization pro...

Projects scheduling by the project portfolio selection, something that has its own complexity and its flexibility, can create different composition of the project portfolio. An integer programming model is formulated for the project portfolio selection and scheduling.Two heuristic algorithms, genetic algorithm (GA) and simulated annealing (SA), are presented to solve the problem. Results of cal...