<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>Shahid Beheshti University</PublisherName>
				<JournalTitle>International Journal of Research and Technology in Electrical Industry</JournalTitle>
				<Issn>2821-0190</Issn>
				<Volume>4</Volume>
				<Issue>2</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>07</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A Comparative Study of Reordering Techniques for Consecutive Numbering in Power Grids</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">106597</ELocationID>
			
<ELocationID EIdType="doi">10.48308/ijrtei.2025.240539.1093</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Mohammad</FirstName>
					<LastName>Shahraeini</LastName>
<Affiliation>Department of Electrical Engineering, Golestan University, Golestan , Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2025</Year>
					<Month>07</Month>
					<Day>02</Day>
				</PubDate>
			</History>
		<Abstract>The structure and ordering of nodes in power grids significantly affect the performance of algorithms used for simulation, optimization, and visualization. While synthetic generation of power grids has gained momentum in both transmission and distribution domains, limited research has addressed how node indexing impacts matrix sparsity patterns and computational performance. This paper presents a comprehensive study of node reordering techniques aimed at achieving consecutive numbering in complex power networks. Four categories of methods are explored: heuristic approaches, optimization-based strategies, graph-theoretic algorithms, and artificial intelligence (AI)-driven models. We revisit existing heuristics and propose a novel metaheuristic optimization method that maximizes diagonal density across multiple bandwidth levels. For radial distribution grids, we develop a graph-based method using depth-first search (DFS) that aligns node numbering with physical structure. In addition, we evaluate the feasibility of using convolutional and feedforward neural networks to learn reordering patterns from data. Despite training on thousands of synthetic graphs, standard AI models fail to produce valid permutations, highlighting the need for permutation-aware architectures. Extensive experiments on synthetic transmission and distribution networks confirm that method selection should align with network topology. Optimization excels in meshed systems, while graph-based DFS is ideal for tree-like networks. A comparative analysis is provided to guide future applications and research in this space.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Complex Power Networks</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Synthetic Power Grids</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Node Reordering</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Diagonal Density</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Consecutive Numbering</Param>
			</Object>
		</ObjectList>
</Article>
</ArticleSet>
