Matches in SemOpenAlex for { <https://semopenalex.org/work/W612637280> ?p ?o ?g. }
Showing items 1 to 77 of
77
with 100 items per page.
- W612637280 abstract "For numerous large-scale engineering and science problems, domain decomposition (DD) has generally been accepted by research communities as among the most attractive methods to obtain solutions efficiently. As a pre-requisite for the DD solution process, a large domain must be partitioned into several smaller sub-domains, with the key to success (of any DD partitioning algorithm) being the number of system boundary nodes. The lower this number, the more efficient the sub-domains can be processed in parallel. Although various transportation researchers have hinted at the use of DD, for example, in decentralized traffic management, it is always assumed the partition is provided. This paper presents a simple, efficient and effective algorithm to decompose a transportation network into a predefined number of inter-connected sub-domains such that the number of system boundary nodes is small (first priority) and the number of nodes in each sub-domain is similar (second priority). This algorithm was based on a simplified version of the Polynomial (partitioned) Label Correcting Algorithm (P-LCA), rather than the classical (Bellman-Ford) LCA, coupled with simple heuristic rules. To assess the effectiveness (in terms of minimizing the number of system boundary nodes) of the proposed Shortest Distance Decomposition Algorithm (SDDA), it is compared with METIS, which is currently the most widely used graph partitioning algorithm world-wide. Using large-scale, real-world transportation test networks, it was found the SDDA is significantly better than METIS; the SDDA outperformed METIS in 23 of 27 examples, and on average provided (approximately) 46% fewer boundary nodes for large-scale examples." @default.
- W612637280 created "2016-06-24" @default.
- W612637280 creator A5037974675 @default.
- W612637280 creator A5048451849 @default.
- W612637280 creator A5077349136 @default.
- W612637280 date "2014-01-01" @default.
- W612637280 modified "2023-09-23" @default.
- W612637280 title "An Efficient Shortest Distance Decomposition Algorithm for Large-Scale Transportation Network Problems" @default.
- W612637280 hasPublicationYear "2014" @default.
- W612637280 type Work @default.
- W612637280 sameAs 612637280 @default.
- W612637280 citedByCount "0" @default.
- W612637280 crossrefType "journal-article" @default.
- W612637280 hasAuthorship W612637280A5037974675 @default.
- W612637280 hasAuthorship W612637280A5048451849 @default.
- W612637280 hasAuthorship W612637280A5077349136 @default.
- W612637280 hasConcept C11413529 @default.
- W612637280 hasConcept C114614502 @default.
- W612637280 hasConcept C114809511 @default.
- W612637280 hasConcept C121332964 @default.
- W612637280 hasConcept C126255220 @default.
- W612637280 hasConcept C132525143 @default.
- W612637280 hasConcept C134306372 @default.
- W612637280 hasConcept C173801870 @default.
- W612637280 hasConcept C2778755073 @default.
- W612637280 hasConcept C33923547 @default.
- W612637280 hasConcept C36503486 @default.
- W612637280 hasConcept C41008148 @default.
- W612637280 hasConcept C42812 @default.
- W612637280 hasConcept C48903430 @default.
- W612637280 hasConcept C62354387 @default.
- W612637280 hasConcept C62520636 @default.
- W612637280 hasConcept C80444323 @default.
- W612637280 hasConceptScore W612637280C11413529 @default.
- W612637280 hasConceptScore W612637280C114614502 @default.
- W612637280 hasConceptScore W612637280C114809511 @default.
- W612637280 hasConceptScore W612637280C121332964 @default.
- W612637280 hasConceptScore W612637280C126255220 @default.
- W612637280 hasConceptScore W612637280C132525143 @default.
- W612637280 hasConceptScore W612637280C134306372 @default.
- W612637280 hasConceptScore W612637280C173801870 @default.
- W612637280 hasConceptScore W612637280C2778755073 @default.
- W612637280 hasConceptScore W612637280C33923547 @default.
- W612637280 hasConceptScore W612637280C36503486 @default.
- W612637280 hasConceptScore W612637280C41008148 @default.
- W612637280 hasConceptScore W612637280C42812 @default.
- W612637280 hasConceptScore W612637280C48903430 @default.
- W612637280 hasConceptScore W612637280C62354387 @default.
- W612637280 hasConceptScore W612637280C62520636 @default.
- W612637280 hasConceptScore W612637280C80444323 @default.
- W612637280 hasLocation W6126372801 @default.
- W612637280 hasOpenAccess W612637280 @default.
- W612637280 hasPrimaryLocation W6126372801 @default.
- W612637280 hasRelatedWork W1526500585 @default.
- W612637280 hasRelatedWork W1534525309 @default.
- W612637280 hasRelatedWork W1978180883 @default.
- W612637280 hasRelatedWork W1999114241 @default.
- W612637280 hasRelatedWork W2037112918 @default.
- W612637280 hasRelatedWork W2052455426 @default.
- W612637280 hasRelatedWork W2078294695 @default.
- W612637280 hasRelatedWork W2109169867 @default.
- W612637280 hasRelatedWork W2116192274 @default.
- W612637280 hasRelatedWork W2141024174 @default.
- W612637280 hasRelatedWork W2147926631 @default.
- W612637280 hasRelatedWork W2149288610 @default.
- W612637280 hasRelatedWork W2156133824 @default.
- W612637280 hasRelatedWork W2158052609 @default.
- W612637280 hasRelatedWork W2592467246 @default.
- W612637280 hasRelatedWork W2648707500 @default.
- W612637280 hasRelatedWork W2793156072 @default.
- W612637280 hasRelatedWork W2987870135 @default.
- W612637280 hasRelatedWork W3192273927 @default.
- W612637280 hasRelatedWork W3208407676 @default.
- W612637280 isParatext "false" @default.
- W612637280 isRetracted "false" @default.
- W612637280 magId "612637280" @default.
- W612637280 workType "article" @default.