Upaya Peningkatan Kinerja Operasional Kapal KM. Kerinci dan KM. Tidar
Main Article Content
Abstract
Penelitian ini bertujuan mengembangkan varian model VRP untuk menyusun rute angkutan laut penumpang dengan keuntungan operasional optimal dan setiap jalur jaringan pelayanan dilewati tepat satu kali untuk memberi frekuensi layanan yang sama. Pengembangan ini dapat diselesaikan jika jaringannya berupa Graph Euler dan alokasi durasi satu round trip yang memadai. Hasil modifikasi restrukturisasi rute KM. Kerinci adalah Tanjung Priok – Balikpapan – Tarakan – Nunukan – Pantoloan – Pare-pare – Makassar – Bau-bau – Makassar – Pare-pare – Pantoloan – Nunukan – Tarakan – Balikpapan – Tanjung Perak – Tanjung Priok, sedangkan rute KM. Tidar adalah Tanjung Priok – Tanjung Perak – Makassar –Tanjung Perak – Pare-pare – Tanjung Perak – Pantoloan – Tanjung Perak – Bau-bau – Tanjung Priok. Jika KM. Tidar dioperasikan pada rute hasil modifikasi, biayanya meningkat 32,71% dari biaya aktual KM. Kerinci, sedangkan KM. Kerinci yang dioperasikan pada rute KM. Tidar meningkat 5,22% dari biaya aktual KM. Tidar. Utilitas jaringan KM. Kerinci meningkat 49,97% dari rute aktualnya, sedangkan utilisasi jaringan KM. Tidar turun 4,54% dari rute aktualnya. LF KM. Tidar meningkat 345,41% dari LF KM. Kerinci aktual, sedangkan LF KM. Kerinci turun 82,05% dari LF KM. Tidar aktual. Model ini belum mempertimbangkan pola rute penumpang dinamis, jumlah pangkalan tidak tunggal, dengan kecepatan dan waktu tempuh kapal, penumpang, dan jumlah pelabuhan dalam jaringan yang bersifat stokastik, sehingga membuka peluang penelitian lanjut.
Downloads
Article Details
Section
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
Jurnal Penelitian Transportasi Laut by Puslitbang Transportasi Laut, SDP is licensed under a CC BY-NC-SA
Based on a work at https://ojs.balitbanghub.dephub.go.id/index.php/jurnallaut/
References
Chang, Mei-Shiang, Hsueh, Che-Fu, & Chen, Shyang-Ruey. 2003. Real-Time Vehicle Routing Problem with Time Windows And Simultaneous Delivery/Pickup Demands. Journal of the Eastern Asia Society for Transportation Studies. Vol.5, October.
Chen, M., & Alfa, AS. 1991. A Network Design Algorithm Using A Stochastic Incremental Traffic Assignment Approach, Transportation Science, Vol. 25, No. 3, pp. 215–224.
Choi, Eunjeong, & Tcha, Dong-Wan. 2005. A column generation approach to the heterogeneous fleet vehicle routing problem, Elsevier Ltd. All rights reserved, Available online at www.sciencedirect.com.
Crainic, TG., Florian, M., & Leal, JE., (1990), A Model for The Strategic Planning of National Freight Transportation in Brazil: Methodology and Application, Part 1, 13–39.
Dell’Amico, Mauro, Monaci, Michele, Pagani, Corrado, & Vego, Daniele. 2006. Heuristic Approaches for The Fleet Size and Mix Vehicle Routing Problem with Time Windows, Transportation Science, Vol. 41, No. 4, November 2007, pp. 516–526, INROFMS, //transci.journal.informs.org/content/41/4/516.full.pdf, diunduh tanggal 6 Juli 2010 pukul 06:35 PM.
Drezner, Z., & Salhi, S. 2000. Selecting A Good Configuration of One-Way and Two-Way Routes Using Tabu Search, Control and Cybernetics, Vol. 29, No. 3, pp.725–740.
Drezner, Z., & Salhi, S. 2002. Using Hybrid Metaheuristics for The One-Way and Two-Way Network Design Problem, Naval Research Logistics (NRL), vol. 49, No. 5, pp. 449–463.
Drezner, Z., & Wesolowsky, GO. 1997. Selecting An Optimum Configuration of One-Way and Two-Way Routes, Ttransportation Science, Vol, 31, No. 4, pp. 386–394.
Drezner, Z., & Wesolowsky, GO. 2003. Network Design: Selection and design of Links and Fasility Location,Transportation research Part A, Vol. 37, No. 3, pp. 241–256.
Feng, CM., Hsieh, CH., & Peng, SC. 2009. Optimization of Urban Bus Routes Based on Principles of Sustainable Transportation.
Frazila, RB. 2005. Optimising The Design of Freight Transport Network, Desertation, Hirosima University.
Gao, Z., Wu, J., & Sun, H. 2005. Solution Algorithm for Bi–Level Discrete Network Design Problem, Transportation Research Part B, Vol. 39, No. 6, pp. 479–495.
Jayakrishnan, R., (n.d), Mass Transport Vehicle Routing Problem (MTVRP) and The Associated Network Design Problem (MTNDP), Department of Civil Engineering and Institute of Transportation Studies, University of California, Irvine, CA. 92967, USA, //www.uctc.net/papers/748.pdf, diunduh tanggal 04 Maret 2014, pukul 07:37PM.
Kim, BJ., & Kim, W., (2006), An Equilibrium Network Design Model with A Social Cost for Multimodal Networks, School of Air Transport, Transportation, and Logistics, Hankuk Aviation University, South Korea.
Leblanc, LJ. 1975. An Algoritma for The Discrite Network Design Problem, Transportastion Science, Vol 9, No. 3, pp. 183–199;
Lee, C., & Yang, K. 1994. Network Design of One-Way Streets with Simulated Annealing, Paper in Regional Science, Vol. 73, No. 2, pp. 119–13.
Long, J., Gao, Z., Zhang, H., & Szeto, WY. 2010. A Turning Restriction Design Problem in Urban Road Networks, European Journal of Operational Research, Vol. 206, No. 3, pp. 469 – 57.
Miandoabchi, E., & Farahani, RZ. 2010. Optimizing Reserve Capacity of Urban Road Network In A Discrete Network Design Problem, Advances In Engineering Software, Vol. 42, No. 12, pp. 1041–1050.
Novoa, Clara. 2006. A Set-Partitioning-Based Model for the Stochastic Vehicle Routing Problem, Department of Engineering and Technology, Texas State University, 601 University Drive, San Marcos, TX 78666, //homepages.cae.wisc.edu/~linderot/papers/Novoa-Et-Al- 06-TR.pdf, diunduh tanggal 6 Juli 2010 pukul 07:25 PM.
Özyurt, Zeynep, Aksen, Deniz, Aras, & Necati, (n.d), Open Vehicle Routing Problem with Time Deadlines: Solution Methods and an Application, //home.ku.edu.tr/~daksen/Ozyurt-Aksen-Aras-GOR2005-OVRPTD.pdf, diunduh tanggal 6 Juli 2010 pukul 07:05 PM.
Poorzahedy, H., & Abulghasemi, F. 2005. Application of Ant System to Network Design Problem, Transportastion, Vol. 32, No. 3, pp 251–273.
Poorzahedy, H., & Rouhani, OM. 2007. Hybrid Metaheuristic Algorithms for Solving Network Design Problem, European Journal of Operational Research, Vol. 182, No. 2, pp. 578–596.
Poorzahedy, H., & Turnquist, MA. 1982. Approximate Algorithms for The Discrete Network Design Problem, Transport Research–B, Vol. 16B, No. 1, pp. 45–55;
Salaki, Deiby Tineke. 2009. Penyelesaian Vehicle Routing Problem Menggunakan Beberapa Metoda Heuristik Konstruktif, Sekolah Pascasarjana Institut Pertanian Bogor. Bogor.
Steenbrink, PA. 1974. Transport Network Optimization In The Dutch Integral Transportation Study, Transportation Research, Vol. 8, No. 1, pp. 11–27.
Taniguchi, E., Thompson, RG., Yamada, T. 2007. Incorporating Risks In City Logistics, City Logistics VI, Sixth International Conference On City Logistics, pp. 1–20.
Tavassy, LA.1996. Modeling European Freight Transport Flows, PhD Thesis, TU. Delft.
Woensel, T. Van, Kerbache, L., Peremans, H., & Vandaele, N., (n.d), A Vehicle Routing Problem With Stochastic Travel Times, //www.icsd.aegean.gr/aic 2003/papers/vanwoensel-kerbache.pdf, diunduh tanggal 6 Juli 2010 pukul 08.22 PM.
Wu, JJ., Sun, HJ., Gao, ZY., & Zhang, HZ. 2009. Reversible Lane–Based Traffic Network Optimization with An Advanced Traveller information System. Engineering Optimization, Vol. 41, pp. 87–97.
Xiong, Y., & Schneider, JB.1992. Transportation Network Design Using A Cumulative Algorithm and neural Network, Transportation Research Record, Vol. 1364, pp. 37–44. [31] Yamada, T., Frazila, RB., Castro, J., & Taniguchi, E. 2009. Designing Multimodal Freight Transport Networks: A Heuristic Approach and Applications, Ttransport Science. Vol. 43, No. 2, pp. 129–143.