• 대한산업공학회지
• /
• 제31권3호
• /
• pp.228-239
• /
• 2005

In this paper, we propose a new conceptual HVRPCR(Heterogeneous Fleet Vehicle Routing Problem with Customer Restriction) model including additional restrictions that are consisted of loadage limit and possible visit number of demand post in HVRP. We propose HVRPCR algorithm using the heuristic in order to solve speedily because VRP is NP-Hard and need many solution time. The proposed model is simulated with changing demand post location, demand weight, loading and possible visit number limitation. Results of the computational experiment are provided along with some analysis like travel cost reduction rate.

• 대한산업공학회지
• /
• 제40권4호
• /
• pp.435-441
• /
• 2014

This paper considers a single-product problem for inbound lot-sizing and outbound dispatching at a third-party warehouse, where the demand is dynamic over the discrete time horizon. Each demand must be delivered into the corresponding delivery time window which is the time interval characterized by the earliest and latest delivery dates of the demand. Ordered products are shipped by heterogeneous container types. Each container type has type-dependent carrying capacity and the unit freight cost depends on each container type. Total freight cost is proportional to the number of each container type used. Also it is assumed that related cost functions are concave and backlogging is not allowed. The objective of the paper is to simultaneously determine the optimal inbound lot-sizing and outbound dispatching plans that minimize total costs which include ordering, shipping, and inventory holding costs. The optimal solution properties are characterized for the problem and then a dynamic programming algorithm is presented to find the optimal solution.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권3호
• /
• pp.1249-1272
• /
• 2016

In this paper, we propose a symmetric key establishment scheme for wireless sensor networks which tries to minimize the resource usage while satisfying the security requirements. This is accomplished by taking advantage of the communication pattern of wireless sensor networks and adopting heterogeneous wireless sensor networks. By considering the unique communication pattern of wireless sensor networks due to the nature of information gathering from the physical world, the number of keys to be established is minimized and, consequently, the overhead spent for establishing keys decreases. With heterogeneous wireless sensor networks, we can build a hybrid scheme where a small number of powerful nodes do more works than a large number of resource-constrained nodes to provide enhanced security service such as broadcast authentication and reduce the burden of resource-limited nodes. In addition, an on-demand key establishment scheme is introduced to support extra communications and optimize the resource usage. Our performance analysis shows that the proposed scheme is very efficient and highly scalable in terms of storage, communication and computation overhead. Furthermore, our proposed scheme not only satisfies the security requirements but also provides resilience to several attacks.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2017년도 춘계학술대회
• /
• pp.387-390
• /
• 2017

임베디드 분야에서 고해상도 센서의 등장으로 Heterogeneous 컴퓨팅에 대한 수요가 지속적으로 증가하고 있다. 로직모듈은 LADAR 시스템 구성품을 제어하고, 고속의 레이저 영상 데이터를 실시간 3차원 영상화하기 위한 임베디드 시스템이다. 본 논문에서는 로직모듈의 설계와 CPU-GPU Heterogeneous 컴퓨팅을 활용한 로직모듈의 신호처리에 대해 설명하려고 한다.

• 대한교통학회지
• /
• 제26권3호
• /
• pp.155-167
• /
• 2008

본 연구에서는 다계층 가변수요 사용자 균형과 체계최적 교통망 균형 조건을 조사하고 그에 따른 해석적 알고리즘을 구축한다. 이러한 교통망 균형 조건을 조사함에 있어서 특별히 다음과 같은 가정을 기반으로 연구를 수행한다. 통행자들의 이질적(heterogeneous)인 특성을 반영하기 위하여 통행자 계층별로 이산적으로 구분된 시간가치를 갖고 있으며 통행비용에 따라 각 계층의 통행수요가 변화(variable demand)하는 상황을 고려한다. 본 연구에서는 우선 다계층 가변수요에서 도로 이용자들이 통행비용을 인식하는 단위가 시간 또는 화폐에 따라 도로 사용자의 통행패턴이 달라지는가를 조사한다. 즉, 통행비용을 측정하는 단위에 따라 사용자 균형조건이 달라지는가를 알아본다. 그리고 다계층 가변수요에서 통행비용이 시간 또는 화폐단위로 측정될 때의 체계최적 조건을 조사하고 어떤 특성을 갖는가를 조사한다. 최종적으로 이렇게 조사된 다계층 가변수요 사용자 균형조건과 체계최적조건을 이용하여 각 각의 해석적 통행배정 알고리즘을 구축한다.

• 경제분석
• /
• 제25권3호
• /
• pp.30-69
• /
• 2019

