The vacation planning problem: a multi-level clustering-based metaheuristic approach

DOI10.1016/J.COR.2022.106083OpenAlexW4308808601MaRDI QIDQ2108189

Nikolaos Vathis, Damianos Gavalas, Charalampos Konstantopoulos, Grammati E. Pantziou

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

zbMATH Keywords

metaheuristicorienteering problemtourist trip design problemlocation routing problemmulti-level clusteringorienteering problem with hotel selectionvacation planning

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• ElemStatLearn
• OpenStreetMap

Cites Work

• Heuristics for the time dependent team orienteering problem: application to tourist route planning
• Variable neighborhood search for location routing
• Using clustering analysis in a capacitated location-routing problem
• Planning in tourism and public transportation. Attraction selection by means of a personalised electronic tourist guide and train transfer scheduling
• Column generation based heuristics for a generalized location routing problem with profits arising in space exploration
• Time dependent orienteering problem with time windows and service time dependent profits
• A greedy randomized adaptive search procedure for the orienteering problem with hotel selection
• A memetic algorithm for the orienteering problem with hotel selection
• Branch-and-check approaches for the tourist trip design problem with rich constraints
• The orienteering problem
• Formulation and a heuristic approach for the orienteering location-routing problem

This page was built for publication: The vacation planning problem: a multi-level clustering-based metaheuristic approach