• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.27 no.2
• /
• pp.102-113
• /
• 2004

This paper addresses the transportation planning that is based on genetic algorithm for determining transportation time and transportation amount of minimizing cost of distribution system. The vehicle routing of minimizing the transportation distance of vehicle is determined. A distribution system is consisted of a distribution center and many retailers. The model is assumed that the time horizon is discrete and finite, and the demand of retailers is dynamic and deterministic. Products are transported from distribution center to retailers according to transportation planning. Cost factors are the transportation cost and the inventory cost, which transportation cost is proportional to transportation distance of vehicle when products are transported from distribution center to retailers, and inventory cost is proportional to inventory amounts of retailers. Transportation time to retailers is represented as a genetic string. The encoding of the solutions into binary strings is presented, as well as the genetic operators used by the algorithm. A mathematical model is developed. Genetic algorithm procedure is suggested, and a illustrative example is shown to explain the procedure.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2003.05a
• /
• pp.495-500
• /
• 2003

The vibration of a flexible cantilever tube with nonlinear constraints when it is subjected to flow internally with fluids is examined by experiment and theoretical analysis. These kind of studies have often been performed that finds the existence of chaotic motion. In this paper, the important parameters of the system leading to such a chaotic motion such as Young's modulus and coefficient of viscoelasticity in tube material are discussed. The parameters are investigated by means of a system identification so that comparisons are made between numerical analysis using the parameters of a handbook and the experimental results. The chaotic region led by several period-doubling bifurcations beyond the Hopf bifurcation is also re-established with phase portraits and bifurcation diagram so that one can define optimal parameters for system design.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.40-42
• /
• 2003

최근에는 물류 및 수송 관리, 교통 정보 서비스 등과 같은 위치 기반 서비스의 요구가 증대되고 있다. 위치 기반 서비스에서 클라이언트들의 빈번한 보고 데이터를 처리하기 위해서는 서버에서 메인 메모리 DBMS를 유지하는 것이 필요하다. 그러나 기존 연구에서는 이러한 이동체 데이터베이스를 위한 메인 메모리 색인이 없으므로 이에 적합한 색인이 필요하다. 다차원 색인으로 영역 질의에 뛰어난 성능을 보이는 색인으로 R-tree가 있는데, 이는 디스크 환경을 고려하여 설계되었기 때문에 메인 메모리에서는 효율을 보장하지 못한다. 이 논문에서는 R-tree를 변형하여 이동체 데이터베이스를 위한 메인 메모리 색인을 제시한다. 이 논문에서 새로 제시한 성장 노드 구조와 동적 재구성 및 큰 영역을 가진 노드 분할 정책은 영역 질의의 성능을 향상시킨다. 실험은 제안한 색인이 이동체 데이터베이스를 위한 적합한 메인 메모리 구조임을 보여준다.

• Journal of the KSME
• /
• v.33 no.10
• /
• pp.902-911
• /
• 1993

반능동 현가 시스템의 장점은 능동 및 수동 현가 시스템의 장점을 모두 갖고 있다는 것이다. 즉, 반능동 시스템은 수동 현가장치에 비해 우수한 성능을 제공하면서 대형 액츄에이터나 큰 동력 원을 필요로 하지 않는다. 지금까지는 승차감 및 조향성능을 향상시키기 위한 능동 및 반능동 현가시스템에 관한 연구가 많이 이루어졌으나, 능동 또는 반능동 현가시스템을 이용하여 대형 차량의 주행 안정성을 향상시키고, 대형차량에 의해 주로 발생하는 도로의 파손을 줄이면서 차 량의 수송능력을 향상시키는 연구는 최근에 유럽과 미국의 대형트럭 제조업체와 정부 주도로 활발하게 진행되고 있다. 그러므로 반능동 현가시스템에 의한 대형 트럭의 성능 향상 가능성 및 연구 개발도 승용차용 능동 및 반능동 현가시스템과 함께 앞으로의 주 연구 과제이다. 이글에 서는 우선 가변 댐퍼 및 반능동 현가시스템의 기본 원리를 설명하고, 반능동 현가시스템의 Bilinear Model, 제어방법에 대하여 언급한 후, 컴퓨터 모의 실험결과를 통하여 반능동 현가시 스템에 의한 차량의 동적 성능 향상을 두 가지 측면, 즉, 승용차와 대형트럭의 측면에서 언급될 것이다.

• Journal of the Korea Society for Simulation
• /
• v.22 no.1
• /
• pp.63-75
• /
• 2013

The School Bus Routing Problem(SBRP) seeks to plan an efficient schedule of a fleet of school buses that must pick up student from various bus stops and deliver them by satisfying various constraints; maximum capacity of the bus, maximum riding time of students, arrival time between a school's time window. By extending the existing SBRP, we consider a case study of SBRP with allowance of mixed-loading and dynamic arrivals reflecting the school bus operation of university in Korea. Our solution procedure is based on constructing the initial solution using sweep algorithm and then improving solution within the framework of the evolutionary approach known as efficient meta-heuristics. By comparing the various scenarios through the constraints relaxation for reflecting the real operational strategies, we assess the merit of our proposed procedure.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2006.05a
• /
• pp.95-108
• /
• 2006

