ScholarGate
Асистент

Сравнение на методи

Прегледайте избраните методи един до друг; редовете с разлики са откроени.

Модели за локация-разпределение×Мултикритериална анализ на решенията, базиран на ГИС (GIS-MCDA)×Цялочислено оптимиране×Анализ на най-малкия разход / анализ на разстоянието до разхода×Линейно оптимиране×
ОбластПространствен анализПространствен анализОптимизацияПространствен анализОптимизация
СемействоProcess / pipelineProcess / pipelineProcess / pipelineProcess / pipelineProcess / pipeline
Година на възникване19632006195819941947
СъздателLeon Cooper; S. L. HakimiJacek Malczewski (GIS-MCDA synthesis)Ralph Gomory (cutting planes, 1958); land-and-doig branch-and-bound (1960)Edsger Dijkstra (shortest path); GIS cost-surface adaptationGeorge B. Dantzig
ТипSpatial facility-location optimizationSpatial multi-criteria suitability/decision analysisMathematical optimisation — exact combinatorial methodRaster cost-surface routingMathematical programming / continuous optimization
Основополагащ източникCooper, L. (1963). Location-allocation problems. Operations Research, 11(3), 331–343. DOI ↗Malczewski, J. (2006). GIS-based multicriteria decision analysis: a survey of the literature. International Journal of Geographical Information Science, 20(7), 703–726. DOI ↗Wolsey, L.A. (1998). Integer Programming. Wiley. ISBN: 9780471283669Dijkstra, E. W. (1959). A note on two problems in connexion with graphs. Numerische Mathematik, 1(1), 269–271. DOI ↗Dantzig, G.B. (1963). Linear Programming and Extensions. Princeton University Press. ISBN: 9780691059136
Други названияfacility location, p-median problem, maximal covering location problem, yer-tahsis modelleriGIS-MCDM, spatial multi-criteria analysis, GIS-AHP, weighted overlay suitabilityIP, MIP, mixed-integer programming, mixed-integer linear programmingcost-distance analysis, accumulated cost surface, least-cost corridor, en düşük maliyetli yolLP, linear optimization, Doğrusal Programlama (LP)
Свързани44434
РезюмеLocation-allocation models decide where to place a set of facilities and simultaneously assign demand points to them so as to optimize an objective such as total travel cost, worst-case distance, or population covered. Rooted in the operations-research work of Cooper (1963) and Hakimi (1964) and central to network GIS, they answer questions like where to site warehouses, hospitals, fire stations, or schools to best serve a spatially distributed population.GIS-MCDA combines the map layers of a geographic information system with multi-criteria decision analysis to produce suitability or priority maps — ranking locations by how well they satisfy several weighted criteria at once. It is the standard framework for spatial decisions such as siting hospitals, solar farms, landfills, or evacuation areas, integrating methods like AHP, TOPSIS, and weighted overlay with spatial data.Integer programming (IP), also called mixed-integer programming (MIP) when only some variables are restricted to whole numbers, is a branch of mathematical optimisation in which some or all decision variables must take integer or binary values. Building on linear programming, it was formalised through Ralph Gomory's cutting-plane method (1958) and the Land-and-Doig branch-and-bound algorithm (1960), and it has since become the standard exact framework for scheduling, assignment, routing, and resource-allocation problems.Least-cost path analysis finds the route between two locations that minimizes accumulated travel cost across a landscape, rather than minimizing straight-line distance. By encoding terrain, slope, land cover, and other frictions into a cost surface and accumulating cost outward from a source, it identifies optimal corridors for roads, pipelines, trails, power lines, and wildlife movement — a core raster-GIS technique built on Dijkstra's shortest-path logic.Linear programming (LP), pioneered by George B. Dantzig in 1947, is a mathematical method for finding the best value of a linear objective function — such as minimum cost or maximum profit — subject to a set of linear inequality and equality constraints. It is the foundational technique in operations research and underlies production planning, resource allocation, logistics, diet problems, and countless other decision-making scenarios across engineering, economics, and the natural sciences.
ScholarGateНабор от данни
  1. v1
  2. 2 Източници
  3. PUBLISHED
  1. v1
  2. 2 Източници
  3. PUBLISHED
  1. v1
  2. 2 Източници
  3. PUBLISHED
  1. v1
  2. 2 Източници
  3. PUBLISHED
  1. v1
  2. 2 Източници
  3. PUBLISHED

Към търсенето Изтегляне на слайдове

ScholarGateСравнение на методи: Location-Allocation · GIS-MCDA · Integer Programming · Least-Cost Path · Linear Programming. Извлечено на 2026-06-15 от https://scholargate.app/bg/compare