PENDEKATAN PEMECAHAN BERBASIS SET COVERING HEURISTIK UNTUK PEMECAHAN MASALAH PENENTUAN RUTE DAN PENUGASAN KAPAL
Ship routing and scheduling is one of topics in transportation routing and scheduling. The problem of ship routing and scheduling is complex problem, especially if there are many ports included. In the designing ship routes, each port must be covered at least by one routes. This problem is considere...
Saved in:
Main Author: | |
---|---|
Format: | Theses |
Language: | Indonesia |
Online Access: | https://digilib.itb.ac.id/gdl/view/12248 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Institut Teknologi Bandung |
Language: | Indonesia |
id |
id-itb.:12248 |
---|---|
spelling |
id-itb.:122482017-09-27T14:50:31ZPENDEKATAN PEMECAHAN BERBASIS SET COVERING HEURISTIK UNTUK PEMECAHAN MASALAH PENENTUAN RUTE DAN PENUGASAN KAPAL PERTIWI , INDRA Indonesia Theses INSTITUT TEKNOLOGI BANDUNG https://digilib.itb.ac.id/gdl/view/12248 Ship routing and scheduling is one of topics in transportation routing and scheduling. The problem of ship routing and scheduling is complex problem, especially if there are many ports included. In the designing ship routes, each port must be covered at least by one routes. This problem is considered as the well-known set covering problem. The set covering problem (including set packing problem) belongs to the NP-hard.<p>Many ship routing and scheduling use set covering/partitioning algorithms to produce solutions. The application of set covering/partitioning algorithms usually needs a route generator. This generator generates a set of routes feasible respect to constraints. Generating feasible routes can be done by enumeration either completely or partially. The generator of all feasible routes will guarantee that the solution produced by solving the set covering problem is optimal. The research is propose a solution method for designing ship routes. The case study is to design passenger ship routes of PT. Pelni, Indonesia. <p>One of real problems in the ship routing and scheduling is to design of liner routes. This problem arrives from the real situation faced by PT. Pelni , Indonesian state- owned ship company. One missions of the company is to reduce cost while maintaining customer satisfaction. One of way for making an efficient operation is to make a set of new efficient routes and to deploy vessels in the proper routes.<p>Ship routing and scheduling is solved by using set covering heuristic. The solution approach consists of two steps which is (1) Generating ship routes and deployment, (2) choosing the best ship routes and deployment. The objective function is to minimize total voyage cost. The solution produced by the proposed method gives a lower total voyage cost compared with the existing condition. text |
institution |
Institut Teknologi Bandung |
building |
Institut Teknologi Bandung Library |
continent |
Asia |
country |
Indonesia Indonesia |
content_provider |
Institut Teknologi Bandung |
collection |
Digital ITB |
language |
Indonesia |
description |
Ship routing and scheduling is one of topics in transportation routing and scheduling. The problem of ship routing and scheduling is complex problem, especially if there are many ports included. In the designing ship routes, each port must be covered at least by one routes. This problem is considered as the well-known set covering problem. The set covering problem (including set packing problem) belongs to the NP-hard.<p>Many ship routing and scheduling use set covering/partitioning algorithms to produce solutions. The application of set covering/partitioning algorithms usually needs a route generator. This generator generates a set of routes feasible respect to constraints. Generating feasible routes can be done by enumeration either completely or partially. The generator of all feasible routes will guarantee that the solution produced by solving the set covering problem is optimal. The research is propose a solution method for designing ship routes. The case study is to design passenger ship routes of PT. Pelni, Indonesia. <p>One of real problems in the ship routing and scheduling is to design of liner routes. This problem arrives from the real situation faced by PT. Pelni , Indonesian state- owned ship company. One missions of the company is to reduce cost while maintaining customer satisfaction. One of way for making an efficient operation is to make a set of new efficient routes and to deploy vessels in the proper routes.<p>Ship routing and scheduling is solved by using set covering heuristic. The solution approach consists of two steps which is (1) Generating ship routes and deployment, (2) choosing the best ship routes and deployment. The objective function is to minimize total voyage cost. The solution produced by the proposed method gives a lower total voyage cost compared with the existing condition. |
format |
Theses |
author |
PERTIWI , INDRA |
spellingShingle |
PERTIWI , INDRA PENDEKATAN PEMECAHAN BERBASIS SET COVERING HEURISTIK UNTUK PEMECAHAN MASALAH PENENTUAN RUTE DAN PENUGASAN KAPAL |
author_facet |
PERTIWI , INDRA |
author_sort |
PERTIWI , INDRA |
title |
PENDEKATAN PEMECAHAN BERBASIS SET COVERING HEURISTIK UNTUK PEMECAHAN MASALAH PENENTUAN RUTE DAN PENUGASAN KAPAL |
title_short |
PENDEKATAN PEMECAHAN BERBASIS SET COVERING HEURISTIK UNTUK PEMECAHAN MASALAH PENENTUAN RUTE DAN PENUGASAN KAPAL |
title_full |
PENDEKATAN PEMECAHAN BERBASIS SET COVERING HEURISTIK UNTUK PEMECAHAN MASALAH PENENTUAN RUTE DAN PENUGASAN KAPAL |
title_fullStr |
PENDEKATAN PEMECAHAN BERBASIS SET COVERING HEURISTIK UNTUK PEMECAHAN MASALAH PENENTUAN RUTE DAN PENUGASAN KAPAL |
title_full_unstemmed |
PENDEKATAN PEMECAHAN BERBASIS SET COVERING HEURISTIK UNTUK PEMECAHAN MASALAH PENENTUAN RUTE DAN PENUGASAN KAPAL |
title_sort |
pendekatan pemecahan berbasis set covering heuristik untuk pemecahan masalah penentuan rute dan penugasan kapal |
url |
https://digilib.itb.ac.id/gdl/view/12248 |
_version_ |
1820728462902558720 |