A search problem refers to the task of finding a solution within some space of possible options, and that space could be made up of discrete steps or continuously varying values. For example, solving ...

The path planning algorithms search for the collision-free path between the start and end points while satisfying the evaluation metrics 1. These algorithms are classified as the classical approaches, ...

Recently, researchers have attempted to develop a new algorithm by combining quantum systems and metaheuristics algorithms and are confirming its applicability in engineering optimization problems.