A stabilized column generation scheme for the traveling salesman subtour problem
Discrete Applied Mathematics - Special issue: International symposium on combinatorial optimization CO'02
A TABU search heuristic for the team orienteering problem
Computers and Operations Research
Learning to improve earth observation flight planning
IAAI'08 Proceedings of the 20th national conference on Innovative applications of artificial intelligence - Volume 3
Efficient viewpoint assignment for urban texture documentation
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
ROSE: assisting pedestrians to find preferred events and comfortable public transport connections
Mobility '09 Proceedings of the 6th International Conference on Mobile Technology, Application & Systems
UAV intelligent path planning for wilderness search and rescue
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Computers and Operations Research
A Path Relinking approach for the Team Orienteering Problem
Computers and Operations Research
The effective application of a new approach to the generalized orienteering problem
Journal of Heuristics
Digital ants as the best cicerones for museum visitors
Applied Soft Computing
Analysis of the maximum level policy in a production-distribution system
Computers and Operations Research
Time-dependent personal tour planning and scheduling in metropolises
Expert Systems with Applications: An International Journal
A multicriteria ant colony algorithm for generating music playlists
Expert Systems with Applications: An International Journal
Variable neighborhood search for the orienteering problem
ISCIS'06 Proceedings of the 21st international conference on Computer and Information Sciences
A genetic algorithm vs. local search methods for solving the orienteering problem in large networks
KES'12 Proceedings of the 16th international conference on Knowledge Engineering, Machine Learning and Lattice Computing with Applications
The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach
Computers and Operations Research
A hybrid algorithm for the DNA sequencing problem
Discrete Applied Mathematics
A two-stage approach to the orienteering problem with stochastic weights
Computers and Operations Research
| Hi-index | 0.00 |
In the Orienteering Problem (OP), we are given an undirected graph with edge weights and node prizes. The problem calls for a simple cycle whose total edge weight does not exceed a given threshold, while visiting a subset of nodes with maximum total prize. This NP-hard problem arises in routing and scheduling applications. We describe a branch-and-cut algorithm for finding an optimal OP solution. The algorithm is based on several families of valid inequalities. We also introduce a family of cuts, called conditional cuts, which can cut off the optimal OP solution, and propose an effective way to use them within the overall branch-and-cut framework. Exact and heuristic separation algorithms are described, as well as heuristic procedures to produce near-optimal OP solutions. An extensive computational analysis on several classes of both real-world and random instances is reported. The algorithm proved to be able to solve to optimality large-scale instances involving up to 500 nodes, within acceptable computing time. This compares favorably with previous published methods.