Discrete farmland fertility optimization algorithm with metropolis acceptance criterion for traveling salesman problems

Traveling Salesman Problem (TSP) is an intricate discrete hybrid optimization problem that is categorized as an NP‐Hard problem. The objective of the TSP is to find the shortest Hamilton route between cities to visit all existing cities and returning to the original city, from which the route starte...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	International journal of intelligent systems 2021-03, Vol.36 (3), p.1270-1303
Hauptverfasser:	Benyamin, Abdollahzadeh, Farhad, Soleimanian Gharehchopogh, Saeid, Barshandeh
Format:	Artikel
Sprache:	eng
Schlagworte:	Acceptance criteria Agricultural land Algorithms Crossovers farmland fertility algorithm Fertility hybridization Intelligent systems metropolis acceptance criterion Optimization Traveling salesman problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!