2026-09-19T22:06:03Z https://www.ideals.illinois.edu/oai-pmh

oai:www.ideals.illinois.edu:2142/29735 2023-07-10 col_2142_5131 col_2142_14787 com_2142_5130 com_2142_9630 com_2142_234

Salapaka, Srinivasa M. Roehl, Brian 2012-02-06T20:13:42Z 2012-02-06T20:13:42Z 2011-12 2012-02-06T20:13:42Z 2011-12 This thesis presents an investigation into the applications of the maximum-entropy principle as a heuristic for the multiple travelling salesman problem. This is a computationally complex problem which requires special treatment by conventional optimization techniques. Specific focus is given to developing a generalized framework for this problem that can be applied to any number of variants on the basic formulation. Additional consideration is given to the applications of this generalized framework to other variants on the travelling salesman problems such as the close enough travelling salesman problem. The heuristic framework developed here is shown to provide flexibility in addressing the multiple salesman variation on the travelling salesman problem as well as a several other variants on the travelling salesman problem. Additionally, this framework is shown to be effective in determining solutions to this class of problems, and it is especially effective for the close-enough travelling salesman problems which is particularly challenging for most conventional combinatorial algorithms. Concrete steps are presented by which to further extend and improve this framework to become both more widely applicable to variants on the travelling salesman problem, and more computationally efficient in solving such problems. Item withdrawn by Rebecca Bryant (rabryant@illinois.edu) on 2011-12-08T14:24:36Z Item was in collections: University of Illinois Theses & Dissertations (ID: 1) No. of bitstreams: 2 Roehl_Brian.docx: 568526 bytes, checksum: 4700fba8ec669ab973b0c03adc24e20e (MD5) Roehl_Brian.pdf: 1706899 bytes, checksum: fec57b9385da52b16c763b6604e6a055 (MD5) Made available in DSpace on 2012-02-06T20:13:42Z (GMT). No. of bitstreams: 3 Roehl_Brian.pdf: 1707012 bytes, checksum: 6f18d0eb655d720bbc200abed6b1b688 (MD5) license.txt: 4060 bytes, checksum: c5256f4ebf1367abd0e19de7aa7c79ea (MD5) Roehl_Brian.docx: 568351 bytes, checksum: f5676eaa8c0f7372c0dc351b15a219dc (MD5) http://hdl.handle.net/2142/29735 en Copyright 2011 Brian Roehl Maximum-Entropy Principle Deterministic Annealing Travelling Salesman Problem Multiple Travelling Salesman Problem Close Enough Travelling Salesman Problem Maximum-entropy principle approach to the multiple travelling salesman problem and related problems Dissertation / Thesis text Mechanical Sci & Engineering 1917 Mechanical Engineering 0133 University of Illinois at Urbana-Champaign Thesis M.S. MS:Mechanical Engineerng -UIUC 10KS0133MS