Σύγκριση μεθόδων
Εξετάστε τις επιλεγμένες μεθόδους δίπλα-δίπλα· οι γραμμές που διαφέρουν επισημαίνονται.
| Μοντέλα Τοποθέτησης-Διάθεσης (Location-Allocation Models)× | Ανάλυση Πολλαπλών Κριτηρίων Βάσει ΓΣΠ (GIS-MCDA)× | Ακέραιος Προγραμματισμός× | Ελάχιστο Κόστος Διαδρομής / Ανάλυση Απόστασης Κόστους× | Γραμμικός Προγραμματισμός× | |
|---|---|---|---|---|---|
| Πεδίο≠ | Χωρική Ανάλυση | Χωρική Ανάλυση | Βελτιστοποίηση | Χωρική Ανάλυση | Βελτιστοποίηση |
| Οικογένεια | Process / pipeline | Process / pipeline | Process / pipeline | Process / pipeline | Process / pipeline |
| Έτος προέλευσης≠ | 1963 | 2006 | 1958 | 1994 | 1947 |
| Δημιουργός≠ | Leon Cooper; S. L. Hakimi | Jacek Malczewski (GIS-MCDA synthesis) | Ralph Gomory (cutting planes, 1958); land-and-doig branch-and-bound (1960) | Edsger Dijkstra (shortest path); GIS cost-surface adaptation | George B. Dantzig |
| Τύπος≠ | Spatial facility-location optimization | Spatial multi-criteria suitability/decision analysis | Mathematical optimisation — exact combinatorial method | Raster cost-surface routing | Mathematical 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: 9780471283669 | Dijkstra, 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 modelleri | GIS-MCDM, spatial multi-criteria analysis, GIS-AHP, weighted overlay suitability | IP, MIP, mixed-integer programming, mixed-integer linear programming | cost-distance analysis, accumulated cost surface, least-cost corridor, en düşük maliyetli yol | LP, linear optimization, Doğrusal Programlama (LP) |
| Συναφείς≠ | 4 | 4 | 4 | 3 | 4 |
| Σύνοψη≠ | 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Σύνολο δεδομένων ↗ |
|
|
|
|
|