Solusi Optimal Model Optimisasi Robust Untuk Masalah Traveling Salesman Dengan Ketidaktentuan Kotak Dan Pendekatan Metode Branch And Bound
Abstract
Traveling Salesman Problem (TSP) merupakan teknik pencarian rute yang dimulai dari satu titik awal, setiap kota harus dikunjungi sekali dan kemudian kembali ke tempat asal sehingga total jarak atau waktu perjalanan adalah minimum. Untuk mengatasi kedakpastian jarak atau waktu perjalanan, maka perlu dilakukan pengembangan model TSP. Salah satu bidang Optimisasi yang mampu menyelesaikan permasalahan terkait ketidakpastian adalah Optimisasi Robust. Dalam makalah ini dibahas mengenai penerapan Optimisasi Robust pada TSP (RTSP) menggunakan pendekatan Box Uncertainty dan diselesaikan dengan menggunakan Metode Branch and Bound. Disajikan simulasi numerik pada software aplikasi Maple untuk beberapa kasus nyata terkait penerapan Optimisasi RTSP , seperti masalah manajemen konstruksi, penentuan jarak tempuh kota di Pulau Jawa, dan Penentuan Rute Mandiri Fun Run.
Metrics
References
D. Chaerani, C. Roos., 2013. Handling Uncertain Optimization Problem via Robust Counterpart Methodology, Jurnal Teknik Industri., Vol. 15, No. 2, Desember 2013, hal 111-118 DOI: 10.9744/jti.15.2.111-118 ISSN 1411-2485 print / ISSN 2087-7439 online. '
Filip, E., Otakar, M., 2011. “The Travelling Salesman Problem and its Application in Logistic.†WSEAS TRANSACTIONS on BUSINESS and ECONOMICS. Issue 4, Volume 8, October 2011 ISSN: 1109-9526 ., pp 164-173
Hillier, dan Lieberman., 2008. Introduction to Operation Research. New York: McGraw-Hill.
Klanšek, U., 2011. Using the TSP Solution for Optimal Route Scheduling in Construction Management., Organization, Technology & Management In Construction: An International Journal ISSN 1847-5450 print / ISSN 1847-6228 Online UDC 62:658(05)., DOI 10.5592/otmcj.2011.1.3, pp. 243-249.
Lawler, E.L., dan Wood, D.E., 1966. Branch and Bound Method : A Survey. Operations Research 14 (4), pp. 699–719. http://dx.doi.org/10.1287/opre.14.4.699, diakses pada 6 Juli 2015.
Maps, G., 2015. Data Peta. [Online]
Available at: https://www.google.co.id/maps?source=tldsi&hl=id.
Montemanni, R., Barta, J., Mastrolilli,M., Gambardella, L.M., 2007., The robust traveling salesman problem with interval data, Transportation Science 41(3), 366-381.
Montemanni, R., Barta, J., Mastrolilli,M., Gambardella, L.M., 2007., Heuristic algorithms for the robust traveling salesman problem with interval data Proceedings of TRISTAN VI – The 6th Triennial Symposium on Transportation Analysis, Phuket, Thailand, 10-15 June 2007
Punnen, A. P. & Gutin, G., 2002. The Traveling Salesman Problem and It's Variations. Dordrecht: Kluwer Academic Publishers.
Schrijver, A., 2004. Combinatorial Optimization. Heiderberg: Springer-Verlag Berlin.
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).
Â