• 한국항해항만학회지
• /
• 제33권4호
• /
• pp.271-275
• /
• 2009

A strategic decision making on location selection for product transportation includes many tangible and untangible factors. To choose the best locations is a difficult job in the sense that objectives usually conflict with each other. In this paper, we consider a multi stage multi criteria transshipment problem with different types of items to be transported from the sources to the destination points. For the optimization of the problem, a goal programming formulation will be presented in which the location selection for each product type will be determined under the multi objective criteria. In the study, we generalize the transshipment model with a variety of product types and finite number of different intermediate nodes between origins and destinations. For the selection of the criteria we selected the costs(fixed cost and transportation cost), location numbers, and unsatisfied demand for each type of products in multi stage transportation, which are the main goals in transshipment modelling problems. The related conditions are also modelled through linear formats.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 2006년도 춘계공동학술대회 논문집
• /
• pp.179-186
• /
• 2006

There was a lot of research to integration of the transshipment and inventory problem in supply chain. Such a integration of inventory and transshipment problem called IRP (Inventory Routing Problem). We consider a distribution problem in which a set of products has to be shipped from a supplier to several retailers in a given planning horizon. Transshipment from the supplier to the retailer is performed by vehicles of limited capacity. Each retailer determines replenishment leadtime and order quantity with buffer management. A supplier determines optimal vehicle routing in supply chain. We suggest a heuristic algorithm which be used TOC buffer management in a replenishment problem and a tabu search algorithm in VRP (Vehicle Routing Problem).

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2007년도 추계학술대회 및 정기총회
• /
• pp.90-96
• /
• 2007

In multi-location inventory systems, lost sales due to stockout decreases not only retailers' profit but also whole supply chain's profit. Transshipment between retailers has been considered to be a major solution to the stockout problem, and many supply chains implement transshipment coalition among retailers. However, in practical situations, retailers occasionally refuses to accept the transshipment requests, mainly because they concern the future stockout possibilities of their own. Thus, the objective of this research is to analyze the effect of retailers' interaction under the transshipment coalition environment based on the simulations, and to provide effective policies to promote retailers' transshipment cooperation. Policies using penalty and incentive scheme are proposed, and it is shown that using proposed policies both the retailers' and the headquarter's profit can be increased.

• 산업경영시스템학회지
• /
• 제30권4호
• /
• pp.62-70
• /
• 2007

Recently, the increasing trend for the transshipment traffic of Busan port in Korea is slowing down because of the extensive development plan of domestic ports in china. For solving this problem, Korea is going on the project for preoccupying the transshipment port for attraction of port traffic from the newly potential markets(NPM) based on the Northeast Asia area. As a part of the project, this paper proposes the efficient methodology for selecting the optimal shipping network and strategic transshipment port within NPM using the mathematical models and simulation analysis. For that, we firstly find the alternative transshipment ports within NPM through the status analysis of the current port traffic and shipping network and then, we choose the candidate transshipment-ports in order of minimizing the transport costs through the mathematical approach. With the scenarios based on the selected transshipment-ports, we perform the simulation analysis for choosing the optimal transshipment-ports and the shipping network minimizing the total costs and times concurrently. We expect that the results of this paper will be used efficiently when korea select the strategic transshipment-port in the future.

• 한국인터넷방송통신학회논문지
• /
• 제13권1호
• /
• pp.153-162
• /
• 2013

본 논문은 중개수송 문제의 최적 해를 찾는 가장 단순한 방법을 제안하였다. 중개 수송문제는 직접 선형계획법이나 TSM을 적용하거나 일반적인 수송문제로 변환시켜 TSM을 적용하여 최적해를 구한다. 그러나 TSM을 적용하여 최적해를 구하기 위해서는 초기해를 구하고 해 개선 과정을 거치는 방법이 어렵다. 초기해를 구하기 위해서는 NCM, LCM이나 VAM을 적용하며, 해 개선을 위해서는 MODI나 SSM을 적용한다. 본 논문은 중개수송 문제를 수송문제로 변환시키는 방법을 적용하였다. 수송문제에 대해서는 단순히 열의 최소 비용을 선택하고, 선택된 비용들에 대해 행의 비용 오름차순으로 수송량을 배정하는 방법을 적용하여 초기해를 빠르게 배정할 수 있었다. 해 개선은 보다 큰 비용에 수송량이 배정된 경우 보다 작은 비용으로 변경할 수 있는 조건을 만족하면 배정량을 조정하는 방법을 적용하였다. 제안된 방법을 11개의 다양한 중개수송 문제에 적용한 결과 10개 문제는 초기 배정만으로 최적해를 구할 수 있었으며, 단지 2개 문제만이 해 개선과정을 1개의 비용만 변경하여 최적해를 구할 수 있었다. 따라서 제안된 방법은 중개수송 문제에 대해 가장 간단한 최적해 방법으로 적용할 수 있을 것이다.

