Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Simulated annealing: theory and applications
Simulated annealing: theory and applications
Optimal path-finding algorithms*
Search in Artificial Intelligence
Parallel simulated annealing techniques
CNLS '89 Proceedings of the ninth annual international conference of the Center for Nonlinear Studies on Self-organizing, Collective, and Cooperative Phenomena in Natural and Artificial Computing Networks on Emergent computation
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
Modern heuristic techniques for combinatorial problems
A parallel simulated annealing algorithm
Parallel Computing
Discrete Optimization Algorithms with Pascal Programs
Discrete Optimization Algorithms with Pascal Programs
Scalability of dial-a-ride systems—a case study to assess utilities of ubiquitous mass user support
MMAS'04 Proceedings of the First international conference on Massively Multi-Agent Systems
| Hi-index | 0.00 |
A delivery problem which reduces to the NP-complete set-partitioning problem is investigated. The sequential and parallel simulated annealing algorithms to solve the delivery problem are discussed. The objective is to improve the quality of solutions to the problem by applying parallelism.