Trip itinerary planning plays an important role in the tourism industry and in our daily lives. In this paper, trip itinerary planning problem is modelled as Team Orienteering Problem with Time Window (TOPTW) with tra...
详细信息
ISBN:
(纸本)9781665499545
Trip itinerary planning plays an important role in the tourism industry and in our daily lives. In this paper, trip itinerary planning problem is modelled as Team Orienteering Problem with Time Window (TOPTW) with travel distance as a soft constraint. Three bio-inspired meta-heuristic algorithms, namely, geneticalgorithm, adaptive geneticalgorithm and artificialbeecolonyalgorithm are considered to solve this problem. These solvers are evaluated in terms of algorithms' execution time, optimality, and coverage time using real data from City of Toronto. The experiment results show that adaptive geneticalgorithm outperforms the other algorithms in terms of optimality and robustness.
暂无评论