SHIP ROUTING PROBLEM IN LINER SHIPPING WITH CONNECTIVITY BETWEEN ROUTES USING SIMULATED ANNEALING ALGORITHM
Connectivity in transportation network is one of government mission to realize nawacita program. In sea transportation mode, connectivity can be achieved by designing a ship route which has connection between routes so the entire routes are connected as a unity. This problem can be classified as veh...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/27374 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
| Summary: | Connectivity in transportation network is one of government mission to realize nawacita program. In sea transportation mode, connectivity can be achieved by designing a ship route which has connection between routes so the entire routes are connected as a unity. This problem can be classified as vehicle routing problem or ship routing problem (SRP). This research will focus on passanger ship route of PT Pelni as a research object. <br />
<br />
In this research, the developed SRP model considers several constraint such as vessel characteristics, maximum tour duration, vessel and port compatibility, travel time, initial and end port selections, fuel port selections, and connectivity between routes. SRP model was solved by using sequential insertion algorithm to obtain the initial solution and simulated annealing algorithm to obtain the final solution. The final solution of this research is able to produce a cost savings up to 33.40% of the total existing cost. In addition, the final solution also able to create the interconnected routes. |
|---|