A Simulated Annealing Algorithm for Market Based Redistricting Problems
碩士 === 國立臺灣大學 === 建築與城鄉研究所 === 92 === In urban study, there are many redistricting problems (RP), which subdivide spaces based on various activity intensities. In the past, such problems usually set their objective functions in accordance with the Euclidian distance from certain points. However, dis...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/47922215372617149532 |