This research work aims to investigate the several variants of trip planning problems and develop efficient technique to solve that optimization problem. In order to model this kind of problem the Orienteering Problem became the promising starting point. Therefore, this basic model is extended to several variants in order to enable additional tourist functionalities. Based on the algorithm that is successfully applied to the certain version of problem, we proposed the Iterated Local Search Algorithm to tackle the Time Dependent Multi Constraint Team Orienteering Problem with Time Windows. The simple MCTOPTW takes into account money budget limitation as multiple constraints in addition to time window and associated satisfaction score while t...
Given a graph whose nodes and edges are associated with a profit, a visiting (or traversing) time an...
The orienteering problem (OP) is a routing problem that has numerous applications in various domains...
The Time-Dependent Orienteering Problem with Time Windows (TDOPTW) is a combinatorial optimization p...
This research work aims to investigate the several variants of trip planning problems and develop ef...
Ce travail de recherche vise à étudier les plusieurs variantes de problèmes de planification de voya...
Generating personalized tourist routes based on a tourist’s interests and constraints is an upcoming...
This abstract introduces the Multi Constraint Team Orienteering Problem with Multiple Time Windows (...
This study solves tourist trip planning using team orienteering problem with time windows with more ...
Planning a tourist trip in a foreign city can be a complex undertaking: when selecting the attractio...
The Orienteering Problem (OP) has received a lot of attention in the past few decades. The OP is a r...
The Time Dependent Team Orienteering Problem with Time Windows (TDTOPTW) can be used to model severa...
The Time-Dependent Orienteering Problem with Time Windows (TDOPTW) is a combinatorial optimization p...
The Time-Dependent Orienteering Problem with Time Windows (TDOPTW) is a combinatorial optimization p...
This paper introduces the multiconstraint team orienteering problem with multiple time windows (MC-T...
This paper introduces the multiconstraint team orienteering problem with multiple time windows (MC-T...
Given a graph whose nodes and edges are associated with a profit, a visiting (or traversing) time an...
The orienteering problem (OP) is a routing problem that has numerous applications in various domains...
The Time-Dependent Orienteering Problem with Time Windows (TDOPTW) is a combinatorial optimization p...
This research work aims to investigate the several variants of trip planning problems and develop ef...
Ce travail de recherche vise à étudier les plusieurs variantes de problèmes de planification de voya...
Generating personalized tourist routes based on a tourist’s interests and constraints is an upcoming...
This abstract introduces the Multi Constraint Team Orienteering Problem with Multiple Time Windows (...
This study solves tourist trip planning using team orienteering problem with time windows with more ...
Planning a tourist trip in a foreign city can be a complex undertaking: when selecting the attractio...
The Orienteering Problem (OP) has received a lot of attention in the past few decades. The OP is a r...
The Time Dependent Team Orienteering Problem with Time Windows (TDTOPTW) can be used to model severa...
The Time-Dependent Orienteering Problem with Time Windows (TDOPTW) is a combinatorial optimization p...
The Time-Dependent Orienteering Problem with Time Windows (TDOPTW) is a combinatorial optimization p...
This paper introduces the multiconstraint team orienteering problem with multiple time windows (MC-T...
This paper introduces the multiconstraint team orienteering problem with multiple time windows (MC-T...
Given a graph whose nodes and edges are associated with a profit, a visiting (or traversing) time an...
The orienteering problem (OP) is a routing problem that has numerous applications in various domains...
The Time-Dependent Orienteering Problem with Time Windows (TDOPTW) is a combinatorial optimization p...