• 한국항해항만학회지
• /
• 제30권7호
• /
• pp.561-566
• /
• 2006

In this paper, we propose a new ship scheduling set packing model considering limited risk or variance. The set packing model is used in many applications, such as vehicle routing, crew scheduling, ship scheduling, cutting stock and so on. As long as the ship scheduling is concerned, there exits many unknown external factors such as machine breakdown, climate change and transportation cost fluctuation. However, existing ship scheduling models have not considered those factors apparently. We use a quadratic set packing model to limit the variance of expected cost of ship scheduling problems under stochastic spot rates. Set problems are NP-complete, and additional quadratic constraint makes the problems much harder. We implement Kelley's cutting plane method to replace the hard quadratic constraint by many linear constrains and use branch-and-bound algorithm to get the optimal integral solution. Some meaningful computational results and comments are provided.

• 한국항해학회지
• /
• 제18권2호
• /
• pp.57-67
• /
• 1994

This paper treats the optimization analysis of tactical ship scheduling problems in the world seaborne bulk trade. The authors use the term 'tactial' to describe the ship scheduling problem where the owners should employ skillful tactics as an expedient toward gaining the higher profits per period in short term. Relevent research and related problems on ship scheduling problems are reviewed briefly and a model for the tactical ship scheduling problem formulated as Set Problem is introduced by modifying the previous work of Fisher(1989). The reality and practicability of the model is validated by some ship-ping statistics. Proper solution approaches are outlined in the context of computational tractability in tackling the Mixed Integer Propramming. Some underlying consideration for the computational experiment is also mentioned. The authors conclude the paper with the remarks on the need of user-friendly Decision Support System for ship scheduling under varying decision environment.

• 한국국방경영분석학회지
• /
• 제31권2호
• /
• pp.60-74
• /
• 2005

The main purpose of this study is to develop an watch duty scheduling focused on Korea Navy Ship, PCC class, in port. The watch duty scheduling is a type of a scheduling problem which both considers the readiness of the ship and fair duty for each person. In this study, we analyzed the personal ability and military occupational speciality and developed a manpower scheduling by using heuristic. We find an efficient and effective watch duty schedule which improved results.

• 한국경영과학회지
• /
• 제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.

• 한국항해학회지
• /
• 제24권5호
• /
• pp.385-395
• /
• 2000

In the transportation literature, many useful decision making models for ship routing and ship scheduling have been studied. But the majority of these studies are on industrial carriers, bulk carriers, or tankers. It is quite recent that a few optimization models have been developed for liner fleet routing and scheduling problems. However there have been few academic studies on decision making models for the routing or scheduling problems of passenger ships in spite of their economic importance in the entire shipping industry. The purpose of this study is to develop analytic decision making models for ship routing and scheduling for the passenger ship fleet. This study gives two optimization models, one is a linear programming model and the other a goal programming model. These two models are solved easy by commercial linear programming softwares and suggest optimal ship routing plans and many other useful implications for passenger ship fleet managers.

• 경영과학
• /
• 제8권1호
• /
• pp.91-108
• /
• 1991

This paper presents an efficient optimization algorithm for the crude oil tanker scheduling problem. The algorithm consists of two stages. In stage one, all the potentially optimal schedules (called 'candidate schedules') are generated from feasible schedules for each ship. In the second stage, a multiple ship scheduling problem is formulated as 0-1 integer programming problem considering only the those candidate schedules. The efficiency of the suggested algorithm was improved by exploiting the special structure of the formulation. The algorithm was illustrated by a numerical example and tested on practical ship scheduling problems.

• 한국항해학회지
• /
• 제14권1호
• /
• pp.21-38
• /
• 1990

This paper discusses the various modes of operations of cargo ships which are liner operations, tramp shipping and industrial operations, and mathematical programming, simulation , and heuristic method that can be used to solve ships routing and scheduling problems for each of these operations. In particular, this paper put emphasis on a crude oil tanker scheduling problem. The problem is to achieve an optimal sequence of cargoes or an optimal schedule for each ship in a given fleet during a given period. Each cargo is characterized by its type, size, loading and discharging ports, loading and discharging dates, cost, and revenue. Our approach is to enumerate all feasible candidate schedate schedules for each ship, where a candidate schedule specifies a set of cargoes that can be feasibly carried by a ship within the planning horizon , together with loading and discharging dates for each cargo in the set. Provided that candidate schedules have been generated for each ship, the problem of choosing from these an optimal schedule for each ship is formulated as a set partitioning problem, a set packing problem, and a integer generalized network problem respectively. We write the PASCAL programs for schedule generator and apply our approach to the crude oil tanker scheduling problem similar to a realistic system.

• 한국항해학회지
• /
• 제22권4호
• /
• pp.15-19
• /
• 1998

This paper concerns a bulk or semibulk cargo ship scheduling problem with a single loading port. This type of ship scheduling problem is frequently needed in real world for carrying minerals or agricultural produce from a major single production zone to many destinations scattered over a large area of the world. The first optimization model for this problem was introduced by Ronen (1986) as a nonlinear mixed integer program. The model developed in this paper is an improvement of his model in the sense that nonlinearities and numerous unnecessary integer variables have been eliminated. By this improvement we could expect real world instances of moderate sizes to be solved optimal solutions by commercial integer programming software. Similarity between the ship scheduling model and the capacitated facility location model is also discussed.

• 산업공학
• /
• 제13권2호
• /
• pp.225-233
• /
• 2000

In this paper, we develope a genetic algorithm for the erection scheduling in shipbuilding. Erection, the final manufacturing stage of shipbuilding, involves the landing and joining of blocks at drydock. Since several ships are built simultaneously at the same drydock and they compete with the common constrained production resource such as labor, space, and crane, we should consider both ship-specifics and common resource constraints for the desirable erection scheduling. Ship erection should also satisfy the predetermined dock cycle given from higher level production planning. Thus, erection schedule of a ship can be represented as a PERT/CPM project network with its own deadline. Since production resources are shared, the erection scheduling become the so-called multi-project scheduling problem with limited resources, which can not be solved easily due to the large size of project network. We propose a function as a minimization of load index which represented the load deviation over time horizon considering the yard production strategy. For the optical parameter setting, we tried various experiments. We verified that the proposed approach was effective to deal with the erection scheduling problem in shipbuilding.

• 한국통신학회논문지
• /
• 제39C권7호
• /
• pp.538-545
• /
• 2014

본 논문은 다운링크 다중 선박 네트워크에서 동적으로 협력 전송(CoMP Transmission; Coordinated Multi-point Transmission)을 사용하는 유틸리티 함수를 도출하고 이를 기반으로 스케줄링 기법을 제안한다. 제안하는 스케줄링 기법은 수율과 공정성을 고려한 PF 형태의 유틸리티 함수를 최대화하기 위해서 매 프레임 협력적 전송 여부를 결정하고, 유틸리티 함수를 최대화하는 사용자를 선택한다. 특히 제안하는 유틸리티 함수 기반의 스케줄링 기법은 셀 경계 지역에 위치하는 사용자의 서비스 품질을 만족시키는 것을 목적으로 한다. 무선 환경에서 PF(Proportional Fair) 스케줄링을 사용할 때 제안한 유틸리티 함수를 기반으로 하는 스케줄링 기법의 성능을 평가한다. 모의실험을 통하여 제안하는 스케줄링 기법은 협력적 통신 네트워크와 비협력적 통신 네트워크를 동적으로 사용함으로써 전체 네트워크의 성능을 유지하면서 가장자리에 있는 선박의 성능을 향상시키는 것을 확인하였다.