A survey on route planning algorithms, focusing on its touristic applications

MaRDI QIDQ2973226zbMATH OpenFDO

Authors Sándor M. Apáthy

Publication date 31 March 2017

zbMATH Keywords

heuristic algorithmroute planningteam-orienteering problemtourism

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20) Linear programming (90C05) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Engineering Route Planning Algorithms
• Heuristic shortest path algorithms for transportation applications: state of the art
• scientific article; zbMATH DE number 1975315
• The traveling salesman problem: An overview of exact and approximate algorithms
• An improved dynamic travel route planning algorithm based on multiple constraints

Cited in

(7)

• Visual attractiveness in routing problems: a review
• Generating constrained length personalized bicycle tours
• A comparison of algorithms for finding an efficient theme park tour
• Survey, categorization, and comparison of recent tour scheduling literature
• Engineering Route Planning Algorithms
• Personalised hiking time estimation
• One-way motivation iterative improvement algorithm for tourism route planning

This page was built for publication: A survey on route planning algorithms, focusing on its touristic applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2973226)