Salīdzināt metodes
Apskatiet izvēlētās metodes blakus; rindas, kas atšķiras, ir izceltas.
| Multi-kritēriju lēmumu analīze, kas balstīta uz ĢIS (GIS-MCDA)× | Integer Programming× | |
|---|---|---|
| Nozare≠ | Telpiskā analīze | Optimizācija |
| Saime | Process / pipeline | Process / pipeline |
| Izcelsmes gads≠ | 2006 | 1958 |
| Autors≠ | Jacek Malczewski (GIS-MCDA synthesis) | Ralph Gomory (cutting planes, 1958); land-and-doig branch-and-bound (1960) |
| Tips≠ | Spatial multi-criteria suitability/decision analysis | Mathematical optimisation — exact combinatorial method |
| Pirmavots≠ | 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 |
| Citi nosaukumi≠ | GIS-MCDM, spatial multi-criteria analysis, GIS-AHP, weighted overlay suitability | IP, MIP, mixed-integer programming, mixed-integer linear programming |
| Saistītās | 4 | 4 |
| Kopsavilkums≠ | 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. |
| ScholarGateDatu kopa ↗ |
|
|