• Title/Summary/Keyword: Dynamic Relocation

Search Result 19, Processing Time 0.02 seconds

The Optimization of One-way Car-Sharing Service by Dynamic Relocation : Based on PSO Algorithm (실시간 재배치를 통한 카쉐어링 서비스 최적화에 관한 연구 : PSO 방법론 기반으로)

  • Lee, Kun-Young;Lee, Hyung-Seok;Hong, Wyo-Han;Ko, Sung-Seok
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.39 no.2
    • /
    • pp.28-36
    • /
    • 2016
  • Recently, owing to the development of ICT industry and wide spread of smart phone, the number of people who use car sharing service are increased rapidly. Currently two-way car sharing system with same rental and return locations are mainly operated since this system can be easily implemented and maintained. Currently the demand of one-way car sharing service has increase explosively. But this system have several obstacle in operation, especially, vehicle stock imbalance issues which invoke vehicle relocation. Hence in this study, we present an optimization approach to depot location and relocation policy in one-way car sharing systems. At first, we modelled as mixed-integer programming models whose objective is to maximize the profits of a car sharing organization considering all the revenues and costs involved and several constraints of relocation policy. And to solve this problem efficiently, we proposed a new method based on particle swarm optimization, which is one of powerful meta-heuristic method. The practical usefulness of the approach is illustrated with a case study involving satellite cities in Seoul Metrolitan Area including several candidate area where this kind systems have not been installed yet and already operating area. Our proposed approach produced plausible solutions with rapid computational time and a little deviation from optimal solution obtained by CPLEX Optimizer. Also we can find that particle swarm optimization method can be used as efficient method with various constraints. Hence based on this results, we can grasp a clear insight into the impact of depot location and relocation policy schemes on the profitability of such systems.

Dynamic Relocation of Virtual Machines for Load Balancing in Virtualization Environment (가상화 환경에서 부하균형을 위한 가상머신 동적 재배치)

  • Sa, Seong-Il;Ha, Chang-Su;Park, Chan-Ik
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.35 no.12
    • /
    • pp.568-575
    • /
    • 2008
  • Server consolidation by sever virtualization can make one physical machine(PM) to run several virtual machines simultaneously. Although It is attractive in cost, it has complex workload behaviors. For that reason, efficient resource management method is required. Dynamic relocation of virtual machine(VM)[3,4] by live migration[1,2] is one of resource management methods. We proposed SCOA(Server Consolidation Optimizing Algorithm) : a fine-grained load balancing mechanism worked on this dynamic relocation mechanism. We could obtain accurate resource distribution information through pointed physical machines on multi dimensional resource usage coordination, so we could maintain more balanced resource state. In this paper, we show the effectiveness of our algorithm by comparison of experimental results between SCOA and sandpiper[3] by software simulation.

Reduction of Vibration for an Elastic Structure by means of a Relocation of Part (구조 재배치를 이용한 탄성체 진동 저감)

  • Kim, Giman;Choi, Seongdae
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.19 no.7
    • /
    • pp.98-105
    • /
    • 2020
  • This study deals with the passive control of the dynamic characteristics of a theoretical model which is a string with fixed ends and loaded by two point masses - a main mass (Mo) and a secondary mass (Ms). It has been controlled passively by means of a relocation of a secondary mass. A main mass placed on the string is considered as a vibrating receiver which be forced to vibrate by a vibrating source being positioned on the string. By analyzing the motion of a string, the equation of motion for a string was derived by using a method of variation of parameters. To define the optimal conditions for the vibration reduction, the governing equation, which denotes the dynamic response of a string was derived in the closed form and then evaluated numerically. The possibility of reduction of an amplitude and a power being transmitted to a main mass were found to depend on the location and the magnitude of a secondary mass as well as the range of a forcing frequency.

An Empirical Study on the Effect of Organic Structure and Learning Culture on Dynamic Competence and Corporate Performance (기업조직의 유기성과 학습문화가 동적역량과 기업성과에 미치는 영향에 관한 실증연구)

  • Jung, Doo-Sig
    • Journal of Digital Convergence
    • /
    • v.17 no.2
    • /
    • pp.47-57
    • /
    • 2019
  • This study analyze whether the organizational learning culture affects the firm's dynamic capacity and whether the dynamic capacity mediates the relationship between organizational learning culture and management performance. Respectively. First, "The more organizational structure is organic, the higher the integrated relocation capacity and learning capacity. Organizations with organic organizational structures were found to have the ability to successfully adapt to external changes because there is a practice that is not tied to formal processing or procedures. Second, it can be seen that there is a positive (+) influence on the relocation capacity among the dynamic competence of the learning culture of the corporate organization. Third, both sub-factors of dynamic competence have positive (+) influence on business performance. Also, there was no mediating effect of dynamic competence related to learning culture.

