This paper presents the preliminary design of the crow search algorithm, known as modern or metaheuristics in solving many non-deterministic polynomial hard problems (NP-hard). In this paper, the capability of crow search is shown for solving travelling salesman problem (TSP), a class of NP-hard that received special attention in operations research since last century. Ten instances from TSPLIB dataset were tested and compared with other algorithms such as Ant Colony Optimization and Simulated Annealing. The problems preliminary results show the significant and feasible solution in spite of the algorithm itself that has not yet been tuned to reach its full potential.
