{"id":"https://openalex.org/W7160825658","doi":"https://doi.org/10.48550/arxiv.2605.06682","title":"Fast and Effective Redistricting Optimization via Composite-Move Tabu Search","display_name":"Fast and Effective Redistricting Optimization via Composite-Move Tabu Search","publication_year":2026,"publication_date":"2026-04-24","ids":{"openalex":"https://openalex.org/W7160825658","doi":"https://doi.org/10.48550/arxiv.2605.06682"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.06682","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.06682","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.06682","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135893986","display_name":"Hai Jin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jin, Hai","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5003854328","display_name":"Diansheng Guo","orcid":"https://orcid.org/0000-0003-3483-4153"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Guo, Diansheng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.6590999960899353,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.6590999960899353,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.16769999265670776,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.03280000016093254,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/contiguity","display_name":"Contiguity","score":0.8909000158309937},{"id":"https://openalex.org/keywords/tabu-search","display_name":"Tabu search","score":0.7950000166893005},{"id":"https://openalex.org/keywords/guided-local-search","display_name":"Guided Local Search","score":0.5630000233650208},{"id":"https://openalex.org/keywords/redistricting","display_name":"Redistricting","score":0.5320000052452087},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.5228000283241272},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.44769999384880066},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4255000054836273},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42480000853538513}],"concepts":[{"id":"https://openalex.org/C68767595","wikidata":"https://www.wikidata.org/wiki/Q1677999","display_name":"Contiguity","level":2,"score":0.8909000158309937},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.7950000166893005},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7081000208854675},{"id":"https://openalex.org/C90189156","wikidata":"https://www.wikidata.org/wiki/Q5615481","display_name":"Guided Local Search","level":3,"score":0.5630000233650208},{"id":"https://openalex.org/C2778477362","wikidata":"https://www.wikidata.org/wiki/Q7305983","display_name":"Redistricting","level":3,"score":0.5320000052452087},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.5228000283241272},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48750001192092896},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.44769999384880066},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4255000054836273},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42480000853538513},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.4020000100135803},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3601999878883362},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34049999713897705},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.33239999413490295},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.3319999873638153},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3278000056743622},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2890999913215637},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2838999927043915},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.2777000069618225},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.2752000093460083},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.2619999945163727},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.25099998712539673}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.06682","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.06682","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.06682","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.06682","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/1","score":0.4570913314819336,"display_name":"No poverty"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Spatial":[0],"redistricting":[1],"is":[2,26],"a":[3,55,74,88,98,111],"practical":[4],"combinatorial":[5],"optimization":[6,184],"problem":[7],"that":[8,60,93,106,140],"demands":[9],"high-quality":[10],"solutions,":[11],"rapid":[12],"turnaround,":[13],"and":[14,20,45,117,134,150,158,178,190],"flexibility":[15],"to":[16,154],"accommodate":[17],"multi-criteria":[18,180],"objectives":[19],"interactive":[21],"refinement.":[22],"A":[23],"central":[24],"challenge":[25],"the":[27,40,47,63,141,164,167,172],"contiguity":[28,31,129],"constraint:":[29],"enforcing":[30],"in":[32,49,67,122,163,176],"integer-programming":[33],"or":[34,97],"heuristic":[35],"search":[36,48,58,69,157],"can":[37,94,107,169],"severely":[38],"shrink":[39],"feasible":[41,64],"neighborhood,":[42],"weaken":[43],"exploration,":[44],"trap":[46],"poor":[50],"local":[51],"optima.":[52],"We":[53],"introduce":[54],"composite-move":[56],"Tabu":[57,68,156],"(CM-Tabu)":[59],"systematically":[61],"expands":[62],"neighborhood":[65],"space":[66],"while":[70],"preserving":[71],"contiguity.":[72],"When":[73],"boundary":[75],"unit":[76],"cannot":[77],"be":[78,108],"reassigned":[79],"individually":[80],"without":[81],"disconnecting":[82],"its":[83],"district,":[84],"our":[85],"method":[86],"identifies":[87],"minimal":[89],"set":[90],"of":[91,100,104],"units":[92,101],"move":[95],"together,":[96],"pair":[99],"(or":[102],"sets":[103],"units)":[105],"switched,":[109],"as":[110],"contiguity-preserving":[112],"composite":[113,118],"move.":[114],"Candidate":[115],"single-unit":[116],"moves":[119],"are":[120],"generated":[121],"linear":[123],"time":[124],"by":[125],"analyzing":[126],"each":[127],"district's":[128],"graph":[130],"using":[131],"articulation":[132],"points":[133],"biconnected":[135],"components.":[136],"Extensive":[137],"experiments":[138],"demonstrate":[139],"proposed":[142],"approach":[143,168],"substantially":[144],"improves":[145],"solution":[146],"quality,":[147],"run-to-run":[148],"robustness,":[149],"computational":[151],"efficiency":[152],"relative":[153],"traditional":[155],"other":[159],"baselines.":[160],"For":[161],"example,":[162],"Philadelphia":[165],"case,":[166],"consistently":[170],"attain":[171],"theoretical":[173],"global":[174],"optimum":[175],"population-equality":[177],"support":[179],"trade-offs.":[181],"CM-Tabu":[182],"delivers":[183],"performance":[185],"suitable":[186],"for":[187],"real-world":[188],"practices":[189],"decision-support":[191],"workflows.":[192]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-12T00:00:00"}