An Improved Farmland Fertility Algorithm with Hyper-Heuristic Approach for Solving Travelling Salesman Problem

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 Fertilit...

Full description

Saved in:
Bibliographic Details
Published inComputer modeling in engineering & sciences Vol. 135; no. 3; pp. 1981 - 2006
Main Authors Soleimanian Gharehchopogh, Farhad, Abdollahzadeh, Benyamin, Arasteh, Bahman
Format Journal Article
LanguageEnglish
Published Henderson Tech Science Press 2023
Subjects
Online AccessGet full text

Cover

Loading…