?url_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.relation=http%3A%2F%2Fmiis.maths.ox.ac.uk%2Fmiis%2F726%2F&rft.title=Optimisation+of+Car+Park+Designs&rft.creator=Porter%2C+Richard&rft.creator=Billingham%2C+John&rft.creator=Bradshaw%2C+Joel&rft.creator=Bulkowski%2C+Marcin&rft.creator=Dawson%2C+Peter&rft.creator=Garbacz%2C+Pawel&rft.creator=Gilbert%2C+Mark&rft.creator=Gosce%2C+Lara&rft.creator=Hjort%2C+Poul&rft.creator=Homer%2C+Martin&rft.creator=Jeffrey%2C+Mike&rft.creator=Papavassiliou%2C+Dario&rft.creator=Wind%2C+David+Kofoed&rft.subject=Technology%2FDevices&rft.description=The+problem+presented+by+ARUP+to+the+UK+Study+Group+2014+was+to+investigate+methods+for+maximising+the+number+of+car+parking+spaces+that+can+be+placed+within+a+car+park.+This+is+particularly+important+for+basement+car+parks+in+residential+apartment+blocks+or+offices+where+parking+spaces+command+a+high+value.+Currently+the+job+of+allocating+spaces+is+done+manually+and+is+very+time+intensive.%0D%0A%0D%0AThe+Study+Group+working+on+this+problem+split+into+teams+examining+different+aspects+of+the+car+park+design+process+There+were+three+approaches+taken.+These+approaches+include+a+so-called+%22tile-and-trim%22+method+in+which+an+optimal+layout+of+cars+from+an+%60infinite+car+park'+are+overlaid+onto+the+actual+car+park+domain%3B+adjustments+are+then+made+to+accommodate+access+from+one+lane+to+the+next.+A+second+approach+seeks+to+develop+an+algorithm+for+optimising+the+road+within+a+car+park+on+the+assumption+that+car+parking+spaces+should+fill+the+space+and+that+any+space+needs+to+be+adjacent+to+the+network.+A+third+similar+approach+focused+on+schemes+for+assessing+the+potential+capacity+of+a+small+selection+of+specified+road+networks+within+the+car+park+to+assist+the+architect+in+selecting+the+optimal+road+network(s).%0D%0A%0D%0AThe+problem+is+a+variant+of+the+%22bin+packing%22+problem%2C+well+known+in+computer+science.+It+is+further+complicated+by+the+fact+that+two+different+classes+of+item+need+to+be+packed+(roads+and+cars)%2C+with+both+local+(immediate+access+to+a+road)+and+global+(connectivity+of+the+road+network)+constraints.+Bin-packing+is+known+to+be+NP-hard%2C+and+hence+the+problem+at+hand+has+at+least+this+level+of+computational+complexity.%0D%0A%0D%0ANone+of+the+approaches+produced+a+complete+solution+to+the+problem+posed.+Indeed%2C+it+was+quickly+determined+by+the+group+that+this+was+a+very+hard+problem+(a+view+reinforced+by+the+many+different+possible+approaches+considered)+requiring+far+longer+than+a+week+to+really+make+significant+progress.+All+approaches+rely+to+differing+degrees+on+optimisation+algorithms+which+are+inherently+unreliable+unless+designed+specifically+for+the+intended+purpose.+It+is+also+not+clear+whether+a+relatively+simple+automated+computer+algorithm+will+be+able+to+%22beat+the+eye+of+the+architect%22%3B+additional+sophistication+may+be+required+due+to+subtle+constraints.%0D%0A%0D%0AApart+from+determining+that+the+problem+is+hard%2C+positive+outcomes+have+included%3A%0D%0A%0D%0ADetermining+that+parking+perpendicular+to+the+road+in+long+aisles+provides+the+most+efficient+packing+of+cars.%0D%0AProvision+of+code+which+%22tiles+and+trims%22+from+an+infinite+car+park+onto+the+given+car+park+with+interactive+feedback+on+the+number+of+cars+in+the+packing.%0D%0AProvision+of+code+for+optimal+packing+in+a+parallel-walled+car+park.%0D%0AMethods+for+optimising+a+road+within+a+given+domain+based+on+developing+cost+functions+ensuring+that+cars+fill+the+car+park+and+have+access+to+the+road.+Provision+of+code+for+optimising+a+single+road+in+a+given+(square)+space.%0D%0ADescription+of+methods+for+assessing+the+capacity+of+a+car+park+for+a+set+of+given+road+network+in+order+to+select+optimal+road+networks.%0D%0ASome+ideas+for+developing+possible+solutions+further.&rft.date=2013&rft.type=Study+Group+Report&rft.type=NonPeerReviewed&rft.format=application%2Fpdf&rft.language=en&rft.identifier=http%3A%2F%2Fmiis.maths.ox.ac.uk%2Fmiis%2F726%2F1%2FESGI91-Arup_CaseStudy.pdf&rft.identifier=++Porter%2C+Richard+and+Billingham%2C+John+and+Bradshaw%2C+Joel+and+Bulkowski%2C+Marcin+and+Dawson%2C+Peter+and+Garbacz%2C+Pawel+and+Gilbert%2C+Mark+and+Gosce%2C+Lara+and+Hjort%2C+Poul+and+Homer%2C+Martin+and+Jeffrey%2C+Mike+and+Papavassiliou%2C+Dario+and+Wind%2C+David+Kofoed++(2013)+Optimisation+of+Car+Park+Designs.++%5BStudy+Group+Report%5D+++++