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...

Full description

Bibliographic Details

Published in:	Swarm and evolutionary computation Vol. 30; pp. 78 - 92
Main Authors:	Liu, Yan Y., Cho, Wendy K. Tam, Wang, Shaowen
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.10.2016
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!