Rekomendasi Objek Wisata Provinsi Jawa Barat Dengan Algoritma Branch and Bound

Abstract Tourists usually visit several places at once in time all the attractions of a visit in different location. One of the problems faced by travelers to reach the goal is the nearest path searching to a number of tourist objects. One of the algorithms used to solve the problem of line search algorithm is the nearest branch and bound. This algorithm describe the node as a point of tourist objects and lines as paths. Nodes and lines are given the values and weights for the calculation, so that from a couple of combinations and possibilities, the smallest obtained value is the closest path value can be reached. The recommendations of this line makes it easy for travelers to obtain tourism information in West Java for visiting different objects. Keywords: branch and bound algorithms, tourism object, search path, branching & bounding, graf Abstrak Wisatawan umumnya mengunjungi beberapa tempat sekaligus dalam waktu sekali kunjungan ke objek wisata yang letak lokasinya berbeda-beda. Salah satu masalah yang dihadapi wisatawan untuk mencapai tujuan adalah pencarian jalur terdekat ke sejumlah kunjungan objek wisata. Algoritma yang dapat digunakan untuk memecahkan masalah pencarian jalur terdekat adalah algoritma branch and bound. Algoritma tersebut menggambarkan simpul sebagai titik objek wisata dan garis sebagai jalur. Simpul dan garis diberi nilai dan bobot untuk perhitungan, sehingga dari beberapa kombinasi dan kemungkinan, didapatkan nilai terkecil yang merupakan nilai jalur terdekat yang dapat ditempuh. Rekomendasi jalur ini memudahkan wisatawan memperoleh informasi objek wisata di Jawa Barat untuk mengunjungi beberapa objek wisata yang berbeda-beda. Kata kunci: algoritma branch and bound, obyek wisata, pencarian jalur, pencabangan dan pembatasan, graf

Download Full-text

Energy Conservation Using Cost Minimization for Household Space Heating

Volume 4: 19th Design for Manufacturing and the Life Cycle Conference; 8th International Conference on Micro- and Nanosystems ◽

10.1115/detc2014-35202 ◽

2014 ◽

Author(s):

Mayank Pareek ◽

Rupal Vikas Srivastava ◽

Sara Behdad

Keyword(s):

Line Search ◽

Search Algorithm ◽

Cost Minimization ◽

Insulation Material ◽

Insulation Materials ◽

Building Insulation ◽

Temperature Heat ◽

Quasi Newton ◽

Line Search Algorithm ◽

Decision Making Tool

Building insulation is considered as a solution to reduce the energy cost for both residential and commercial buildings. However, determining the best combination of insulation materials that result into the lowest total ownership cost is now becoming a bigger challenge. Various factors influence the efficiency of heat transfer within a room including geometry and size of the room, ambient temperature, heat and sink sources presented inside the building, type of insulation materials, etc. The aim of this paper is to develop an optimization-based decision making tool to help house owners select the best combination of given insulation materials considering all these factors. The purpose of design approach adopted in this paper is to minimize total ownership cost while providing the required heating in the building. The SQP, Quasi-Newton, line-search algorithm was used to obtain the optimized thermal conductivity values for the combination of insulation material to be used in the walls, floor, ceiling, window and the door of a room, along with the width of the air gap to be kept. The results help in deciding what combination of insulation material will achieve the required heating for the house owner while keep the total cost incurred to be minimum.

Download Full-text