• Journal of Korean Society of Transportation
• /
• v.26 no.6
• /
• pp.103-112
• /
• 2008

Implementing hub networks in logistics is generally attractive and effective because of cost savings derived from economies of scale on network transportation, and objective of the hub network design problem is to decide optimal hub locations, and the transportation route of each origin-destination pair. This problem is generally a NP-complete problem not to solve easily, and it is almost impossible to find optimal solutions considering the big-sized network within a reasonable time. This research tried to find optimal logistics strategy in the given big-sized real network and the freight origin-destination data. The objective function, which was proposed by Honor and O'kelly (2001), that rewards economies of scale on network links with increase of transportation volumes, is applied. This thesis proposed the optimal hub network of korea within a reasonable time based on engineering approaches. And it is expected that this thesis can contribute to plan freight policies which can improve to have competitive power in the level of a company or nation by reducing logistic costs.

• Journal of Korean Society of Transportation
• /
• v.29 no.2
• /
• pp.91-100
• /
• 2011

Hub network design for freight transportation is a decision process that determines hub locations together with freight transportation routes among shippers so as to ultimately minimize total logistics cost. This study presents the optimal location of hubs by strict hub network design policy with single allocation, which overcomes the limitation of Kim et al. (2008) that does not allow direct transportation among shippers. The greedy-interchange algorithm is employed for hub location decision process, and EMME/2 is adopted for the route searching process. Application of the processes to the nationwide highway network shows that the best hub locations in order are Seoul metropolitan, GyeongNam, Chung-nam, Jeon-Nam, Gyeong-Buk, Chung-Buk, and the locations are concentrated on the Seoul-Busan corridor. The strict hubnetwork design policy with single allocation increases the transportation distance but decreases the transportation cost by passing through the hubs instead of direct transportation. The reduction in total transportation cost can be achieved as the number of hubs increases, but the amount of the reduction gradually decreases because the cost reduction from the decrease in detour transportation distance between non-hubs and hubs becomes less than the discount reduction from dispersion of inter-hubs transportation volumes.

• The Journal of the Korea Contents Association
• /
• v.12 no.9
• /
• pp.348-356
• /
• 2012

This study is identifying early takeoff phenomenon in relational network like SNS and investigates influence of innovator or hub at early takeoff and diffusion size at takeoff point. The major finding of this study are as follows. First, multinominal-logit analysis conducted to explore the impact of innovator and hub at early stage of information diffusion and early takeoff. Hub in early stage of information diffusion impact early takeoff. Second, our study shows that innovator and hub at early stage of information diffusion impact diffusion size at takeoff point. Third, hub is more impact early takeoff and diffusion size at takeoff point then innovator. This study provides implication for professionals by confirming hub's influence in study of successful information diffusion by early takeoff. The limitation and future direction are discussed.

• Proceedings of the Technology Innovation Conference
• /
• 2003.06a
• /
• pp.90-107
• /
• 2003

