22 research outputs found
Penerapan Algoritma Genetika Traveling Salesman Problem with Time Window: Studi Kasus Rute Antar Jemput Laundry
Get PDFOptimasi pemilihan rute merupakan masalah yang banyak dibahas padapenelitian ilmu komputer. Antar jemput laundry dengan pelanggan yang memiliki waktukhusus untuk menerima barang adalah salah satu contoh kasus pemilihan rute.Penghitungan rute tercepat memegang peranan penting karena harus tepat waktu dansemua pelanggan dapat dilayani. Berbeda dengan traveling salesman problem (TSP)konvensional yang bertujuan untuk meminimalkan jarak, kasus ini juga harusdipertimbangkan waktu ketersediaan setiap pelanggan. Pencarian solusi untukpermasalahannya adalah dengan mengkombinasikan solusi-solusi (kromosom) untukmenghasilkan solusi baru dengan menggunakan operator genetika (seleksi, crossover danmutasi). Untuk mencari solusi terbaik digunakan beberapa kombinasi probabilitascrossover dan mutasi serta ukuran populasi dan ukuran generasi. Dari hasil pengujiankombinasi probabilitas crossover yang terbaik adalah 0,4 dan mutasi adalah 0,6sedangkan untuk ukuran generasi optimal adalah 2000. Dari nilai-nilai parameter inididapatkan solusi yang memungkinkan untuk melayani semua pelanggan dengan time window masing - masing.</jats:p
The Effect of External Factors on Consumption Electricity Loads Forecasting using Fuzzy Takagi-Sugeno Kang
Get PDF<strong>This study applied Fuzzy Inference System Sugeno to forecast electrical load by considering the external factors. To see the accuracy of forecasting using Fuzzy Inference System Sugeno, then a comparison between the forecasting results of Fuzzy Inference System Sugeno using historical data with Fuzzy Inference System Sugeno using external factors was done. By using external factors method, resulted the smallest RMSE of 0762 and using historical data obtained error (RMSE) of 1028. The results of the study came to the conclusion that Fuzzy Inference System Sugeno method using external factors to forecast the consumption of electrical load gives a better result than Fuzzy Inference System Sugeno using only historical data.</strong></jats:p
Solving Part Type Selection and Loading Problem in Flexible Manufacturing System Using Real Coded Genetic Algorithms – Part II: Optimization
No full textThis paper presents modeling and optimization of two NP-hard problems in flexible manufacturing system (FMS), part type selection problem and loading problem. Due to the complexity and extent of the problems, the paper was split into two parts. The first part of the papers has discussed the modeling of the problems and showed how the real coded genetic algorithms (RCGA) can be applied to solve the problems. This second part discusses the effectiveness of the RCGA which uses an array of real numbers as chromosome representation. The novel proposed chromosome representation produces only feasible solutions which minimize a computational time needed by GA to push its population toward feasible search space or repair infeasible chromosomes. The proposed RCGA improves the FMS performance by considering two objectives, maximizing system throughput and maintaining the balance of the system (minimizing system unbalance). The resulted objective values are compared to the optimum values produced by branch-and-bound method. The experiments show that the proposed RCGA could reach near optimum solutions in a reasonable amount of time
Relay nodes placement for optimal coverage, connectivity, and communication of wireless sensor networks
No full textOptimization of part type selection and loading problem with alternative production plans in flexible manufacturing system using hybrid genetic algorithms - part 1: Modelling and representation
No full textHybrid genetic algorithms for multi-period part type selection and machine loading problems in flexible manufacturing system
No full textParallel Text Processing: Alignment of Indonesian to Javanese Language
No full textParallel text alignment is proposed as a way of aligning bahasa Indonesia to words in Javanese. Since the one-to-one word translator does not have the facility to translate pragmatic aspects of Javanese, the parallel text alignment model described uses a phrase pair combination. The algorithm aligns the parallel text automatically from the beginning to the end of each sentence. Even though the results of the phrase pair combination outperform the previous algorithm, it is still inefficient. Recording all possible combinations consume more space in the database and time consuming. The original algorithm is modified by applying the edit distance coefficient to improve the data-storage efficiency. As a result, the data-storage consumption is 90% reduced as well as its learning period (42s)