A Dynamic Job Relocation Strategy Considering Application's Characteristics in Multiple Grid Sites (다중 그리드 사이트에서 어플리케이션 특성을 고려한 동적 작업 재배치 정책)

  • Ryu, Kyung-Hoo;Lee, Woo-Joo;Jeon, Chang-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.4
    • /
    • pp.31-37
    • /
    • 2008
  • In this paper, we propose a dynamic job relocation strategy that considering application's characteristics in multiple grid sites. This scheme classifies application to execute in multiple grid sites by their characteristics : computing intensive application, network intensive application. Also, it eliminates the communication between sites by allocating the network intensive application in single site, thus reducing the total job execution time. But if a number of free nodes to execute the network intensive application aren't found in single site, the proposed scheme the first allocates the network intensive application in multiple sites to minimize network latency. Then if the network intensive application being executed in multiple sites suitable free nodes are found in single site. the proposed scheme relocates the application being executed in multiple sites to another single site. This results in reducing the total job execution time. Through simulation, we show that the proposed dynamic job reallocation strategy improves the performance of Data Grid environment compared with previous strategies.

  • PDF

Dynamic Sink Relocation with Fuzzy Logic for WSN (WSN 환경에서 Fuzzy Logic을 활용한 동적 싱크 재배치 기법)

  • Lee, Tae-Ho;Kim, Min-Woo;Lee, Byung-Jun;Kim, Kyung-Tae;Youn, Hee-Yong
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2019.07a
    • /
    • pp.99-100
    • /
    • 2019
  • 무선 센서 네트워크(Wireless Sensor Network, WSN)에서의 싱크 이동은 전력 문제와 관련하여 해결해야할 중요한 문제이다. 또한 고정된 싱크를 사용하면 노드의 과도한 에너지 소비로 인해 네트워크 성능이 저하될 수 있는 문제점이 있다. 본 논문에서는 센서 노드의 클러스터가 퍼지 로직(Fuzzy Logic)을 기반으로 형성되고 싱크 재배치가 동적 2단계 메커니즘을 사용하여 결정되는 에너지 효율적인 싱크 재배치 기법을 제안한다. 본 논문에서 제안하는 기법은 싱크 재배치에 필요한 통신 오버 헤드를 최소화하고 데이터 패킷의 손실이나 지연을 최소화하여 싱크 재배치를 허용한다. 시뮬레이션 결과 제안 기법이 기존의 WSN의 대표적인 싱크 재배치 기법보다 네트워크 수명과 처리량 측면에서 우수하다는 것을 확인할 수 있었다.

  • PDF

Dynamic Task Assignment Using A Quasi-Dual Graph Model (의사 쌍대 그래프 모델을 이용한 동적 태스크 할당 방법)

  • 김덕수;박용진
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.20 no.6
    • /
    • pp.62-68
    • /
    • 1983
  • We suggest a Quasi- dual graph model in consideration of dynamic module assignment and relocation to assign task optimally to two processors that have different processing abilities. An optimal module partitioning and allocation to minimize total processing cost can be achieved by applying shortest-path algorithm with time complexity 0(n2) on this graph model.

  • PDF

The Dynamic load Balancing Algorithm Method for Heterogeneous Distributed Systems (이종 분산 시스템을 위한 동적 부하균등 알고리즘기법)

  • 장순주
    • Journal of Internet Computing and Services
    • /
    • v.3 no.6
    • /
    • pp.53-61
    • /
    • 2002
  • This paper propose an dynamic load balancing algorithm for heterogeneous distributed systems. The algorithm allows this tasks to be relocated. The key of the algorithm is to transfer a suitable amount of processing demand from senders to receivers. This amount is determined dynamically during sender-receiver negotiations. Factors considered when this amount is determined include processing speeds of different nodes, the current load state of both sender and receiver, and the processing demands of tasks eligible for relocation. This paper also propose a load state measurement scheme which is designed particularly for heterogeneous systems. This results of the study show that the proposed algorithm outperforms the existing algorithms and is stable over a range of system attributes.

  • PDF

Construction of New Administrative Capital and Urban Dynamics Analyses (신행정수도의 건설과 도시동태성 분석)

  • 이만형;최남희
    • Korean System Dynamics Review
    • /
    • v.4 no.1
    • /
    • pp.69-91
    • /
    • 2003
  • Using qualitative methods hinged on urban dynamics models, the paper addresses major issues concerned with new administrative capital construction. It tries to summarize the existing debates on new administrative capital construction and reinterpret diverse interacting factors in terms of reinforcing or balancing feedback structure. The paper suggests that understanding up on the dynamic mechanism imbedded in circular causal loop diagrams is the key to set up appropriate proposals and action plans for the new administrative capital, as they would reveal complicated linkages between the Capital Region and the rest, in addition to the urban dynamic of new administrative capital. In the same context, the paper can confirm similar features reflected in the relocation of capital functions at Canberra, Australia and Berlin, Germany. It has paid special attention to the fact that both Australian and German governments altogether stress the positive feedback loops as they have overcome unprecedented political confrontation among rival cities: Basically, they have encouraged gives-and-takes among major stake-holders. These research findings indicate that the future of new administrative capital construction depends on consensus buildings that can accommodate socio-economic and territorial changes between pros and cons. Although further researches and validations are needed, the system approach presented in this paper could assist Korean decision-makers in developing robust and responsive policy initiatives under uncertainties.

  • PDF