참여정부의 출범과 한께 과학기술계에서는 동북아 과학기술 허브 구축방안 논의가 활발히 진행되고 있으나, 현재까지 이러한 논의는 법제도의 정비 및 과학기술특구 건설 등의 이슈에 한정되고 있는 실정이며, 더욱이 이를 뒷받침할 실증적 연구는 미미하다. 허브란 개념이 네트워크에서의 중심성(centrality)을 의미 하며, 현재 및 미래의 과학학기술협력 네트워크 발전에 정보통신기술이 중요한 역할을 수행함을 고려할 때, 우리나라의 초고속통신망 인프라를 십분 활용한 차세대 과학기술 정보인프라의 구축을 통한 동북아 사이버 연구네트워크상의 허브화(궁극적으로는 e-Science의 허브화를 지향)는 지역 클러스터 건설을 통한 물리적 허브화 못지 않게 중요하다 하겠다. 본 연구는 먼저 네트워크 분석기법을 동아시아의 과학기술협력 네트워크에 적용하여 주요 네트워크 지수를 실증적으로 진단하고, 특히 이를 유럽연합의 과학기술협력 네트워크의 패턴과 비교 분석하였다. 유럽 연합은 1984년부터 과학기술 협력 프로그램인 Framework Program을 시작하여 일찍부터 역내 과학기술협력 프로그램을 운영해 온 경험을 가지고 있고, 2000년부터는 자발적 협력과 네트워킹을 통해 유럽의 연구 개발 활동을 통합·조정하기 위해 새롭게 제안된 유럽 연구개발권 (European Research Area) 형성이 구체화되고 있어, 동북아 과학기술협력 네트워크를 건설하는데 좋은 벤치마킹 대상이라 할 수 있다. 이 보고서에서는 유럽 연구개발귄이라는 우산 아래서 유럽의 과학기술 활동이 조정 및 통합되는 과정을 살펴보고, 이를 위한 과학기술 정보인프라의 주요 기능을 컨텐트 (연구정보서비스와 메타데이터 표준), 시스템 (슈퍼 컴퓨팅, 광대역 네트워크, GRID), e-Science 응용연구 별로 살펴보았다. 끝으로 유럽의 경험을: 교훈삼아 동북아 e-Science 네트워크의 건설을 위한 정책적 시사점과 동북아 연구개발정보 Portal 및 APEC APGrid 연구망 등의 구체적인 정보인프라 구축방안을 도출하였다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.202-213
• /
• 2007

A network is an important model widely used in natural and social science as well as engineering. To analyze these networks easily it is necessary that we should layout the features of networks visually. These Graph-Layout researches have been performed recently according to the development of the computer technology. Among them, the Scale-free Network that stands out in these days is widely used in analyzing and understanding the complicated situations in various fields. The Scale-free Network is featured in two points. The first, the number of link(Degree) shows the Power-function distribution. The second, the network has the hub that has multiple links. Consequently, it is important for us to represent the hub visually in Scale-free Network but the existing Graph-layout algorithms only represent clusters for the present. Therefor in this thesis we suggest Graph-layout algorithm that effectively presents the Scale-free network. The Hubity(hub+ity) repulsive force between hubs in suggested algorithm in this thesis is in inverse proportion to the distance, and if the degree of hubs increases in a times the Hubity repulsive force between hubs is ${\alpha}^{\gamma}$ times (${\gamma}$??is a connection line index). Also, if the algorithm has the counter that controls the force in proportion to the total node number and the total link number, The Hubity repulsive force is independent of the scale of a network. The proposed algorithm is compared with Graph-layout algorithm through an experiment. The experimental process is as follows: First of all, make out the hub that exists in the network or not. Check out the connection line index to recognize the existence of hub, and then if the value of connection line index is between 2 and 3, then conclude the Scale-free network that has a hub. And then use the suggested algorithm. In result, We validated that the proposed Graph-layout algorithm showed the Scale-free network more effectively than the existing cluster-centered algorithms[Noack, etc.].

• Journal of Korean Society of Transportation
• /
• v.27 no.1
• /
• pp.129-141
• /
• 2009

Intermodal freight transportation is defined as the movement of freight from origins to destinations by two or more transportation modes. When implemented in hub networks, it could enhance the efficiency of the networks because consolidated flows are transported by more suitable modes and technologies. In spite of this advantage, the intermodal hub network design problem has received limited attention in the literature partly because of the complex nature of the problem. This paper aims to develop an optimization model for designing intermodal hub networks with sin91e allocation strategy. The model takes into account various cost components of intermodal hub networks including transportation, stationary inventory, and service delay costs. Moreover, using transport frequency variables, it is capable of endogenously determining the transportation economies of scale achieved by consolidation of flows. As such, the model is able to realistically represent the characteristics of intermodal hub networks in practice. Since the model Is a complicated nonlinear integer programming problem, we perform model simplification based on the analytical study of the model, which could facilitate the development of solution algorithms in the future. We expect that this study contributes to the design of intermodal hub networks as well as to the assessment of existing logistics systems.

