On the tour planning problem

DOI10.1007/S10479-010-0763-5MaRDI QIDQ763203zbMATH OpenOpenAlexFDO

Authors Chenbo Zhu, Fengchun Wang, Rongzeng Cao, Jianqiang Hu, Yifan Xu

Publication date 9 March 2012

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10479-010-0763-5

zbMATH Keywords

heuristiclocal searchmixed integer linear programmingteam orienteering problemtour planning problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Mixed integer programming (90C11) Traffic problems in operations research (90B20)

Recommendations

• scientific article; zbMATH DE number 1975315
• Heuristics for the time dependent team orienteering problem: application to tourist route planning
• The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
• scientific article; zbMATH DE number 836777
• A LP-based heuristic for a time-constrained routing problem

Cites work

• A guided local search metaheuristic for the team orienteering problem
• An Exchange Heuristic for Routeing Problems with Time Windows
• Computer Solutions of the Traveling Salesman Problem
• The Vehicle Routing Problem with Time Windows Part I: Tabu Search
• The team orienteering problem

Cited in

(24)

• Splitting a giant tour using integer linear programming
• The hiking tourist problem
• Rough approximation-based approach for designing a personalized tour route under a fuzzy environment
• Optimal duty rostering for toll enforcement inspectors
• scientific article; zbMATH DE number 2006580 (Why is no real title available?)
• The one-period bus touring problem: Solved by an effective heuristic for the orienteering tour problem and improvement algorithm
• Efficient sequential decision-making algorithms for container inspection operations
• Solving Large-Scale Tour Scheduling Problems
• Evolution-inspired local improvement algorithm solving orienteering problem
• Low budget traveling: the orienteering problem with hotel selection and budget constraint
• A LP-based heuristic for a time-constrained routing problem
• Selection of cultural sites via optimization
• Tourenplanung für zwei Depots bei offenen Touren
• Tourism route planning based on the three stages of TSP algorithm
• Design of diversified package tours for the digital travel industry: a branch-cut-and-price approach
• A mixed-integer linear programming approach to the optimization of event-bus schedules: a scheduling application in the tourism sector
• Detection of local tourism systems by threshold accepting
• scientific article; zbMATH DE number 1975315 (Why is no real title available?)
• Tour recommendation for groups
• Trip planning for visitors in a service system with capacity constraints
• Survey, categorization, and comparison of recent tour scheduling literature
• Heuristics for the time dependent team orienteering problem: application to tourist route planning
• Attractive orienteering problem with proximity and timing interactions
• Time-dependent tourist tour planning with adjustable profits

This page was built for publication: On the tour planning problem

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