Randomized Local Extrema for Heuristic Selection in TSP
It follows from the search randomizations in space-time among candidate heuristics that the optimality of an arbitrary heuristic is unsolvable. There are a countable infinite number of theories that may be decomposed into stronger local proofs. Local inductive randomization depends on domain symmetr...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
2006
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/sis_research/540 http://dx.doi.org/10.1109/IRI.2006.252436 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |