SHORTEST ROUTE SEARCH OF PLATFORM SUPPORTVESSEL IN OFFSHORE OIL COMPANY
Sea transportation in the offshore oil and gas industry is useful for fulfilling needs, such as transporting crude oil, equipment or workers. Search for shortest route from the point to be visited by ships is useful to minimize cost and time of sea transportation from ships. The problem of findin...
Saved in:
| Main Author: | |
|---|---|
| Format: | Final Project |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/69969 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | Sea transportation in the offshore oil and gas industry is useful for fulfilling needs,
such as transporting crude oil, equipment or workers. Search for shortest route
from the point to be visited by ships is useful to minimize cost and time of sea
transportation from ships. The problem of finding the shortest route can be categorized
as a Traveling Salesman Problem. The Traveling Salesman Problem is a
problem for a salesman to find the shortest route by departing from the starting city,
visiting another city exactly once, and returning to the starting city. There are seven
heuristic methods that can be used to solve the Traveling Salesman Problem, namely
the Nearest Neighborhood method,Farthest Insertion method, Cheapest Inseriton
method, Arbitrary Insertion method, and the 2-Opt method. These methods can be
used as a basis for finding routes with the shortest distance from platform support
vessels to visit demand points in the middle of the sea. These methods are not
guaranteed to provide optimal solutions. The emergence of various possibilities
that can be experienced by ships, resulting in the emergence of various types of
routes from ships. There are different approaches to solving each type of route
of the sip, namely through modification of the distance matrix. This final project
will discuss the approach taken to complete various types of ship routes. After the
simulation, there are different results from the application of each method used. It
is possible that one method gives better results in another case. The existence of a
mandatory path in a case can make the selected route longer. The more mandatory
paths in a route determination problem can make the chosen route even longer. The
approaches used can solve the problem of finding routes with different types of
routes. |
|---|