000 10901nam a2202341 i 4500
003 KOHA
005 20220719101904.0
008 220407s2018 sz a 00|10 teng d
020 _a9783319998459
_q(hardback)
020 _a9783319998466
_q(eBook)
022 _a21979375
_q(Electronic)
022 _a14309602
_q(Electronic)
040 _aTR-IsMEF
_beng
_cTR-IsMEF
_erda
_dTR-IsMEF
041 0 _aeng
050 _aGF101
_b.C48 2018
100 1 _aChurch, Richard L.,
_eauthor.
245 1 0 _aLocation covering models :
_bhistory, applications and advancements /
_cRichard L. Church, Department of Geography, University of California, Santa Barbara, California, USA, Alan Murray, Department of Geography, University of California, Santa Barbara, California, USA.
264 1 _aSwitzerland :
_bSpringer International Publishing,
_c2018.
264 4 _c©2018
300 _a271 pages :
_billustrations ;
_c23 cm.
336 _atext
_2rdacontent
337 _aunmediated
_2rdamedia
338 _avolume
_2rdacarrier
490 1 _aAdvances in spatial science.
_aThe regional science series.
505 0 _a1. Location modeling and covering metrics.
505 0 _a2. Classic beginnings.
505 0 _a3. Extended forms of coverage.
505 0 _a4. Probabilistic coverage.
505 0 _a5. Anti-cover.
505 0 _a6. Weighted benefit, variable radius, and gradual coverage.
505 0 _a7. Capture, capacities, and thresholds.
505 0 _a8. Continuous space coverage.
505 0 _a9. Discruption, protection and resilience.
505 0 _a10. Coverage of network-based structures : paths, tours and trees.
505 0 _a11. Grand challenges.
520 0 _aThis book provides a thoughtful and rigorous guide to coverage modeling, reviewing essential models, solution approaches, and related applications. Since the early developments of the Location Set Covering Problem and the Maximal Covering Location Problem, models based upon some form of coverage have been extended and applied in a number of areas, helping to improve services offered to citizens of large cities and regions. Examples include trauma care services, transit systems design, cell tower location, and many others. The book not only describes the strengths and weaknesses of currently available models, but also presents details on major developments, including solution procedures and applications, making it well suited both as a reference text and a textbook for graduate level courses.
_uhttps://link.springer.com/book/10.1007/978-3-319-99846-6#about
650 0 _aLand settlement patterns
650 0 _aRegional planning
650 0 _aRegional economics
650 0 _aGeographic information systems
650 0 _aPublic administration
650 0 _aPublic policy
650 0 _aOperations research
700 1 _aMurray, Alan,
_eauthor.
830 0 _aAdvances in spatial science.
830 0 _aThe regional science series.
900 _aMEF Üniversitesi Kütüphane katalog kayıtları RDA standartlarına uygun olarak üretilmektedir / MEF University Library Catalogue Records are Produced Compatible by RDA Rules
910 _aPandora
942 _2lcc
_cBKS
970 0 1 _aContents,
970 1 2 _l1.
_tLocation modeling and covering metrics,
_p1.
970 1 1 _l1.1.
_tLocation science,
_p1.
970 1 1 _l1.2.
_tStandards based coverage,
_p3.
970 1 1 _l1.3.
_tSite selection context and history,
_p6.
970 1 1 _l1.4.
_tSurveillance, sensors, and warning systems,
_p9.
970 1 1 _l1.5.
_tEmergency response,
_p12.
970 1 1 _l1.6.
_tNature reserve protection,
_p13.
970 1 1 _l1.7.
_tSpatial separation,
_p15.
970 1 1 _l1.8.
_tExpanded locational constructs,
_p16.
970 1 1 _l1.9.
_tGeneral form of coverage,
_p16.
970 1 1 _l1.10.
_tSummary and concluding remarks,
_p17.
970 0 1 _aReferences,
_p19.
970 1 2 _l2.
_tClassic Beginnings,
_p23.
970 1 1 _l2.1.
_tIntroduction,
_p23.
970 1 1 _l2.2.
_tTheory and innovation,
_p24.
970 1 1 _l2.3.
_tLocation set covering problem,
_p27.
970 1 1 _l2.3.1.
_tFormulation,
_p28.
970 1 1 _l2.3.2.
_tPlanning facility deployment,
_p36.
970 1 1 _l2.3.3.
_tApplications,
_p30.
970 1 1 _l2.4.
_tMaximal covering location problem,
_p31.
970 1 1 _l2.4.1.
_tFormulation,
_p33.
970 1 1 _l2.4.2.
_tPlanning facility deployment,
_p36.
970 1 1 _l2.4.3.
_tApplications,
_p36.
970 1 1 _l2.5.
_tTheoretical linkages,
_p37.
970 1 1 _l2.6.
_tFixed charges,
_p42.
970 1 1 _l2.7.
_tSummary and concluding comments,
_p44.
970 0 1 _aReferences,
_p45.
970 1 2 _l3.
_t Extended Forms of Coverage,
_p49.
970 0 1 _l3.1.
_aIntroduction,
_p49.
970 1 1 _l3.2.
_tMultiple service,
_p50.
970 1 1 _l3.3.
_tExisting service system,
_p53.
970 1 1 _l3.4.
_tSite quality,
_p54.
970 1 1 _l3.5.
_tMultiple objectives,
_p57.
970 1 1 _l3.6.
_tBackup coverage,
_p59.
970 1 1 _l3.7.
_tCoordinated systems,
_p62.
970 1 1 _l3.7.1.
_tFacility type,
_p63.
970 1 1 _l3.7.2.
_tAssisting facility types,
_p67.
970 1 1 _l3.7.3.
_tCoordinated access,
_p68.
970 1 1 _l3.7.4.
_tConditional coverage,
_p70.
970 1 1 _l3.8.
_tHierarchical services,
_p72.
970 1 1 _l3.8.1.
_tSuccessively inclusive services,
_p72.
970 1 1 _l3.8.2.
_tActivities between levels,
_p74.
970 1 1 _l3.9.
_tMultiple optima,
_p76.
970 1 1 _l3.10.
_tSummary and concluding comments,
_p77.
970 1 2 _l4.
_tProbabilistic coverage,
_p81.
970 1 1 _l4.1.
_aIntroduction,
_t81.
970 1 1 _l4.2.
_tReliable coverage,
_p83.
970 1 1 _l4.3.
_tExpected coverage,
_p88.
970 1 1 _l4.4.
_tMaximal reliable coverage,
_p91.
970 1 1 _l4.5.
_tQueuing,
_p94.
970 1 1 _l4.6.
_tFacility availability,
_p97.
970 1 1 _l4.7.
_tExtensions,
_p102.
970 1 1 _l4.8.
_tSummary and concluding comments,
_p104.
970 0 1 _aReferences,
_p104.
970 1 2 _l5.
_tAnti-cover,
_p107.
970 1 1 _l5.1.
_aIntroduction,
_p107.
970 1 1 _l5.2.
_tSeparation context,
_p108.
970 1 1 _l5.2.1.
_tSeparation to avoid concentration around demand,
_p109.
970 1 1 _l5.2.2.
_tSeparation between sited facilities,
_p109.
970 1 1 _l5.3.
_tModel construct,
_p111.
970 1 1 _l5.4.
_tMathematical structure,
_p113.
970 1 1 _l5.4.1.
_tCliques,
_p114.
970 1 1 _l5.4.2.
_tHybrid,
_p117.
970 1 1 _l5.4.3.
_tTheoretical bounds,
_p119.
970 1 1 _l5.5.
_tRelaxations and extensions,
_p120.
970 1 1 _l5.5.1.
_tRelaxation,
_p120.
970 1 1 _l5.5.2.
_tExtension,
_p123.
970 1 1 _l5.6.
_tInefficiency,
_p125.
970 1 1 _l5.7.
_tFacets and more,
_p127.
970 1 1 _l5.8.
_tSummary and concluding comments,
_p127.
970 0 1 _aReferences,
_p128.
970 1 2 _l6.
_tWeighted benefit, variable radius, and gradual coverage,
_p131.
970 1 1 _l6.1.
_aIntroduction,
_p131.
970 1 1 _l6.2.
_tEquity and implied value of service,
_p132.
970 1 1 _l6.3.
_tGeneralized maximal covering location problem,
_p134.
970 1 1 _l6.4.
_tExpanded forms of generalized coverage,
_p137.
970 1 1 _l6.5.
_tEndogenously determined coverage,
_p139.
970 1 1 _l6.6.
_tContinupus endogenous coverage,
_p142.
970 1 1 _l6.7.
_tGradual coverage,
_p145.
970 1 1 _l6.8.
_tSummary and concluding comments,
_p147.
970 0 1 _aReferences,
_p147.
970 1 2 _l7.
_tCapture, capacities, and thresholds,
_p149.
970 0 1 _l7.1.
_aIntroduction,
_p149.
970 1 1 _l7.2.
_tMaximum capture,
_p150.
970 1 1 _l7.3.
_tCapturing / intercepting flow,
_p156.
970 1 1 _l7.4.
_tCapacities,
_p158.
970 1 1 _l7.4.1.
_tSystem optimal perspective,
_p160.
970 1 1 _l7.4.2.
_tUser optimal perspective,
_p163.
970 1 1 _l7.4.3.
_tEquel fraction perspective,
_p166.
970 1 1 _l7.5.
_tThresholds,
_p168.
970 1 1 _l7.6.
_tFranchise territory design,
_p171.
970 1 1 _l7.7.
_tSummary and concluding comments,
_p173.
970 0 1 _aReferences,
_p174.
970 1 2 _tContinuous space coverage,
_p177.
970 0 1 _l8.1.
_aIntroduction,
_p177.
970 1 1 _l8.2.
_tProblems,
_p182.
970 1 1 _l8.2.1.
_tDiscrete demand,
_p182.
970 1 1 _l8.2.2.
_tDiscrete potential facility locations,
_p183.
970 1 1 _l8.3.
_tFormulations,
_p184.
970 1 1 _l8.4.
_tSimplification and relaxation,
_p187.
970 1 1 _l8.4.1.
_tDiscrete demand discrete potential facility locations,
_p187.
970 1 1 _l8.4.2.
_tDiscrete demand potential facility locations,
_p188.
970 1 1 _l8.4.3.
_tDiscrete demand,
_p193.
970 1 1 _l8.5.
_tTransformation and solution,
_p195.
970 1 1 _l8.5.1.
_tFinite dominating sets,
_p195.
970 1 1 _l8.5.2.
_tp-Center,
_p197.
970 1 1 _l8.5.3.
_tSkeleton,
_p198.
970 1 1 _l8.6.
_tSummary and concluding comments,
_p199.
970 0 1 _aReferences,
_p200.
970 1 2 _l9.
_tDiscription, protection, and resilience,
_p203.
970 0 1 _l9.1.
_aIntroduction,
_p203.
970 1 1 _l9.2.
_ar-interduction,
_p204.
970 1 1 _l9.3.
_tDesign sensitive facility loss,
_p207.
970 1 1 _l9.4.
_tPlanning for greater levels of disruption,
_p211.
970 1 1 _l9.5.
_tIssues when providing complete coverage,
_p215.
970 1 1 _l9.6.
_tCoverage loss when supporting infrastructure is lost,
_p216.
970 1 1 _l9.7.
_tDefensive coverage,
_p219.
970 1 1 _l9.8.
_tFacility fortification,
_p220.
970 1 1 _l9.9.
_tApplications,
_p224.
970 1 1 _l9.10.
_tSummary and concluding comments,
_p225.
970 0 1 _aReferences,
_p225.
970 1 1 _l10.
_tCoverage of network-based structures : paths, tours and trees,
_p229.
970 0 1 _l10.1.
_aIntroduction,
_p229.
970 1 1 _l10.2.
_tShortest covering path,
_p230.
970 1 1 _l10.2.1.
_tSubtour issues,
_p232.
970 1 1 _l10.2.2.
_tAlternatives for eliminating subtours,
_p237.
970 1 1 _l10.3.
_tSalesman and tour coverage,
_p239.
970 1 1 _l10.4.
_tMaximal coverage variants,
_p241.
970 1 1 _l10.4.1.
_tTrees,
_p245.
970 1 1 _l10.5.
_tArc improvement,
_p248.
970 1 1 _l10.6.
_tApplications,
_p250.
970 1 1 _l10.7.
_tSummary and concluding comments,
_p251.
970 0 1 _aReferences,
_p252.
970 1 2 _l11.
_tGrand challenges,
_p255.
970 0 1 _l11.1.
_aIntroduction,
_p255.
970 1 1 _l11.2.
_tBig data,
_p256.
970 1 1 _l11.2.1.
_tAlgorithms for larger, more nuanced problems,
_p257.
970 1 1 _l11.2.2.
_tBalancing the use for actual aggregated data,
_p259.
970 1 1 _l11.3.
_tDeveloping better models and sevice assumptions,
_p259.
970 1 1 _l11.4.
_tProblem transformation,
_p261.
970 1 1 _l11.5.
_tFlexible and accessible location application software systems,
_p262.
970 1 1 _l11.6.
_tGIS developers,
_p264.
970 1 1 _l11.7.
_tArtificial intelligence and machine learning,
_p265.
970 1 1 _l11.8.
_tSummary and concluding comments,
_p265.
970 0 1 _aReferences,
_p266.
970 0 1 _aIndex,
_p267.
999 _c27078
_d27078