• 한국경영과학회지
• /
• 제41권2호
• /
• pp.129-139
• /
• 2016

This paper presented a robust ship scheduling model using the quadratic programming problem. Given a set of available carriers under control and a set of cargoes to be transported from origin to destination, a robust ship scheduling that can minimize the mean-variance objective function with the required level of profit can be modeled. Computational experiments concerning relevant maritime transportation problems are performed on randomly generated configurations of tanker scheduling in bulk trade. In the first stage, the optimal transportation problem to achieve maximum revenue is solved through the traditional set-packing model that includes all feasible schedules for each carrier. In the second stage, the robust ship scheduling problem is formulated as mentioned in the quadratic programming. Single index model is used to efficiently calculate the variance-covariance matrix of objective function. Significant results are reported to validate that the proposed model can be utilized in the decision problem of ship scheduling after considering robustness and the required level of profit.

• 대한교통학회지
• /
• 제27권6호
• /
• pp.157-166
• /
• 2009

교통망설계문제(network design problem, NDP)는 교통체계(transportation system)을 최적화시키는 설계변수(design parameter, design variable)를 구하는 문제이다. 본 연구에서는 교통망설계문제를 조금 변환시킨 목표지향 교통망설계문제(target-oriented network design problem, target-oriented NDP)를 제시하고 이를 풀기 위한 기법도 제시한다. 목표지향 교통망설계는 교통운영자(traffic operator) 또는 관리자(travel manager)가 특정 교통정책 목표(target)를 미리 설정하고 이를 달성하기 위한 최적 설계변수를 찾는 문제이다. 즉, 일반적인 교통망설계문제(general NDP)는 총통행비용이나 순편익 등 특정목적함수를 최적화시키는 설계변수를 찾는데 반해, 목표지향 교통망설계(target NDP)는 사전에 설정된 목표수준(target level)을 달성하기 위한 설계변수를 구하는 문제이다. 본 연구에서 제시된 목표지향 교통망설계모형을 교통수단분담문제에 적용하여 모형을 평가한다.

• 한국항해항만학회지
• /
• 제39권4호
• /
• pp.353-360
• /
• 2015

해양 석유 생산은 '해양'이라는 특성에 기인하는 여러 가지 변수를 동반하면서 막대한 비용과 시간을 필요로 한다. 모든 관련된 프로세스는 인명, 환경 그리고 재산의 손실을 줄이기 위한 치밀한 일련의 계획에 의하여 통제된다. 이 논문은 해양 석유 생산 및 수송의 최적화 문제를 다룬다. 문제 영역의 범위를 정의하기 위해 해양 석유 생산 및 수송 네트워크를 제시하고 그 문제를 해결하기 위한 혼합정수계획모형을 구축하였다. 제안된 최적화 모형의 타당성을 확인하기 위해 가상의 해양 유전과 수요 시장을 바탕으로 MS Office Excel의 해찾기를 이용하여 계산실험들을 수행하였다. 해양 석유 생산 및 수송 네트워크 하위 흐름은 해양 유전에서 생산된 원유를 수요 시장으로 배분하는 해사수송문제가 된다. 이 해사수송문제를 해결하기 위해 집합 패킹 모형을 이용하여 구축된 MoDiSS(Model-based DSS in Ship Scheduling)를 사용하였다. 이러한 연구결과들은 실제적인 해양 석유 생산 및 수송 최적화 문제에 의미 있게 적용될 수 있으리라 사료된다.

• 산업경영시스템학회지
• /
• 제14권24호
• /
• pp.141-147
• /
• 1991

This paper presents extended model for the vehicle routing problem, which allows multiple visits to a node by multiple vehicles. Multiple visits enables us split delivery. After formulating this multiple visits model mathematically, a two stage heuristic algorithm is developed by decomposition approach. This model consists of two sub-problem. The one is fixed cost transportation problem and the other is transportation problem.

• 한국인터넷방송통신학회논문지
• /
• 제18권3호
• /
• pp.209-214
• /
• 2018