• The Journal of the Korea Contents Association
• /
• v.8 no.6
• /
• pp.74-81
• /
• 2008

Protein interaction network contains a small number of highly connected protein, denoted hub and many destitutely connected proteins. Recently, several studies described that a hub protein is more likely to be essential than a non-hub protein. This phenomenon called as a centrality-lethality rule. This nile is widely credited to exhibit the importance of hub proteins in the complex network and the significance of network architecture as well. To confirm whether the rule is accurate, we Investigated all protein interaction DBs of yeast in the public sites such as Uetz, Ito, MIPS, DIP, SGB, and BioGRID. Interestingly, the protein network shows that the rule is correct in lower scale DBs (e.g., Uetz, Ito, and DIP) but is not correct in higher scale DBs (e.g., SGD and BioGRID). We are now analyzing the features of networks obtained from the SGD and BioGRD and comparing those of network from the DIP.

• Proceedings of the Korea Contents Association Conference
• /
• 2017.05a
• /
• pp.63-64
• /
• 2017

제4차 산업혁명이 시작되었고 한다. 인류가 한 번도 경험하지 못한 새로운 시대가 온다고 하며, 미래 사회의 변화에 전략적 대응 방안이 필요하다고 역설한다. 그럼에도 불구하고 제4차 산업혁명을 명확하게 이해하기가 쉽지 않다. 본 연구에서는 제4차 산업혁명과 세계미래보고서 2055에 있는 단어들의 상호작용 데이터베이스(DB)를 추출하였다. 추출한 DB를 기반으로 상호작용 네트워크를 구축하였다. 네트워크는 멱함수 성격을 가지는 전형적인 사회네트워크를 보여주었다. 제4차 산업혁명 네트워크에서는 제4차 산업혁명, 방법론, 국제안보문제, 사물인터넷, 신소재가 연결계수가 높은 허브 단어였으며, 세계미래보고서 네트워크에서는 인공지능, 메가시티, 자율주행차, 슈퍼휴먼, 텔로미어가 허브단어였다. 추출한 허브 단어를 중심으로 다양한 분야의 콘텐츠와 융합하면 미래세계에 필요한 융합 콘텐츠에 대한 통찰력을 얻을 것으로 기대한다.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.6D
• /
• pp.917-926
• /
• 2006

Transportation Economies of scale are the essential properties of hub networks. One critical property of the hub network design problem is to quantify cost savings which stem from economies of scale, the costs of operating hub facilities and opportunity costs associated with delays stemming from consolidation of traffic flows. Due to the NP-complete property of the hub location problem, however, most previous researchers have focused on the development of heuristic algorithms for approximate solutions. The purpose of this paper is to develop a hub network design model considering transportation economies of scale from the consolidation of traffic flows. The model is designed to consider the uniqueness of hub networks and to determine several cost components. The heuristic algorithms for the developed model are suggested and the results of the model are compared with recently published studies using real data. Results of the analysis show that the proposed model reflects transportation economies of scale due to consolidation of flows. This study can form not only the theoretical basis of an effective and rational hub network design but contribute to the assessment of existing and planned logistics systems.

• Journal of the Economic Geographical Society of Korea
• /
• v.12 no.4
• /
• pp.540-556
• /
• 2009

The hub and spoke network is a critical network-based infrastructure that is widely applied in current transportation and telecommunications systems, including Internets, air transportation networks and highway systems. This main idea of hub location models is to construct a network system which achieves the economy of scale of flows. The main purpose of this study is to introduce new hub location problems that take into account network reliability. Two standard models based on assignment schemes are proposed, and a minimum threshold model is provided as an extension in terms of hub network design. The reliability and interaction potentials of 15 nodes in the U.S. are used to examine model behaviors. According to the type of models and reliability, hubs, and minimum threshold levels, relationships among the flow economy of scale, network costs, and network resiliency are analyzed.