(Local Search) Algorithm na Bincike na gida a ciki Java

Algorithm na Bincike na Gida shine fasaha na bincike a cikin Java shirye-shiryen da ke mayar da hankali kan inganta mafita ta hanyar bincike a cikin kusancin mafita na yanzu. Maimakon bincika dukkan sararin bayani, algorithm yana mai da hankali kan nemo mafita a cikin ƙaramin "unguwa."

Yadda Algorithm Neman Gida ke Aiki

Algorithm yana farawa daga farkon bayani kuma yana ƙoƙarin inganta shi ta hanyar neman ingantattun mafita a kusa da kusa. Algorithm yana sake bayyana ta hanyar mafita na kusa kuma yana zaɓar mafi kyawun bayani a cikinsu.

Fa'idodi da rashin Amfanin Algorithm na Bincike na Gida

Amfani:

• Inganci: Algorithm sau da yawa yana aiki da sauri a cikin manyan wuraren matsala ta hanyar neman jihohi kusa maimakon gabaɗayan sarari.
• Haɗin kai: Ana iya haɗawa da wasu hanyoyi don haɓaka aikin bincike.

Rashin hasara:

• Mafi kyawun Gida: Algorithm na iya haɗuwa zuwa wuri mafi kyau na gida ba tare da gano mafita ta duniya ba.

Misali da Bayani

Misali na ainihi na Algorithm na Bincike na Gida yana inganta hanyar zirga-zirga. Bari mu ga yadda wannan algorithm ke aiki:

import java.util.*;  
  
public class LocalSearchExample {  
    static double evaluateSolution(double[] solution) {  
        // Function to evaluate the quality of a solution  
        // Lower value indicates a better solution  
        return 1.0 /(1.0 + solution[0] + solution[1]);  
    }  
  
    static double[] localSearch(double[] initialSolution, double stepSize, int maxIterations) {  
        double[] currentSolution = Arrays.copyOf(initialSolution, initialSolution.length);  
        double currentEvaluation = evaluateSolution(currentSolution);  
  
        for(int i = 0; i < maxIterations; i++) {  
            double[] nextSolution = Arrays.copyOf(currentSolution, currentSolution.length);  
            nextSolution[0] += stepSize;  
            double nextEvaluation = evaluateSolution(nextSolution);  
  
            if(nextEvaluation < currentEvaluation) {  
                currentSolution = nextSolution;  
                currentEvaluation = nextEvaluation;  
            } else {  
                stepSize /= 2;  
            }  
        }  
  
        return currentSolution;  
    }  
}  

A cikin misalin da ke sama, muna amfani da Algorithm na Bincike na Gida don inganta tsarin lambobi. Algorithm ɗin yana bincika a cikin kusancin mafita na yanzu ta hanyar canza tsayayyen mataki kuma yana bincika idan sabon mafita ya fi kyau. Sakamakon shi ne cewa algorithm yana ci gaba da samun mafita mafi kyau a kan lokaci.