본 논문은 부패상품의 수송시간 제약조건 $L^*$이내로 총 수송비용을 최소화시키는 물류센터 위치를 결정하는 문제의 단순한 알고리즘을 제안하였다. 이 문제에 대해 Lee[4]는 후보 물류센터 위치를 선정하고, 각 물류센터의 총 수송비용을 구한 후, 상위 2개 물류센터에 대해 최적의 위치로 이동시키는 복잡한 방법을 제안하였다. 반면에 본 논문에서는 서브트리 개념을 도입하여 $L^*$ 이내가 되는 후보 물류센터의 위치를 간단히 결정하고, 근방 개념을 도입하여 요구량이 집중화된 지역 상위 2개 지역에 대해 총 수송비용이 최소화되는 지점을 단순히 최적의 위치로 결정하였다.

• 한국항해항만학회지
• /
• 제32권4호
• /
• pp.295-304
• /
• 2008

In order to achieve a sustainable competitive advantage in the expanding maritime transportation market, most shipping companies are making every effort to reduce transportation costs. Likewise, the car shipping companies, which carry more than 80% of total car import and export logistics volume, also do their utmost for transportation cost saving. Until now many researches have been made for efficient maritime transportation, but studies for car shipping companies have rarely been made. For this reason, this study has tried to develop a maritime transportation planning support system which can help to save logistics costs and increase a competitive power of car shipping companies. To this end, instead of manual effort to solve the routing problem of car carrier vessels, this study has used an integer programming model to make an optimal transportation planning at the minimum cost. Also in response to the frequent changes both in the car production schedule and ship's arrival schedule after the completion of transportation planning, this research has developed a decision support system of maritime transportation, so that users can easily modify their existing plans.

• 한국국방경영분석학회지
• /
• 제27권1호
• /
• pp.28-38
• /
• 2001

A transportation problem amy have multiple optimal solutions, if an optimal solution to the problem is degenerate. This study derives a condition, under which multiple degenerate optimal solutions exist, fro ma current degenerate optimal transportation tableau by utilizing the homogeneous equation obtained from the closed loops connecting degenerate basic variable and non-basic variables, and discusses a method of generating alternative degenerate optimal solutions and their associated transportation tableaus. Each degenerate optimal solution may not have the same range of feasibility in sensitivity analysis on supply and demand quantity due to different set of shadow prices which multiple degenerate solution have.

• Journal of applied mathematics & informatics
• /
• 제40권5_6호
• /
• pp.933-947
• /
• 2022

In this research, we presented the type 2 fuzzy transportation problem with additional constraints and solved by our proposed genetic algorithm model, and the results are verified using the softwares, genetic algorithm tool in Matlab and Lingo. The goal of our approach is to minimize the cost in solving a transportation problem with an additional constraint (TPAC) using the genetic algorithm (GA) based type 2 fuzzy parameter. We reduced the type 2 fuzzy set (T₂FS) into a type 1 fuzzy set (T₁FS) using a critical value-based reduction method (CVRM). Also, we use the centroid method (CM) to obtain the corresponding crisp value for this reduced fuzzy set. To achieve the best solution, GA is applied to TPAC in type 2 fuzzy parameters. A real-life situation is considered to illustrate the method.

• 한국경영과학회지
• /
• 제19권2호
• /
• pp.177-198
• /
• 1994

We consider an algorithm for the Crew Scheduling Problem (CSP) based on the Transportation Problem approach. The main flows of the algorithm are arranged in three steps. First we propose a heuristic algorithm of the greedy principle to obtain an initial feasible solution. Secondary we present a method of formulating CSP into a Modified Transportation Problem format. Lastly the procedures of network search to get the optimal solution are presented. This algorithm can be applied to the general GSP and also to most combinatorial problems like the Vehicle Routing Problems. The computational results show that the large size CSP's could be tackled.

• 한국경영과학회지
• /
• 제10권2호
• /
• pp.45-53
• /
• 1985

In the present paper, the capacitated solid transportation problem (planar constraints) is considered with upper and lower bounds on the rim conditions. The considered model has been shown to be equipvalent to a standard capacitated 3-index transportation problem. A procedure to solve any capacitated 3-index transportion problem is also suggested. Some special cases of the considered model have been shown to conform to possible practical situations.