Simulated annealing for optimal ship routing

Simulated annealing for optimal ship routing

A simulated annealing based algorithm is presented for the determination of optimal ship routes through the minimization of a cost function. This cost function is a weighted sum of the time of voyage and the voyage comfort (safety is taken into account too). The latter is dependent on both the wind speed and direction and the wave height and direction. The algorithm first discretizes an initial...

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

Call Routing by Simulated Annealing 1

Simulated Annealing (SA) is a powerful stochastic search algorithm applicable to a wide range of problems. This paper presents some experiments of applying SA to an NP-hard problem, i.e., call routing in circuit-switched telecommunications networks. The call routing problem considered here can be described as assigning calls to paths in a network so that the number of calls blocked can be minim...