크루즈 관광 산업은 모든 관광 산업 중 세계적으로 가장 빠르게 성장하고 있는 관광산업임에도 불구하고, 지금까지 합리적 크루즈 경영의사결정에 관한 학술적 연구가 매우 미진한 상황이다. 이 논문은 크루즈 경영에 관한 기초적인 전략적 의사결정이라고 할 수 있는 크루즈 운항일정계획을 다루고 있다. 이전에 개발된 한척의 크루즈선박에 관한 모형의 제한점을 극복하여, 여러 척의 크루즈선박으로 구성된 크루즈 선대를 일반적으로 다룰 수 있는 최적화 의사결정계획 모형을 개발하였다. 후보운항일정계획들 간의 복잡성을 체계화하기 위해 선박별 후보운항일정계획 네트워크를 제안하였으며, 후보운항일정계획 네트워크 전체를 통합하는 정수계획모형을 개발하였다. 공개된 크루즈 운항일정 자료들에 바탕을 둔 가상 사례를 활용하여 개발된 모형을 실험하였다.

This paper presents a decision making model for the cruise ship management. A network based optimization model has been developed for a single cruise ship operation. It gives optimal itinerary patterns over the planning period for the cruise ship managers wanting to maximize profit from the cruise ship operation. A network solution method to find the optimal solution is also developed. This network model can be equivalently transformed into a linear programming model, which makes the implementation of the model quite practical however complicated the given set of possible itineraries may be. The ship scheduling network developed in this study can also be used as a general framework to describe all possible cruise ship itineraries the cruise ship manager can figure out.

This paper treats a genetic algorithm for ship scheduling problem in set packing formulation. We newly devised a partition based representation of solution and compose initial population using a domain knowledge of problem which results in saving calculation cost. We established replacement strategy which makes each individual not to degenerate during evolutionary process and applied adaptive mutate operator to improve feasibility of individual. If offspring is feasible then an improve operator is applied to increase objective value without loss of feasibility. A computational experiment was carried out with real data and showed a useful result for a large size real world problem.

Vessles in the world merchant fleet generally operate in either liner or bulk trade. The supply and the demand trend of general cargo ship are both on the ebb, however, those trend of tankers and containers are in slight ascension. Oil tankers are so far the largest single vessel type in the world fleet and the tanker market is often cited as a textbook example of perfect competition. Some shipping statistics in recent years show that there has been a radical fluctuation in spot charter rate under easy charterer's market. This implys that the proper scheduling of tankers under spot market fluctuation has the great potential of improving the owner's profit and economic performance of shipping. This paper aims at developing the TS-DSS(Decision Support System for Tanker Scheduling) in the context of the importance of scheduling decisions. The TS-DSS is defined as the DSS based on the optimization models for tanker scheduling. The system has been developed through the life cycle of systems analysis, design, and implementation to be user-friendly system. The performance of the system has been tested and examined by using the data edited under several tanker scheduling scenarios and thereby the effectiveness of TS-DSS is validated satifactorily. The authors conclude the paper with the comments on the need of appropriate support environment such as data-based DSS and network system for succesful implementation of the TS-DSS.

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.