|
|
|
|
|
Md. Sabir Hossain, Ahsan Sadee Tanim, Sadman Sakib Choudhury, S. M. Afif Ibne Hayat, Muhammad Nomani Kabir, Mohammad Mainul Islam
The traveling salesman problem (TSP) is a famous NP-hard problem in the area of combinatorial optimization. It is utilized to locate the shortest possible route that visits every city precisely once and comes back to the beginning point from a given set ...
ver más
|
|
|
|
|
|
|
|
|
|
|
Md. Sabir Hossain,Ahsan Sadee Tanim,Nabila Nawal,Sharmin Akter
Pág. 32 - 39
Background: Tour recommendation and path planning are the most challenging jobs for tourists as they decide Points of Interest (POI).Objective: To reduce the physical effort of the tourists and recommend them a personalized tour is the main objective of ...
ver más
|
|
|
|
|
|