Because of rapid expansion of third party logistics, fierce competition in the transportation industry, and the diversification and globalization of transportation channels, an effective transportation planning by means of multimodal transport is badly needed. Accordingly, this study aims to suggest an optimal transport algorithm for the multimodal transport in the international logistics. Cargoes and stopovers can be changed numerously according to the change of transportation modes, thus being a NP-hard problem. As a solution for this problem, first of all, we have applied a pruning algorithm to simplify it, suggesting a heuristic algorithm for constrained shortest path problem to find out a feasible area with an effective time range and effective cost range, which has been applied to the Label Setting Algorithm, consequently leading to multiple Pareto optimal solutions. Also, in order to test the efficiency of the algorithm for constrained shortest path problem, this paper has applied it to the actual transportation path from Busan port of Korea to Rotterdam port of Netherlands.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.23 no.5
• /
• pp.502-515
• /
• 2020

To identify the dynamic characteristics of the Auto-leveling system applied to the Tractor-Trailer type Transporter for mounting a large scale precision equipment, Dynamics Modeling & Simulation were performed using general Dynamics Analysis Program - RecurDyn(V9R2). The axial load data, transverse load data and pad trace data of leveling actuators were obtained from M&S. And they were analyzed and compared with each other by parameters, i.e. friction coefficients on the ground, landing ram speed of actuators, and direction & quantity of ground slope. It was observed that ground contact friction coefficients affected to transverse load and pad trace; the landing ram speed of actuators to both amplitude of axial & transverse load, and this phenomena was able to explain from the frequency analysis of the axial load data; the direction of ground slope to driving sequence of landing ram of actuators. But the dynamic behaviors on the two-directional slope were very different from them on the one-directional slope and more complex.

• Journal of the Korea Society for Simulation
• /
• v.23 no.4
• /
• pp.97-109
• /
• 2014

Personal rapid transit (PRT) is a new transportation system, which is energy efficient and brings high quality of customer service. Customers arrive dynamically at stations and request transportation service. In this paper, we propose a new online PRT dispatching algorithm for pickup and delivery of customers. We adopt the nearest neighbor dispatching rule, which is known as performing well in general. We extend the rule with bipartite matching in order to deal with multiple vehicles and customers at the same time. We suggest a systematic way for selecting vehicles that will be considered to be dispatched, since the scope with which vehicles are selected may affect the system performance. We regard the empty travel distance of vehicles and the customer waiting time as the performance measures. By using simulation experiments, it has been examined that the scope of dispatching affects the system performance. The proposed algorithm has been validated by comparing with other dispatching rules for transportation services. We have shown that our algorithm is more suitable for PRT operating environment than other dispatching rules.

• IE interfaces
• /
• v.22 no.1
• /
• pp.63-72
• /
• 2009

This paper considers a transporter scheduling problem under dynamic block transportation environment in shipbuilding. In dynamic situations, there exist the addition, cancellation or change of block transportation requirements, sudden breakdowns and maintenance of transporters. The transportation of the blocks in the shipyard has some distinct characteristics. Some blocks are available to be picked up at a specific time during the planning horizon while some other blocks need to be delivered before a specific time. These requirements cause two penalty times: 1) delay times incurred when a block is picked up after a required start time, and 2) tardy times incurred when a block shipment is completed after the required delivery time. The blocks are located at different areas in the shipyard and transported by transporters. The objective of this paper is to propose a heuristic algorithm based on a network flow model which minimize the weighted sum of empty transporter travel times, delay times, and tardy times. Also, a rolling-horizon scheduling method is proposed for dynamic block transportation environment. The performance of the proposed heuristic algorithms are evaluated through a simulation experiment.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.1
• /
• pp.157-165
• /
• 1998

This paper considers the single-product production and transportation problem with discrete time, dynamic demand and finite time horizon, an extension of classical dynamic lot-sizing model. In the model, multiple freight container types are allowed as the transportation mode and each order (product) placed in a period is shipped immediately by containers in the period. Moreover, each container has type-dependent carrying capacity restriction and at most one container type is allowed in each shipping period. The unit freight cost for each container type depends on the size of its carrying capacity. The total freight cost is proportional to the number of each container type employed. Such a freight cost is considered as another set-up cost. Also, it is assumed in the model that production and inventory cost functions are dynamically concave and backlogging is not allowed. The objective of this study is to determine the optimal production policy and the optimal transportation policy simultaneously that minimizes the total system cost (including production cost, inventory holding cost, and freight cost) to satisfy dynamic demands over a finite time horizon. In the analysis, the optimal solution properties are characterized, based on which a dynamic programming algorithm is derived. The solution algorithm is then illustrated with a numerical example.