Muhammad Isa Irawan, Muhammad Isa
Institut Teknologi Sepuluh Nopember Surabaya

Published : 2 Documents
Articles

Found 2 Documents
Search

Perancangan Dan Pembuatan Aplikasi Decision Support System Pada Departemen Hrd Dan Pembelian Dengan Menggunakan Metode Analytical Hierarcy Process (AHP) Setiawan, Alexander; Irawan, Muhammad Isa; Wijaya, Robin
Jurnal Semesta Teknika Vol 10, No 1 (2007): MEI 2007
Publisher : Jurnal Semesta Teknika

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (766.998 KB)

Abstract

The rapidly technology process on globalisasion era in business world, makes the decision making is the important thing to make decision faced with the competition in business world. The decision making can be influence by a few aspect and group, which can influence the decision maker to accelerate the fast, perfectly and correctly the decision making. This software created by using Analytical hierarcy process method is doing calculation proses to get the best decision, using the score group of calculation and compare it with each possibility count of the choosen decision, this software specially for HRD and purchasing division, for HRD division this software will be use to decide which employee will be promoted or which employee will be fired. For purchasing division, this software will used to decude which supplier will be choose to buy a kind of goods. Employee mark, disipline mark, and  development ability  are the group that used for HRD division, while purchasing division use quality of goods, price, accuracy time shipping and supplier identity.Application the design and the testing of decision support system result a correct and flexsibel decision with all criteria which influence that decision and give a report in order to user can understand why this software choose that decision.      
Studi Komparatif antara Jaringan Syaraf Tiruan Boltzman Machine dan Algoritma Genetika untuk Optimasi Traveling Salesman Problem Irawan, Muhammad Isa
Limits: Journal of Mathematics and Its Applications Vol 1, No 1 (2004)
Publisher : Institut Teknologi Sepuluh Nopember

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (202.232 KB) | DOI: 10.12962/j1829605X.v1i1.1346

Abstract

Traveling Salesman Problem (TSP) dikenal sebagai suatu permasalahan optimasi klasik dan Non Deterministic Polynomial-time Complete (NPC). Permasalahan ini melibatkan se- orang salesman yang harus melakukan kunjungan sekali pada semua kota sebelum kembali ke kota awalnya, sampai akhirnya perjalanan itu disebut sempurna. Penyelesaian dari ma- salah ini adalah mencari nilai optimum yang paling murah, misalkan perjalanan dengan jarak terpendek atau yang mempunyai total harga yang termurah.Dalam paper ini akan dianalisis penyelesaian TSP dengan JST Boltzman Machine dan Algoritma Genetika. Dari hasil komparasi tersebut ternyata JST Boltzman Machine mem- berikan hasil lebih baik untuk menyelesaikan masalah TSP. Kata kunci : Jaringan Syaraf Tiruan, Boltzman Machine , Algoritma Genetika, TSP.