Show simple item record

dc.contributor.authorSalah Benabdallah
dc.contributor.authorJeff R. Wright
dc.date.accessioned2017-05-08T21:05:28Z
dc.date.available2017-05-08T21:05:28Z
dc.date.copyrightMarch 1992
dc.date.issued1992
dc.identifier.other%28asce%290733-9488%281992%29118%3A1%2824%29.pdf
dc.identifier.urihttp://yetl.yabesh.ir/yetl/handle/yetl/38277
dc.description.abstractThe land‐allocation problem is one of selecting, from a finite number of candidate parcels, that set of parcels that best meets the needs of a specific land‐use objective. This research extends land‐allocation modeling methodologies to address problems requiring allocation of parcels to multiple areas with different shapes. The approach relies on the use of shape constraints within the context of discrete multiobjective programming models set on a regular, or uniform grid structure. Several model formulations are presented including a nonlinear discrete optimization model that addresses an explicit districting problem. A heuristic algorithm is developed to generate a solution for this problem, and computational performance of this algorithm is presented and discussed.
dc.publisherAmerican Society of Civil Engineers
dc.titleMultiple Subregion Allocation Models
dc.typeJournal Paper
dc.journal.volume118
dc.journal.issue1
dc.journal.titleJournal of Urban Planning and Development
dc.identifier.doi10.1061/(ASCE)0733-9488(1992)118:1(24)
dc.treeJournal of Urban Planning and Development:;1992:;Volume ( 118 ):;issue: 001
dc.contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record