• 수산경영론집
• /
• 제18권2호
• /
• pp.53-67
• /
• 1987

In the fish industry, the perishabiliy of raw material, saeasonality of catch and diatance between production and consumption combine to cause physical distribution to be a difficult decision problem. In fishery physical distribution, the choice of appropriate landing port is a major problem. This paper deals with transshipment model to determine landing port as intermediate transfer point and the market to which fish should be sent. Transshipment model is useful to determine intermediate transfer point and can be reformulated as LP model. So this study developes transshipment model for korea large trawler ana analized the model output. It can be expended to a realistic problem in order to provide information to port planner and decision maker on the trade-offs between the cost and efficiency of fishery transportation.

• 한국인터넷방송통신학회논문지
• /
• 제13권5호
• /
• pp.173-181
• /
• 2013

본 논문은 복합상품 운송 문제의 최적해를 구하는 단순한 발견적 방법을 제안한다. 제안 알고리즘은 첫 번째로, 복합상품 중개운송 문제인 경우 일반적인 운송 문제로 변환시킨다. 이 과정에서 중개지를 공급지로, 중개지의 수용량 제약조건을 공급량으로 치환한다. 다음으로 단일 상품으로 분해한다. 두 번째로, 복합상품 운송문제인 경우 상품별로, 복합상품 중개운송 문제인 경우는 직접 열 (수요지) 기준으로 최소 비용을 선택한다. 행 (공급지) 기준으로 선택된 비용 오름차순으로 공급량, 수용량과 요구량 제약조건을 만족하도록 수송량을 배정한다. 주어진 요구량을 모두 만족할 때까지 이 과정을 반복한다. 이렇게 얻은 초기해에 대해 세 번째로, 수송비용을 감소시킬 수 있는 조건을 만족하면 배정량을 조정한다. 이와 같이 단순한 알고리즘을 2개의 복합상품 운송 문제와 3개의 복합상품 중개운송 문제에 적용한 결과, 선형계획법으로 최적해를 제시한 3개 문제 중 2개 문제에서 최적해를 개선하는 효과를 얻었다. 결국, 제안된 알고리즘은 선형계획법을 적용하는 방법보다 좋은 알고리즘으로 판명되었다.

• 한국국방경영분석학회지
• /
• 제18권2호
• /
• pp.167-180
• /
• 1992

This paper considers a two-location production and inventory model for a single product which can be produced and demanded at each of two locations. Demands during a finite number of discrete time periods are known and must be satisfied by production, inventory or transshipment. We consider the change of production capacity. The costs to be incurred are restricted to production, inventory and transshipment costs, and all cost functions we assumed to be concave. The objective is to minimize the total cost of production, inventory and transshipment. The model is formulated as a shortest path problem for an acyclic network from which properties associated with optimal solutions are derived. Using these properties. we develop a dynamic programming algorithm that finds optimal solutions for problems.

• 한국항해항만학회지
• /
• 제44권3호
• /
• pp.235-243
• /
• 2020

부산항은 컨테이너 물동량 기준으로 세계 6위의 항만이며, 환적화물 기준으로 세계 2위의 항만으로 큰 기능을 하고 있다. 그러나 항만시설 및 운송업체에 대한 정책적 배려 부족으로 부산 신항내 환적화물의 운송과 배후물류단지 화물운송에 있어 과적단속이 심각한 문제로 대두되고 있다. 이에 관련 운전자, 운송업체, 항만 배후물류단지 담당자를 대상으로 그 실태를 살펴보고, 그 문제점을 파악한 후 개선방안을 제언하였다.

• 산업경영시스템학회지
• /
• 제41권4호
• /
• pp.238-247
• /
• 2018

This paper considers the problem of scheduling loading and unloading operations of a crane in a railway terminal motivated from rail-road container transshipment operations at Uiwang Inland Container Depot (ICD). Unlike previous studies only considering the total handling time of containers, this paper considers a bi-criteria objective of minimizing the weighted sum of the total handling time and tenant service time. The tenant service time is an important criterion in terms of terminal tenants who are private logistics companies in charge of moving containers from/to the terminal using their trucks. In the rail-road container shipment yard, the tenant service time of a tenant can be defined by a time difference between beginning and finishing loading and unloading operations of a crane. Thus, finding a set of sequences and time of the crane operations becomes a crucial decision issue in the problem. The problem is formulated as a nonlinear program which is improved by linearizing a nonlinear constraint in the model. This paper develops a genetic algorithm to solve the problem and performs a case study on the Uiwang ICD terminal. Computational experiment results show that the genetic algorithm shows better performance than commercial optimization solvers. Operational implications in terms of tenants are drawn through sensitivity analyses.