OPTIMIZATION MODEL DEVELOPMENT FOR SHORT SEA SHIPPING (SSS) OPERATION TO IMPROVE MULTIMODAL TRANSPORTATION NETWORK PERFORMANCE

One of efforts to improve the dominant use of land modes in Indonesia freight transportation is to intensify the multimodal freight transportation system. The dominant use of land modes leads to high logistics costs, especially the transportation cost. Sislognas 2012 states that one of the progra...

Full description

Saved in:
Bibliographic Details
Main Author: Edward Simangunsong, Johannes
Format: Dissertations
Language:Indonesia
Online Access:https://digilib.itb.ac.id/gdl/view/47259
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Institut Teknologi Bandung
Language: Indonesia
Description
Summary:One of efforts to improve the dominant use of land modes in Indonesia freight transportation is to intensify the multimodal freight transportation system. The dominant use of land modes leads to high logistics costs, especially the transportation cost. Sislognas 2012 states that one of the programs planned to improve the smoothness flow of goods in supporting the efficiency and effectiveness of the national logistics system performance is to develop Short Sea Shipping (SSS) shipping route and operational In the context of modeling, the design of SSS route is complex. It involves many actors and choices of operational scenarios combinations. It can be applied so that the operation of SSS has chances to be optimized. While in the context of optimization, the selection of an SSS operation scenario is a difficult combinatorial optimization problem to solve. The purpose of this study is to develop a multimodal freight transportation network model for container movements by considering SSS model and to develop an optimization model for designing operational scenarios for SSS route.. There are two main decisions to be answered simultaneously in developing the SSS route optimization model. First, it is related to network assignment which describes the behavior of the freight traffic users in choosing the travel route and mode used. Second, it is related to the selection of an optimum combination of SSS operational scenarios. It shifts land mode to the SSS mode. It is quantified by the value savings in total transportation costs that describe decision makers. The optimization approach that will be used to answer the problems above is the bilevel programming approach. The first decision is a lower-level problem and the second is an upper-level problem. The optimization solution technique for lower-level problem is Incremental Assignment, while for upper-level problem, Discrete Binary Particle Swarm Optimization (DBPSO). The operating attributes SSS are a port, SSS tariff, frequency, and SSS ship size, then the model will be tested on actual network of freight movement between Java and Sumatra. The result through the operation of SSS route with some several policy scenarios is the improvement the performance of containers transportation network. It can be shown by the total savings of freight transportation costs and modal shifting from trucks to SSS. Also a great number of operational scenario combinations can be solved by the optimization solution technique used. The optimum solutions for the SSS operational scenario for freight transport from Java to Sumatra are SSS routes through 2 ports, namely Panjang Port and Tanjung Priok Port. The fare operated for the SSS route is Rp. 5,000/km with total frequency of 6 ships/week served by ships with capacity of 300 trucks. The SSS route provides total saving of transportation costs by 1% of the total transportation costs of freight. The percentage of containers that move using the SSS is 2.21% of the total movement of freight between Java-Sumatra. There are 15.808 combinations of SSS operational scenario combinations in Java-Sumatera. The optimum SSS operational scenarios can be obtained represented by 400 combinations or 2.5% of the total combinations by using DBPSO optimization solution technique. The time effectiveness needed to obtain the optimum solution is 3.1 hours, when compared to the full enumeration method needed 50 x faster