I am a beginner with meta-heuristic algorithms. A problem I have encountered while programming is the step: Generate a candidate solution. I have studied many papers, but none of them give me a hint about this.Right now I have implemented a way to generate candidate solutions. But I want to know if there are any standards for generating candidate solutions. Or is it something I have to design on my own.I have to explain this step in my thesis. Are where any hints for me?Thanks in advance
Generate Candidate solution/ generate neighbouring solution
heuristics