Using GIS and K = 3 Central Place Lattices for Efficient Solutions to the Location Set-Covering Problem in a Bounded Plane.
Stephanie L. StraitiffRobert G. CromleyPublished in: Trans. GIS (2010)
Keyphrases
- efficient solutions
- bi objective
- set covering problem
- demand points
- bicriteria
- pareto local search
- geographic information systems
- optimal solution
- heuristic methods
- geographic information
- set covering
- spatial data
- branch and bound algorithm
- column generation
- branch and bound
- linear program
- particle swarm optimization
- dynamic programming
- evolutionary algorithm