• Knowledge Management Research
• /
• v.11 no.1
• /
• pp.51-64
• /
• 2010

The exhibition and convention industries, which are recognized as industrial hub linked with many relational industries. It is important to prevent a excessive competition for convention centers among districts and to gain some benefit fairly. Each convention center needs a lot of convention to held in it's district. In order to obtain many conventions to held in Korea for many convention center, convention bureau has to manage the processes to attract convention with many collaborators using the convention hub-network system. We should, therefore, pay attention to construction of the convention Hub-Network system to activate the convention industries in the district. We lay out the critical design for three functions of the convention Hub-Network system using UML. Finally we show the demonstrative web pages that explain critical three functions.

• Journal of the Korean Society for Railway
• /
• v.7 no.3
• /
• pp.264-270
• /
• 2004

The hub-and-spoke strategy is widely used in the field of transportation. At the field of rail transportation, however, it is difficult that we find an application case of this strategy because of modal characteristics. According to the fast growth of containerization and the development of transshipment technology, presently, the hub-and-spoke strategy is introduced by operators on actual European rail freight transportation. However, it is hardly to find empirical studies evaluating the applicability of transportation strategy. In this context, this study analyzed the applicabilities of hub-and-spoke strategy in the actual network of European rail freight. For the application and evaluation of the characteristics of hub-and-spoke strategy, it utilized a service network design model for rail freight. Utilizing this model, it analyzed the efficiency of furnished rail freight services, the potential locations of hubs, the characteristics of O-D flows by the types of trains and service links, and the types of paths of O-D flows. Finally, it proposed some implications and the further study topics.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.1
• /
• pp.67-84
• /
• 2000

In this paper, we address a network design problem including the decision of hub facility locatiions which is typically found in a communicatio and a transportation network design studies. Due to the administrative and the geographical restrictions, it is common to assume that each user should be assigned to only one hub facility. To construct such a network, three types of network costs should be considered: the fixed costs of establishing the hubs and the arcs in the network, and the variable costs associated with transversing the network. The complex problem is formulated as a mixed IP embedding a multicommodity flow problem. Exploiting its special structure, a dual-based heuristic is then developed, which yields near-optimal design plans. The test results indicate that the heuristic is an effective way to solve this computationally complex problem.

• 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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.2
• /
• pp.141-155
• /
• 2006

In this paper, we address an extended hub-and-spoke transportation network design problem (EHSNP). In the existing hub location problems, the location and number of spokes, and shipments on spokes are given as input data. These may, however, be viewed as the variables according to the areas which they cover. Also, the vehicle routing in each spoke needs to be considered to estimate the network cost more correctly. The EHSNP is a problem of finding the location of hubs and spokes, and pickup/delivery routes from each spoke, while minimizing the total related transportation cost in the network. The EHSNP is an integrated problem that consists of several interrelated sub-problems. To solve EHSNP, we present an approach based on a symbiotic evolutionary algorithm (symbiotic EA), which are known as an efficient tool to solve complex integrated optimization problems. First, we propose a framework of symbiotic EA for EHSNP and its genetic elements suitable for each sub-problem. To analyze the proposed algorithm, the extensive experiments are performed with various test-bed problems. The results show that the proposed algorithm is promising in solving the EHSNP.

• Journal of Korean Society of Transportation
• /
• v.20 no.6
• /
• pp.157-158
• /
• 2002

• 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 Korean Society of Transportation
• /
• v.22 no.3 s.74
• /
• pp.167-177
• /
• 2004

The Hub-and-spoke strategy is widely used in the field of transportation. According to containerization and the development of transshipment technology, it is also introduced into European rail freight transportation. The objective of this article is to develop a service network design model for rail freight transportation based on the Hub-and-spoke strategy and efficient algorithms that can be applied to large-scale network. Although this model is for strategic decision, it includes not only general operational cost but also time-delay cost. The non-linearity of objective function due to time-delay factor is transformed into linearity by establishing train service variables by frequency. To solve large scale problem, this model used a heuristic method based on decomposition and three newly-developed algorithms. The new algorithms were examined with respect to four test problems base on the actual network of European rail freight and discussed the accuracy of solutions and the efficiency of proposed algorithms.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2005.05a
• /
• pp.59-71
• /
• 2005

In this paper we address a design problem for hub and spoke transportation networks and then consider a capacitated hub locations problem with direct shipment (CHLPwD). We determine the location of hubs, the allocation of nodes to hubs, and direct shipment paths in the network, with the objective of minimizing the total cost in the network. An evolutionary algorithm is developed here to solve the CHLPwD. To do this, we propose the representation and the genetic operators suitable for the problem and adopt a heuristic method for the allocation of nodes to hubs. To enhance the search capability, problem-specific information is used in our evolutionary algorithm. The proposed algorithm is compared with the heuristic method in terms of solution quality and computation time. The experimental results show that our algorithm can provide better solutions than the heuristic.

• 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.