본 연구는 국제무역에 참여하고 있는 우리나라의 기업들을 대상으로 수출입이 기업의 노동수요에 미치는 영향을 살펴보았다. 통계청의 기업활동조사 데이터를 이용하여 2006년부터 2014년까지 제조업 24개 업종에 속해 있는 기업들의 수출입이 노동수요에 미치는 영향을 시스템 GMM 방법을 사용하여 분석하였다. 분석 결과, 생산성이 높은 기업에서는 수출이 늘어나면서 생산 확대를 위한 노동수요가 창출되는 효과가 나타난 반면 생산성이 낮은 기업에서는 이러한 효과가 유의하게 나타나지 않았다. 그러나 기업이 오프쇼어링을 이용하여 국내업무를 해외로 재배치한 경우, 수출이 유발하는 노동수요 증가 효과가 축소되는 것으로 분석되었다. 한편, 수입증대는 기업의 노동수요를 감소시키는 것으로 나타나는 데, 이는 수입제품이 노동을 대체하는 효과 때문인 것으로 보인다. 반면 기업이 오프쇼어링을 이용하는 경우, 생산 효율성 증대로 수입의 노동수요 감소효과가 완화되는 것으로 나타났다. 본 연구의 결과는 수출입이 기업의 고용에 미치는 영향은 기업의 생산성 및 글로벌 아웃소싱 참여 여부에 따라 달라질 수 있음을 시사한다.

• 품질경영학회지
• /
• 제51권4호
• /
• pp.497-514
• /
• 2023

Purpose: This study aims to estimate the demand for various public parking lots in Seoul by clustering similar demand types of parking lots and predicting the demand for new public parking lots. Methods: We examined real-time parking information data and used time series clustering analysis to cluster public parking lots with similar demand patterns. We also performed various regression analyses of parking demand based on diverse heterogeneous data that affect parking demand and proposed a parking demand prediction model. Results: As a result of cluster analysis, 68 public parking lots in Seoul were clustered into four types with similar demand patterns. We also identified key variables impacting parking demand and obtained a precise model for predicting parking demands. Conclusion: The proposed prediction model can be used to improve the efficiency and publicity of public parking lots in Seoul, and can be used as a basis for constructing new public parking lots that meet the actual demand. Future research could include studies on demand estimation models for each type of parking lot, and studies on the impact of parking lot usage patterns on demand.

• ETRI Journal
• /
• 제32권2호
• /
• pp.292-301
• /
• 2010

Increasing convergence among heterogeneous radio networks is expected to be a key feature of future ubiquitous services. The convergence of radio networks in combination with dynamic spectrum allocation (DSA) could be a beneficial means to solve the growing demand for radio spectrum. DSA might enhance the spectrum utilization of involved radio networks to comply with user requirements for high-quality multimedia services. This paper proposes a simple spectrum allocation algorithm and presents an analytical model of dynamic spectrum resource allocation between two networks using a 4-D Markov chain. We argue that there may exist a break-even point for choosing whether or not to adopt DSA in a system. We point out certain circumstances where DSA is not a viable alternative. We also discuss the performance of DSA against the degree of resource sharing using the proposed analytical model and simulations. The presented analytical model is not restricted to DSA, and can be applied to a general resource sharing study.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권7호
• /
• pp.3171-3191
• /
• 2016

Due to growing demand on wireless data traffic, a large number of different types of base stations (BSs) have been installed. However, space-time dependent wireless data traffic densities can result in a significant number of idle BSs, which implies the waste of power resources. To deal with this problem, we propose an active state control algorithm based on semi-Markov decision process (SMDP) for a heterogeneous network. A MDP in discrete time domain is formulated from continuous domain with some approximation. Suboptimal on-line learning algorithm with a random policy is proposed to solve the problem. We explicitly include coverage constraint so that active cells can provide the same signal to noise ratio (SNR) coverage with a targeted outage rate. Simulation results verify that the proposed algorithm properly controls the active state depending on traffic densities without increasing the number of handovers excessively while providing average user perceived rate (UPR) in a more power efficient way than a conventional algorithm.

• 한국BIM학회 논문집
• /
• 제12권4호
• /
• pp.52-60
• /
• 2022

Recently, the demand for connection between various heterogeneous dataset and BIM as a construction data model hub is increasing. In the past, in order to connect model between BIM and heterogeneous dataset, related dataset was stored in the RDBMS, and the service was provided by programming a method to link with the BIM object. This approach causes problems such as the need to modify the database schema and business logic, and the migration of existing data when requirements change. This problem adversely affects the scalability, reusability, and maintainability of model information. This study proposes an ontology BIM-based knowledge service framework considering the connectivity and scalability between BIM and heterogeneous dataset. Through the proposed framework, ontology BIM mapping, semantic information query method for linking between knowledge-expressing dataset and BIM are presented. In addition, to identify the effectiveness of the proposed method, the prototype is developed. Also, the effectiveness and considerations of the ontology BIM-based knowledge service framework are derived.