محسن عبدالحسین زاده

In a grid network, the nodes could be traversed either horizontally or vertically. The constrained shortest Hamiltonian path goes over the nodes between a source node and a destination node, and it is constrained to traverse some nodes at least once while others could be traversed several times. There are various applications of the problem, especially in routing problems. It is an NP-complete problem, and the well-known Bellman-Held-Karp algorithm could solve the shortest Hamiltonian circuit problem within O(2^nn^2) time complexity; however, the shortest Hamiltonian path problem is more complicated. So, a metaheuristic algorithm based on ant colony optimization is applied to obtain the optimal solution. The proposed method applies the rooted shortest path tree structure since in the optimal solution the paths between the restricted nodes are the shortest paths. Then, the shortest path tree is obtained by at most O(n^3) time complexity at any iteration and the ants begin to improve the solution and the optimal solution is constructed in a reasonable time. The algorithm is verified by some numerical examples and the ant colony parameters are tuned by design of experiment method, and the optimal setting for different size of networks are determined.