A Heuristic Approach for International Crude Oil Transportation Scheduling Problems
スポンサーリンク
概要
- 論文の詳細を見る
In this paper, we propose a heuristic algorithm to solve a practical ship scheduling problem for international crude oil transportation. The problem is considered as a vehicle routing problem with split deliveries. The objective of this paper is to find an optimal assignment of tankers, a sequence of visiting and loading volume simultaneously in order to minimize the total distance satisfying the capacity of tankers. A savings-based meta-heuristic algorithm with lot sizing parameters and volume assignment heuristic is developed. The proposed method is applied to solve a case study with real data. Computational results demonstrate the effectiveness of the heuristic algorithm compared with that of human operators.
著者
-
Nishi Tatsushi
Mathematical Science For Social Systems Graduate School Of Engineering Science Osaka University
-
YIN Sisi
Mathematical Science for Social Systems Graduate School of Engineering Science, Osaka University
-
IZUNO Tsukasa
Mathematical Science for Social Systems Graduate School of Engineering Science, Osaka University
関連論文
- 3C2 IMPROVEMENT OF CONVERGENCE OF COLUMN GENERATION FOR RAILWAY CREW SCHEDULING PROBLEM
- 1B3 SIMULTANEOUS DISPATCHING AND CONFLICT-FREE ROUTING FOR AUTOMATED GUIDED VEHICLES USING PETRI NET DECOMPOSITION APPROACH
- A Heuristic Approach for International Crude Oil Transportation Scheduling Problems
- Petri Net Decomposition Approach for Bi-Objective Routing for AGV Systems Minimizing Total Traveling Time and Equalizing Delivery Time
- 4A1 PETRI NET DECOMPOSITION APPROACH FOR AGV SYSTEMS TO MINIMIZE THE DEVIATION OF DELIVERY TIME AND TOTAL TRANSPORTATION TIME(Technical session 4A: Material handling system)
- 5A4 COLUMN GENERATION FOR THE TRAIN-SET SCHEDULING PROBLEM WITH REGULAR MAINTENANCE CONSTRAINTS(Technical session 5A: OS4: Railway scheduling)