Trip planning for visitors in a service system with capacity constraints

DOI10.1016/J.COR.2022.105974MaRDI QIDQ2676374zbMATH OpenOpenAlexFDO

Authors Xinggang Luo, Xinrui Liu, Pengli Ji, Xuan-Zhu Shang, Z. L. Zhang

Publication date 27 September 2022

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cor.2022.105974

zbMATH Keywords

branch \& bounditinerary planningorienteering problemtrip planning

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• On the tour planning problem
• scientific article; zbMATH DE number 1975315
• The vacation planning problem: a multi-level clustering-based metaheuristic approach
• Heuristics for the time dependent team orienteering problem: application to tourist route planning
• Branch-and-check approaches for the tourist trip design problem with rich constraints

Cites work

• A branch-and-cut algorithm for the team orienteering problem
• A fast solution method for the time-dependent orienteering problem
• A guided local search metaheuristic for the team orienteering problem
• A hybrid adaptive large neighborhood search heuristic for the team orienteering problem
• A memetic algorithm for the team orienteering problem
• A reinforcement learning approach to the orienteering problem with time windows
• A simulated annealing heuristic for the team orienteering problem with time windows
• A TABU search heuristic for the team orienteering problem
• A two-stage approach to the orienteering problem with stochastic weights
• Algorithms to solve the orienteering problem: A comparison
• An effective PSO-inspired algorithm for the team orienteering problem
• An efficient evolutionary algorithm for the orienteering problem
• An exact algorithm for team orienteering problems
• An iterative three-component heuristic for the team orienteering problem with time windows
• An optimal solution procedure for the multiple tour maximum collection problem using column generation
• Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows
• Evolution-inspired local improvement algorithm solving orienteering problem
• Genetic algorithm with path relinking for the orienteering problem with time windows
• Hybridized evolutionary local search algorithm for the team orienteering problem with time windows
• Iterated local search for the team orienteering problem with time windows
• Optimal solutions for routing problems with profits
• Solving the Orienteering Problem through Branch-and-Cut
• Solving the team orienteering problem with cutting planes
• The capacitated team orienteering and profitable tour problems
• The effective application of a new approach to the generalized orienteering problem
• The Orienteering Problem with Time Windows
• The selective travelling salesman problem
• The team orienteering problem
• The team orienteering problem with time windows: an LP-based granular variable neighborhood search

Cited in

(7)

• Visiting a network of services with time constraints.
• scientific article; zbMATH DE number 1975315 (Why is no real title available?)
• Centralized multi-visitor trip planning with activity reservations in crowded destinations
• Cruise onboard itinerary planning for multi passengers with service venue capacity and time-window constraints
• VNSMAS: a constraint-based portfolio profit maximization
• A two-stage approach to the multiple-agent orienteering problem with stochastic weight and capacity constraints
• The museum visitor routing problem

This page was built for publication: Trip planning for visitors in a service system with capacity constraints

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