• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2019.05a
• /
• pp.133-134
• /
• 2019

우리나라는 협소한 국토구조 특성상 도로운송 위주의 화물운송체계가 정착되어 있어 내륙수송비 부담 증가, 교통 혼잡, 대기오염 및 소음, 도로파손, 대형교통사고 등 크고 작은 문제가 지속적으로 ${\cdot}{\cdot}{\cdot}{\cdot}$(중략)${\cdot}{\cdot}{\cdot}{\cdot}$ 따라서 본 연구에서는 물류비용 및 서비스를 좌우하는 수송비용과 물류인프라 초기투자비용을 최소화하면서 교통 혼잡, 온실가스배출 등 사회 환경 비용을 절감하기 위한 단절없는 인터모달 자동화물운송 시스템 개념을 정립하고 구성요소 및 요소기술을 ${\cdot}{\cdot}{\cdot}{\cdot}$(중략)${\cdot}{\cdot}{\cdot}{\cdot}$

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.2
• /
• pp.93-102
• /
• 2013

This paper proposes an algorithm designed to obtain the optimal solution for transportation problem. The transportation problem could be classified into balanced transportation where supply meets demand, and unbalanced transportation where supply and demand do not converge. The archetypal TSM (Transportation Simplex Method) for this optimal solution firstly converts the unbalanced problem into the balanced problem by adding dummy columns or rows. Then it obtains an initial solution through employment of various methods, including NCM, LCM, VAM, etc. Lastly, it verifies whether or not the initial solution is optimal by employing MODI. The abovementioned algorithm therefore carries out a handful of complicated steps to acquire the optimal solution. The proposed algorithm, on the other hand, skips the conversion stage for unbalanced transportation problem. It does not verify initial solution, either. The suggested algorithm firstly allocates resources so that supply meets demand, in the descending order of its loss cost. Secondly, it optimizes any surplus quantity (the amount by which the initially allocated quantity exceeds demand) in such a way that the loss cost could be minimized Once the above reallocation is terminated, an additional arrangement is carried out by transferring the allocated quantity in columns with the maximum cost to the rows with the minimum transportation cost. Upon application to 2 unbalanced transportation data and 13 balanced transportation data, the proposed algorithm has successfully obtained the optimal solution. Additionally, it generated the optimal solution for 4 data, whose solution the existing methods have failed to obtain. Consequently, the suggested algorithm could be universally applied to the transportation problem.

• Journal of the Korean Society for Railway
• /
• v.12 no.2
• /
• pp.205-211
• /
• 2009

There is need to reform the road-based logistic transportation system into the railway-based logistics transportation system in order to decrease the total social cost related with logistics transportation. And new transportation modes such as dual mode trailer (DMT) are under consideration, which are expected to decrease current market share of road. But, most of current studies about estimating economical efficiency are focused on developing the probabilistic choice model and then estimating the market share of each mode. We present an approach to compute the optimal market share of each mode in terms of total social cost. To do so, we suggest an optimization model capturing both user choice to maximize his utility and subsidy policy intended to minimize total social cost, simultaneously. Using this model, we present the optimal modal split of container freight.

• Journal of Korean Society of Transportation
• /
• v.22 no.7 s.78
• /
• pp.41-48
• /
• 2004

We may consider the inducement of demand to public transportation as a solution to relieve traffic congestion and pollution. Subway has merits as moving on schedule, transporting more people than bus. But subway is required a vast investment in the early stage of construction has a huge debt. So it runs into red figures, and on this account, services of subway are falling more and more. Development of subway's operation cost function is useful to understand structure of subway's operation and catch the relations of operation cost and actual results. In addition, we can present the policy that is a helpful to the operation as development of operation cost function. But there are short of studies about operation cost deal with a subway comparison with local train. Because local train has many lines and data, on the other hand, subway has one to four lines and less data. Most of previous studies sought the operation cost function of Seoul. So this study aimed to develop and apply the operation cost function of Seoul, Incheon, Busan and Daegu area using full allocation method. In this study, we considered the number of passengers, track-km, train-km, revenue as actual results. By appling the operation cost function, we compared the average cost of each city and confirmed the existence of economies of scale about the number of passengers, train-km.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.15 no.4
• /
• pp.223-230
• /
• 2015

As the Transportation Simplex Method of the general transportation problem are inapplicable to the large-scale unbalanced transportation problem, a commercialized linear programming package remains as the only viable means. There is, however, no method made available to verify the optimality of solutions attained by the package. This paper therefore proposes a simple heuristic algorithm to the large-scale unbalanced transportation problem. From a given problem of $31{\times}15$supply and demand areas, the proposed algorithm determines the number of demands areas for each supply area and executes on the latter in the ascending order of each of their corresponding demand areas. Next, given a single corresponding demand area, it supplies the full demand volume and else, it supplies first to an area of minimum associated costs and subsequently to the rest so as to meet the demand to the fullest extent. This initial optimal value is then optimized through an adjustment process whereby costs are minimized as much as possible. When tested on the $31{\times}15$cost matrix, the proposed algorithm has obtained an optimal result improved from the commercial linear programming package by 8.9%.

