Korean Management Science Review (경영과학)
- Volume 8 Issue 1
- /
- Pages.91-108
- /
- 1991
- /
- 1225-1100(pISSN)
An optimization of crude oil tanker scheduling problems
유조선의 최적 운항일정계획
Abstract
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.
Keywords