Posts

Input

SPK WASPAS - Sistem Pendukung Keputusan

Sistem Pendukung Keputusan (SPK) - Metode WASPAS

Masukkan data untuk alternatif dan kriteria, lalu klik hitung untuk mendapatkan hasilnya.

Masukkan Bobot Kriteria

Harga:

Kualitas:

Fitur:

Masukkan Nilai Alternatif

Alternatif	Harga	Kualitas	Fitur
Alternatif 1
Alternatif 2
Alternatif 3

Masukan Data


public class WaspasSPK {

    public static void main(String[] args) {
        // Bobot kriteria
        double[] bobot = {0.4, 0.3, 0.3};  // Harga, Kualitas, Fitur

        // Nilai alternatif (misalnya, 3 alternatif dan 3 kriteria)
        double[][] alternatif = {
            {100, 4, 3},  // Alternatif 1: Harga, Kualitas, Fitur
            {150, 5, 4},  // Alternatif 2: Harga, Kualitas, Fitur
            {120, 3, 5}   // Alternatif 3: Harga, Kualitas, Fitur
        };

        // Menghitung hasil WSM (Weighted Sum Model)
        double[] wsmResults = calculateWSM(alternatif, bobot);
        // Menghitung hasil WPM (Weighted Product Model)
        double[] wpmResults = calculateWPM(alternatif, bobot);

        // Menampilkan hasil WSM dan WPM
        System.out.println("Hasil WSM:");
        for (int i = 0; i < wsmResults.length; i++) {
            System.out.println("Alternatif " + (i + 1) + ": " + wsmResults[i]);
        }

        System.out.println("\nHasil WPM:");
        for (int i = 0; i < wpmResults.length; i++) {
            System.out.println("Alternatif " + (i + 1) + ": " + wpmResults[i]);
        }

        // Menentukan alternatif terbaik dengan hasil WASPAS (gabungan WSM dan WPM)
        System.out.println("\nAlternatif Terbaik:");
        for (int i = 0; i < alternatif.length; i++) {
            double finalScore = 0.5 * wsmResults[i] + 0.5 * wpmResults[i];
            System.out.println("Alternatif " + (i + 1) + " Skor Akhir: " + finalScore);
        }
    }

    // Fungsi untuk menghitung hasil WSM (Weighted Sum Model)
    public static double[] calculateWSM(double[][] alternatif, double[] bobot) {
        double[] results = new double[alternatif.length];
        for (int i = 0; i < alternatif.length; i++) {
            double sum = 0;
            for (int j = 0; j < alternatif[i].length; j++) {
                sum += alternatif[i][j] * bobot[j];
            }
            results[i] = sum;
        }
        return results;
    }

    // Fungsi untuk menghitung hasil WPM (Weighted Product Model)
    public static double[] calculateWPM(double[][] alternatif, double[] bobot) {
        double[] results = new double[alternatif.length];
        for (int i = 0; i < alternatif.length; i++) {
            double product = 1;
            for (int j = 0; j < alternatif[i].length; j++) {
                product *= Math.pow(alternatif[i][j], bobot[j]);
            }
            results[i] = product;
        }
        return results;
    }
}

RUMUS Penyelesaian

public class WaspasSPK { public static void main(String[] args) { // Bobot kriteria double[] bobot = {0.4, 0.3, 0.3}; // Harga, Kualitas, Fitur // Nilai alternatif (misalnya, 3 alternatif dan 3 kriteria) double[][] alternatif = { {100, 4, 3}, // Alternatif 1: Harga, Kualitas, Fitur {150, 5, 4}, // Alternatif 2: Harga, Kualitas, Fitur {120, 3, 5} // Alternatif 3: Harga, Kualitas, Fitur }; // Menghitung hasil WSM (Weighted Sum Model) double[] wsmResults = calculateWSM(alternatif, bobot); // Menghitung hasil WPM (Weighted Product Model) double[] wpmResults = calculateWPM(alternatif, bobot); // Menampilkan hasil WSM dan WPM System.out.println("Hasil WSM:"); for (int i = 0; i < wsmResults.length; i++) { System.out.println("Alternatif " + (i + 1) + ": " + wsmResults[i]); } System.out.println("\nHasil WPM:"); for (int i = 0; i < wpmResults.length; i++) { System.out.println("Alternatif " + (i + 1) + ": " + wpmResults[i]); } // Menentukan alternatif terbaik dengan hasil WASPAS (gabungan WSM dan WPM) System.out.println("\nAlternatif Terbaik:"); for (int i = 0; i < alternatif.length; i++) { double finalScore = 0.5 * wsmResults[i] + 0.5 * wpmResults[i]; System.out.println("Alternatif " + (i + 1) + " Skor Akhir: " + finalScore); } } // Fungsi untuk menghitung hasil WSM (Weighted Sum Model) public static double[] calculateWSM(double[][] alternatif, double[] bobot) { double[] results = new double[alternatif.length]; for (int i = 0; i < alternatif.length; i++) { double sum = 0; for (int j = 0; j < alternatif[i].length; j++) { sum += alternatif[i][j] * bobot[j]; } results[

Search This Blog

Spk WASPAS Laptop Terbaik Lokal

Posts

DATA

Latest Posts