370 search results - page 2 / 74 » A Meta-Heuristic Based on Simulated Annealing for Solving Mu... |
IJCNN
2006
IEEE
13 years 10 months ago
2006
IEEE
— One of the major drawbacks of the Hopfield network is that when it is applied to certain polytopes of combinatorial problems, such as the traveling salesman problem (TSP), the...
CPHYSICS
2006
13 years 4 months ago
2006
A modification of the standard Simulated Annealing (SA) algorithm is presented for finding the global minimum of a continuous multidimensional, multimodal function. We report resu...
PDP
2002
IEEE
13 years 9 months ago
2002
IEEE
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 wellkno...
CP
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goa...
IEICET
2007
13 years 4 months ago
2007
—When SA is applied to continuous optimization problems, the design of the neighborhood used in SA becomes important. A lot of experiments are necessary to determine an appropria...