19 search results - page 3 / 4 » A simulated annealing and hill-climbing algorithm for the tr... |
SEAL
1998
Springer
13 years 11 months ago
1998
Springer
The allocation of office space in any large institution is usually a problematical issue, which often demands a substantial amount of time to perform manually. The result of this a...
CEC
2003
IEEE
14 years 20 days ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
CEC
2008
IEEE
14 years 1 months ago
2008
IEEE
— In this paper, we propose a population-based implementation of simulated annealing to tackle multi-objective optimisation problems, in particular those of combinatorial nature....
111
click to vote
Book
"Introduction to Neural Networks fpr C#, Second Edition, introduces the C# programmer to the world of Neural Networks and Artificial Intelligence. Neural network architectures...
AEI
2004
13 years 7 months ago
2004
This research applies the meta-heuristic method of ant colony optimization (ACO) to an established set of vehicle routing problems (VRP). The procedure simulates the decision-maki...