• Journal of the Korean Society for Railway
• /
• v.17 no.5
• /
• pp.373-380
• /
• 2014

With a view to the commercialization of the Korean automatic variable-gauge bogie in the Eurasia railway system, the aim of this research was to perform an economic analysis concerning the possible introduction and operation of this bogie at the present time. For this purpose, we compared the possible types of freight connection service for container transportation, transshipment and the gauge-adjustable system, estimating the total life-cycle cost (LCC) incurred by each system, depending on type and quantity, over the whole process of acquisition, operation, maintenance and disposal. Based on this, we presented a case-by case analysis. Furthermore, in estimating economic feasibility, we analyzed the cost-benefit ratio taking into account not only the objective LCC, but also the reduced time required for the gauge-change and customer convenience. After estimating the LCC and analyzing the cost-benefit ratio of the respective systems, we demonstrated the economic superiority of view of the gauge adjustable system.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2004.05a
• /
• pp.450-453
• /
• 2004

본 연구는 리드타임이 상이한 다단계의 공급 사슬에서 수송비용과 재고비용을 최소화하는 다기간의 차량일정계획 수립에 관한 연구이다. 일반적인 공급사슬모형과 차량일정계획 문제를 통합한 모형으로서, 각 단계의 가용차량과 차량 용량이 제한된 제약조건하에서 비용을 최소화하는 차량일정을 구하는 문제이다. 본 연구에서는 이에 대한 최적화 수리모형과 2단계의 분할해법을 제시하였으며, 다양한 공급사슬모형에 대한 발견적 기법의 성능을 분석하였다.

• Proceedings of the Korean Society for Agricultural Machinery Conference
• /
• 2002.07a
• /
• pp.33-39
• /
• 2002

농산물 취급자는 전체 수송기간 동안 청과류의 품질을 어떻게 유지할 것인가 하는 기술적인 면에 더 많은 관심을 기울이고 있다. 대부분의 농산물은 선적하기 전의 품질만으로도 목적지에 도착했을 때의 품질을 예측할 수 있다. 신선도가 높은 농산물은 신선도가 떨어지는 농산물에 비해 병원균의 침투에 강하고, 기계적인 손상과 물리적 피해에 대한 저항력이 크다. 동일한 조건으로 수송될 때 양질의 농산물은 품질이 낮은 농산물에 비해 손실이 적고, 수송비용을 많이 들이는 것이 양질의 농산물을 수송하는 한가지 방법이다(McGregor, 1989). (중략)

• Journal of Korea Port Economic Association
• /
• v.26 no.3
• /
• pp.42-55
• /
• 2010

This paper primarily deals with a decision-making for determining the number of voyages in each ship size under a specific port structure in order to minimize the total transport cost consisting of transport cost at sea, queuing cost in port, and inventory cost in yard. As a result of computer simulation using queuing model characterized by inter-arrival time distribution, we were able to find out some combination of voyage numbers of 3 ship-size(50,000-ton, 100,000-ton, and 200,000-ton), where the total transport cost can be minimized under a specific port structure. The simulation model also allows us to figure out any trade-off relationship among sea transport cost, queuing cost in port, and inventory cost in yard. Put it differently, an attempt to reduce the sea transport cost by increasing the number of voyages of the largest ship size, the transport cost incurred in both port and yard is hypothesized to be increased and vice versa. Consequently, Port managers are required to adjust the number of annual number of voyages allocated in each ship size, put into the sea lines for importing raw materials, in order to optimize the transport costs incurred under the specific port system. We may consider a net present value(NPV) model for performing an economic feasibility analysis on port investment project. If a total discounted net benefit, including cost savings, exceeds the initial investment for an additional berth construction, then we accept the port investment project. Otherwise, we reject the proposed port investment plan.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.53 no.11
• /
• pp.166-174
• /
• 2016

In this paper, we developed a mixed-integer linear programming model for transportation planning of athletes in sports events. The transportation planning of athletes involves finding the lowest-cost and fastest-time plan for distributing athletes from multiple accommodation to stadium. The decision variables associate with the number of driving events, and the total transportation cost is the objective function that needs to be minimized. The proposed method uses mixed integer linear programming to solve transportation problem, thus the global optimality is guaranteed. In order to verify the effectiveness of proposed method, we performed simulation and built the sports event management service platform (SEMSP) for transportation planning.