Determining Optimal Locations of Postal Access Points Based on Simulated Annealing

Optimal QoS Routing Based on Extended Simulated Annealing

Quality-of-service routing (QoSR) is to find an optimal path that satisfies multiple constraints simultaneously. As an NPC problem, it is a challenge for the next-generation networks. In this paper, we propose a novel heuristic SA MCOP to the general multi-constrained optimal path problem by extending simulated annealing into Dijkstra’s algorithm. The heuristic first translates multiple QoS wei...

Simulated Annealing and Optimal Codes

Simulated Annealing and Optimal Protocols

Many human tumors cannot easily be avoided. In most cases a prophylactic vaccination prevents the tumor growth. In particular the Triplex vaccine prevented mammary carcinoma formation using a Chronic schedule, but it is not known if this schedule is minimal. A computational model named SimTriplex was able to reproduce in silico the in vivo experiments. The combination of SimTriplex and Genetic ...

AN EFFICIENT HYBRID ALGORITHM BASED ON PARTICLE SWARM AND SIMULATED ANNEALING FOR OPTIMAL DESIGN OF SPACE TRUSSES

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...

Optimizing microcell base station locations using simulated annealing techniques

The problem of choosing the optimum locations for base stations in a microcell communications system is considered. The factors affecting optimum selection are the non-uniform service areas in complex propagation environments, the mutual coverage and interference of multiple base stations, and the service objective which is usually defined by signal level but may also be defined by delay spread...