The vacation planning problem: a multi-level clustering-based metaheuristic approach
DOI10.1016/J.COR.2022.106083OpenAlexW4308808601MaRDI QIDQ2108189FDOQ2108189
Authors: Nikolaos Vathis, Charalampos Konstantopoulos, Grammati Pantziou, Damianos Gavalas 
Publication date: 19 December 2022
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2022.106083
Recommendations
- Metaheuristics for the tabu clustered traveling salesman problem
- Optimization of non-linear multiple traveling salesman problem using \(k\)-means clustering, shrink wrap algorithm and meta-heuristics
- Hybrid metaheuristics for the clustered vehicle routing problem
- Metaheuristics based on decision hierarchies for the traveling purchaser problem
- An adapted heuristic approach for a clustered traveling salesman problem with loading constraints
- Solving the clustered traveling salesman problem with ‐relaxed priority rule
- A heuristic approach for cluster TSP
- Metaheuristic clustering
metaheuristicorienteering problemlocation routing problemtourist trip design problemmulti-level clusteringorienteering problem with hotel selectionvacation planning
Cites Work
- The orienteering problem
- Using clustering analysis in a capacitated location-routing problem
- Column generation based heuristics for a generalized location routing problem with profits arising in space exploration
- Variable neighborhood search for location routing
- A memetic algorithm for the orienteering problem with hotel selection
- Heuristics for the time dependent team orienteering problem: application to tourist route planning
- Planning in tourism and public transportation. Attraction selection by means of a personalised electronic tourist guide and train transfer scheduling
- Formulation and a heuristic approach for the orienteering location-routing problem
- A greedy randomized adaptive search procedure for the orienteering problem with hotel selection
- Time dependent orienteering problem with time windows and service time dependent profits
- Branch-and-check approaches for the tourist trip design problem with rich constraints
Cited In (8)
- The hiking tourist problem
- Multi-day tourist trip design and its optimization method based on time framework
- Tour recommendation for groups
- Time-dependent tourist tour planning with adjustable profits
- Trip planning for visitors in a service system with capacity constraints
- Title not available (Why is that?)
- Detection of local tourism systems by threshold accepting
- Balancing travel satisfaction algorithm for multi-day trip planning
Uses Software
This page was built for publication: The vacation planning problem: a multi-level clustering-based metaheuristic approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2108189)
