Show simple item record

dc.contributor.authorRichard J. Balling
dc.contributor.authorJohn T. Taber
dc.contributor.authorMichael R. Brown
dc.contributor.authorKirsten Day
dc.date.accessioned2017-05-08T21:05:37Z
dc.date.available2017-05-08T21:05:37Z
dc.date.copyrightJune 1999
dc.date.issued1999
dc.identifier.other%28asce%290733-9488%281999%29125%3A2%2886%29.pdf
dc.identifier.urihttp://yetl.yabesh.ir/yetl/handle/yetl/38366
dc.description.abstractA genetic algorithm was used to search for optimal future land-use and transportation plans for a high-growth city. Millions of plans were considered. Constraints were imposed to ensure affordable housing for future residents. Objectives included the minimization of traffic congestion, the minimization of costs, and the minimization of change from the status quo. The genetic algorithm provides planners and decision makers with a set of optimal plans known as the Pareto set. The value of each plan in the Pareto set depends on the relative importance that decision makers place on the various objectives.
dc.publisherAmerican Society of Civil Engineers
dc.titleMultiobjective Urban Planning Using Genetic Algorithm
dc.typeJournal Paper
dc.journal.volume125
dc.journal.issue2
dc.journal.titleJournal of Urban Planning and Development
dc.identifier.doi10.1061/(ASCE)0733-9488(1999)125:2(86)
dc.treeJournal of Urban Planning and Development:;1999:;Volume ( 125 ):;issue: 002
dc.contenttypeFulltext


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record