• Journal of the Korea Society of Computer and Information
• /
• v.20 no.6
• /
• pp.51-58
• /
• 2015

This paper suggests assignment-swap algorithm with time complexity O(mn) to obtain the optimal solution for large-scale of transportation problem (TP) with incomplete cost lists. Generally, the TP with complete cost lists can be solved with TSM (Transportation Simplex Method). But, we can't be solved for large-scale of TP with TSM. Especially. It is hard to solve for large-scale TP with incomplete cost lists using TSM. Therefore, experts simply using commercial linear programming package. Firstly, the proposed algorithm applies assignment strategy of transportation quantity to ascending order of transportation cost. Then, we reassign from surplus of supply to shortage of demand. Secondly, we perform the 2-opt and 1-opt swap optimization to obtain the optimal solution. Upon application to $31{\times}15$ incomplete cost matrix problem, the proposed assignment-swap algorithm more improves the solution than LINGO of commercial linear programming.

• Journal of Korean Society of Transportation
• /
• v.17 no.5
• /
• pp.111-122
• /
• 1999

A service network design model for LTL freight transportation is formulated as a mixed integer Programming Problem with two heuristic solution a1gorithms. The Proposed model derives the transportation Path for each origination-destination pair, taking into account transportation cost over the links and handling costs over the nodes. The first algorithm searches for a local minimum solution from a given initial solution by improving the quality of solution repeatedly while the second a1gorithm searches for a better solution using Simulated Annealing Method. For both solution algorithms, the initial solution is derived by a modified reverse Diikstras shortest Path a1gorithm. An illustrative example, Presented in the last part of the Paper, shows that the proposed algorithms find solutions which reduce the cost by 12% and 15% respectively, compared to the initial solution.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2016.05a
• /
• pp.207-208
• /
• 2016

By according to increase the research for autonomous vehicle in automobile industries, the efficient of autonomous cargo truck instead of conventional driver cargo truck will be analyzed in logistics areas. The inland transportation has been serious problem such as traffic accident, traffic congestion in downtown, air pollution, noise and etc. even if it have a great effect to logistics industries. Especially there have to be improved its transportation schedule and sleepy driving in night which induced heavy accident in highway. In this study, the effectiveness of autonomous cargo truck will be analysed by considering the logistics cost including social effects.

• Journal of Korean Society of Transportation
• /
• v.17 no.5
• /
• pp.43-55
• /
• 1999

The value of time in freight transportation describes the importance of goods during transport and shows the direction of efficient logistic management having inventory cost in transporting The value of time differs from class to class in freight transportation. It is due to the differences of shipper's willingness to Pay for time saving. In this research the value of time in intercity freight transportation of manufacturers in Korea was estimated as follows: first, the Perception factors which were the important criteria of shippers for choosing truck were sampled. second, the shippers were classified into three homogeneous classes. third, the value of time of each class was estimated by using multinominal logit model. The results of this research showed that the value of time in freight transportation was different from every class, that the shipper had to Pay 1,680 won for saving one hour Per each shipment, and that the inventory cost in transporting occupied 9.54% in the mean freight Price.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.10a
• /
• pp.46-50
• /
• 1998

본 연구는 최근에 국내기업의 물류비용절감을 위한 노력의 일환으로 추진되고 있는 적정 물류장비의 선정을 위한 시뮬레이션 모델의 개발이다. 본 연구에서는 제조공장에서 소비자들에게 공급되는 2단계 물류시스템에서 물류재고와 운송수단을 고려하여 최소 물류비용의 운송대안선정을 위한 의사결정을 할 수 있도록 개발하였다. 이를 위하여 2가지의 시뮬레이션모델의 전산프로그램을 개발하고 응용사례를 통하여 출력을 예시하였다.

• Journal of Korea Society of Industrial Information Systems
• /
• v.11 no.3
• /
• pp.20-33
• /
• 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. 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, 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.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.11a
• /
• pp.1673-1676
• /
• 2012

국내 주요 항만으로 반입되는 모든 운송사의 수출입 컨테이너는 반드시 항만을 관리하는 터미널 운영사에 해당 컨테이너의 주요 정보를 사전에 통지해야 하며 이를 컨테이너 운송 예정 정보라 부른다. 이는 항만 터미널 운영사가 반입 거점의 컨테이너의 야드 운영과 양적하 작업 계획을 사전에 계획하기 위함이다. 현재 국내 항만 터미널 운영사로 전송되는 컨테이너 반입 예정 정보는 특정 VAN 사업자를 통하여 EDI 로 정보를 송수신한다. 따라서 국내외 운송사들이 수출입 컨테이너를 항만에 반입하기 위해서는 별도의 비용을 지불하고 VAN 사업자의 EDI 서비스를 이용해야 한다. 또한 VAN 사업자의 EDI 시스템에 장애가 발생 할 경우 컨테이너 운송 예정 정보를 전송할 다른 방법은 현재 없는 상황이다. 이에 본 논문에서는 웹 서비스 기반의 SOAP 메시지 전송을 통하여 컨테이너 운송 예정 정보를 송수신 하는 시스템을 시범적으로 구축하고 이를 소개한다. 이를 통해 운송사와 항만 터미널 운영사는 VAN 사의 EDI 시스템 이외에 컨테이너 운송 예정 정보를 송수신하는 예비 전송망을 구축 할 수 있으며 EDI 사용 비용을 줄일 수가 있다.

• Journal of Korea Spatial Information System Society
• /
• v.1 no.1 s.1
• /
• pp.79-88
• /
• 1999

In this paper, essential technological elements for applying GIS and GPS based AVL system to the logistics information area were reviewed. Then system alternatives were evaluated using Life-Cycle Cost Analysis. In the basic scenario, the roadside infrastructure alternative is turned out to be more efficient that the other. The sensitivity analysis shows that under the different conditions and unit costs, the wireless communication alternative can be more economical. Mixed approach based on characteristics of transportation facilities should be considered.

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

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.5
• /
• pp.173-181
• /
• 2013

This paper proposes a heuristic optimal solution of multicommodity transportation problem. The proposed algorithm has 3 steps. First the proposed algorithm transforms multicommodity transshipment problem to a general transportation problem, but if the problem is a multicommodity transportation problem, it is not transformed. And the multicommodity is disassembled to a single commodity. Second if it is a multicommodity transportation problem, the algorithm selects the minimum cost according to commodity, on the other hand if it is a multicommodity transshipment problem, the algorithm directly selects the minimum cost based on demand area. And the algorithm assigns carloadings to be satisfied the supply and demand quantity. The algorithm repeats these processes until a given demand quantity is satisfied. Last if it has a condition that is able to reduce the transportation expense, the proposed algorithm controls the assignment quantity of the initial value that got from the step 2. The proposed algorithm was applied to two multicommodity transportation problem and three multicommodity transshipment problem and it got more good result than an existing linear programming method.