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

Floorplanning is an essential step in physical design of VLSI. The floorplan design problem is how to place a set of circuit modules on a chip such that the resulting area is minimized. The best known solutions are obtained using simulated annealing based on sequence pairs representing the planning of modules. The conventional simulated annealing algorithm conducts a random perturbation operati...

It is a long time that the Simulated Annealing (SA) procedure has been introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules...

Selecting the routes and the assignment of link flow in a computer communication networks are extremely complex combinatorial optimization problems. Metaheuristics, such as genetic or simulated annealing algorithms, are widely applicable heuristic optimization strategies that have shown encouraging results for a large number of difficult combinatorial optimization problems. This paper considers...

this paper presents a new mathematical model for a redundancyallocation problem (rap) withcold-standby redundancy strategy and multiple component choices.the applications of the proposed model arecommon in electrical power, transformation,telecommunication systems,etc.manystudies have concentrated onone type of time-to-failure, butin thispaper, two components of time-to-failures which follow hy...

the multivariate exponentially weighted moving average (mewma) control chart is one of the best statistical control chart that are usually used to detect simultaneous small deviations on the mean of more than one cross-correlated quality characteristics. the economic design of mewma control charts involves solving a combinatorial optimization model that is composed of a nonlinear cost function ...

in today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. in this paper, we present a new model for the traveling salesman problem with multiple transporters (tspmt). in the proposed model, which is more applicable than the traditional versions, each city has diffe...

Fuzzy Cognitive Maps (FCMs) have successfully been applied in numerous domains to show the relations between essential components in complex systems. In this paper, a novel learning method is proposed to construct FCMs based on historical data and by using meta-heuristic: Genetic Algorithm (GA), Simulated Annealing (SA), and Tabu Search (TS). Implementation of the proposed method has demonstrat...

A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is presented. The objective is to find the best possible solutions to some wellknown instances of the problem by using parallelism. The empirical evidence indicate that parallel simulated annealing can be applied with success to bicriterion optimization problems.

Optimality Theory (OT) requires an algorithm optimising the Harmony function on the set of candidates. Simulated annealing, a well-known heuristic technique for combinatorial optimisation, has been argued to be an empirically adequate solution to this problem. In order to generalise simulated annealing for a non-real valued Harmony function, two representations of a violation profile are propos...