Solusi Optimal Model Optimisasi Robust untuk Masalah Traveling Salesman dengan Ketidaktentuan Kotak dan Pendekatan Metode Branch and Bound  

Oleh:

Amriyati, Poppy ; Chaerani, Diah ; Lesmana, Eman

Jenis: Article from Journal - ilmiah nasional - terakreditasi DIKTI - non-atma jaya
Dalam koleksi: Jurnal Teknik Industri vol. 17 no. 2 (Dec. 2015), page 81-88.
Topik: Traveling salesman problem; robust optimization; branch and bound method; box uncertainty
Fulltext: 81-88_her.pdf (628.84KB)

Isi artikel

Traveling Salesman Problem (TSP) is route search technique that starts from a starting point, every city should be visited once and return to place of origin so that the total distance or travel time is minimum. To overcome the uncertainty of distance or travel time, it is necessary to develop a model of TSP. Optimization with uncertainty can be handle using Robust Optimization. In this paper some applications of Robust Optimization on TSP (RTSP) is discussed using what so-called Box Uncertainty approach and is solved via Branch and Bound Method. Numerical simulations on Maple application software is presented for some real cases related to application of RTSP such as construction management problem, determining the distance for traveling in Java Island and finding the optimal route for Mandiri Fun Run Route

Opini Anda

Klik untuk menuliskan opini Anda tentang koleksi ini!

Kembali