1018. Adding Relations with Short Communication Lengths between a Delegate and Every Other Member of the Same Level in a Complete K-ary Linking Pin Organization Structure
Invited abstract in session TB-20: Applications of combinatorial optimisation in industry and services 2, stream Combinatorial Optimization.
Tuesday, 10:30-12:00Room: Esther Simpson 2.11
Authors (first author is the speaker)
| 1. | Kiyoshi Sawada
|
| Department of Economic Information, University of Marketing and Distribution Sciences |
Abstract
A linking pin organization is a structure in which relations between members of the same section are added to a pyramid organization where there exist only relations between each superior and his direct subordinates. This study proposes a model of adding relations with short communication lengths between a delegate and every other member of the same level in a complete K-ary linking pin organization structure where every pair of nodes which have the same parent in a complete K-ary tree is adjacent. When edges between one node and every other node of depth N in a complete K-ary linking pin organization structure of height H are added where lengths of adding edges are shorter than lengths of edges of the complete K-ary linking pin organization structure, the total shortening distance which is the sum of shortening lengths of shortest paths between every pair of all nodes by adding edges is formulated. An optimal depth N such that the communication of information between every member in the organization becomes the most efficient is obtained by maximizing the total shortening distance.
Keywords
- Optimization Modeling
- Graphs and Networks
- Combinatorial Optimization
Status: accepted
Back to the list of papers