PEAR: a massively parallel evolutionary computation approach for political redistricting optimization and analysis

Political redistricting, a well-known problem in political science and geographic information science, can be formulated as a combinatorial optimization problem, with objectives and constraints defined to meet legal requirements. The formulated optimization problem is NP-hard. We develop a scalable...

Celý popis

Podrobná bibliografie

Vydáno v:	Swarm and evolutionary computation Ročník 30; s. 78 - 92
Hlavní autoři:	Liu, Yan Y., Cho, Wendy K. Tam, Wang, Shaowen
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.10.2016
Témata:	Combinatorial optimization Evolutionary algorithm Heuristics High-performance parallel computing Redistricting Spatial optimization High-performance parallel computing Combinatorial optimization Spatial optimization Evolutionary algorithm Heuristics Redistricting
ISSN:	2210-6502
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!