Randomized Local Extrema for Heuristic Selection in TSP

Publication Type

Conference Proceeding Article

Publication Date

9-2006

Abstract

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 symmetry for tractability. TSP problems exhibit tentative domain symmetry and potential space-time randomness in domain solution evolution. Heuristics in the domain of the TSP can be found and selected with a suitable representation, randomization, and symmetric induction with a significantly reduced time. Better representation of the TSP problem facilitates a better solution

Discipline

Software Engineering

Research Areas

Software Systems

Publication

2006 IEEE International Conference on Information Reuse and Integration, Waikola, 16-18 September 2006

First Page

336

Last Page

340

ISBN

9780780397880

Identifier

10.1109/IRI.2006.252436

Publisher

IEEE

City or Country

Piscataway, NJ

Additional URL

http://dx.doi.org/10.1109/IRI.2006.252436

Link to Full Text

Share

COinS