Show
Sort by
-
The time-dependent orienteering problem with time windows : a fast ant colony system
-
A metaheuristic solution approach for the time-constrained project scheduling problem
-
Solving the stochastic time-dependent orienteering problem with time windows
-
The Time-Dependent Orienteering problem with Time Windows: a fast solution method
-
Solving the stochastic time-dependent orienteering problem
-
- Conference Paper
- C3
- open access
The orienteering problem with time-dependent stochastic travel times
-
An extension of the arc orienteering problem and its application to cycle trip planning
-
Solution methods for the cycle trip planning problem
-
A fast solution method for the time-dependent orienteering problem
-
- Conference Paper
- C1
- open access
A fast solution method for the time-dependent orienteering problem with time windows
-
- Conference Paper
- C1
- open access
Solution methods for the time-dependent orienteering problem
-
Heuristics for the traveling repairman problem with profits
-
A memetic algorithm for the travelling salesperson problem with hotel selection
-
A variable neighborhood search method for the orienteering problem with hotel selection
-
Joint maintenance and inventory optimization systems: a review
-
The multiconstraint team orienteering problem with multiple time windows
-
Integrating public transportation in personalised electronic tourist guides
-
Comparing metaheuristics for the time-dependent orienteering problem
-
- Conference Paper
- C3
- open access
Generating tool paths for laser cutting machines
-
- Conference Paper
- C3
- open access
Improved methods for the travelling salesperson problem with hotel selection
-
- Conference Paper
- C3
- open access
Improving the robustness of the railway system in Brussels
-
- Conference Paper
- C3
- open access
Congestion avoidance: optimization of vehicle routing planning for the logistics industry
-
- Conference Paper
- C3
- open access
Orienteering problem with hotel selection: a variable neighborhood search method
-
- Conference Paper
- C3
- open access
Metaheuristics for the time-dependent orienteering problem
-
The travelling salesperson problem with hotel selection
-
Automated, passenger time optimal, robust timetabling, using integer programming
-
- Conference Paper
- C3
- open access
Knock, knock, dnock-on on railway networks
-
Trip planning functionalities: state of the art and future
-
Calculation of realistic railway station capacity by platforming feasibility checks
-
Cutting path optimization using tabu search
-
Deriving all passenger flows in a railway network from ticket sales data
-
Defining robustness of a railway timetable
-
Laser cutting tool path optimization
-
Deriving all passenger flows in a railway network from ticket sales data
-
Defining robustness of a railway timetable
-
Orienteering problem with hotel selection
-
The planning of cycle trips in the province of East Flanders
-
The orienteering problem: a survey
-
The city trip planner: an expert system for tourists
-
- Conference Paper
- C1
- open access
Heuristics for the traveling repairman problem with profits
-
Hybrid approach for the public transportation time dependent orienteering problem with time windows
(2010) Lecture Notes in Artificial Intelligence. In Lecture Notes in Artificial Intelligence 6077. p.151-158 -
- Conference Paper
- P1
- open access
Personalized tourist route generation
-
- Conference Paper
- P1
- open access
Tourist trip planning functionalities : state-of-the-art and future
-
A path relinking approach for the team orienteering problem
-
Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
-
A guided local search metaheuristic for the team orienteering problem
-
Iterated local search for the team orienteering problem with time windows
-
Planning in tourism and public transportation
-
A personalized tourist trip design algorithm for mobile tourist guides
-
Decreasing the passenger waiting time for an intercity rail network
-
Developing railway timetables which guarantee a better service