Jämför metoder
Granska de valda metoderna sida vid sida; rader som skiljer sig är markerade.
| Lokalisering-allokeringsmodeller× | Heltalsprogrammering× | |
|---|---|---|
| Ämnesområde≠ | Rumslig analys | Optimering |
| Familj | Process / pipeline | Process / pipeline |
| Ursprungsår≠ | 1963 | 1958 |
| Upphovsperson≠ | Leon Cooper; S. L. Hakimi | Ralph Gomory (cutting planes, 1958); land-and-doig branch-and-bound (1960) |
| Typ≠ | Spatial facility-location optimization | Mathematical optimisation — exact combinatorial method |
| Ursprungskälla≠ | Cooper, L. (1963). Location-allocation problems. Operations Research, 11(3), 331–343. DOI ↗ | Wolsey, L.A. (1998). Integer Programming. Wiley. ISBN: 9780471283669 |
| Alias≠ | facility location, p-median problem, maximal covering location problem, yer-tahsis modelleri | IP, MIP, mixed-integer programming, mixed-integer linear programming |
| Närliggande | 4 | 4 |
| Sammanfattning≠ | 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. | 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. |
| ScholarGateDatamängd ↗ |
|
|