Farhad Soleimanian Gharehchopogh1,*, Benyamin Abdollahzadeh1, Bahman Arasteh2
CMES-Computer Modeling in Engineering & Sciences, Vol.135, No.3, pp. 1981-2006, 2023, DOI:10.32604/cmes.2023.024172
Abstract Travelling Salesman Problem (TSP) is a discrete hybrid optimization problem considered NP-hard. TSP aims to
discover the shortest Hamilton route that visits each city precisely once and then returns to the starting point,
making it the shortest route feasible. This paper employed a Farmland Fertility Algorithm (FFA) inspired by
agricultural land fertility and a hyper-heuristic technique based on the Modified Choice Function (MCF). The
neighborhood search operator can use this strategy to automatically select the best heuristic method for making the
best decision. Lin-Kernighan (LK) local search has been incorporated to increase the efficiency and performance of
this suggested approach.… More >
Login
Register
