A fast and effective heuristic for the orienteering problem
Article Abstract:
A fast and effective heuristic for the orienteering problem is shown to generate near-optimal solutions in a short amount of computation time. Easy to understand and implement, the new heuristic consists of two steps: initialization and improvement. The first step was done by constructing an ellipse over the entire set of points, using the start and end points as the foci and the time limit as the length of the major axis. A number of paths over the points are derived and the total score is allowed to decrease to find a path with a large total score that is nearly optimal. Tests on 67 problems from the literature and 40 new problems showed the new heuristic to be computationally efficient and to perform well on all problems.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
The team orienteering problem
Article Abstract:
A fast and efficient heuristic for team orienteering, an outdoor sport usually played in a mountainous or densely forested area where a participant starts at a specified control point, tries to visit as many control points as possible within a time period and returns to a specified end point, is presented. Tests on 353 problems ranging in size from 21 to 102 points showed the heuristic to be computationally efficient. It also consistently outperformed a stochastic algorithm for the team orienteering problem.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 1996
User Contributions:
Comment about this article or add new information about this topic:
A computational study of smoothing heuristics for the traveling salesman problem
Article Abstract:
The performance of smoothing heuristics for the traveling salesman problem was studied.
Publication Name: European Journal of Operational Research
Subject: Business, international
ISSN: 0377-2217
Year: 2000
User Contributions:
Comment about this article or add new information about this topic:
- Abstracts: An iterative improvement approach for the nonpreemptive open shop scheduling problem. A hybrid genetic algorithm for the open shop scheduling problem
- Abstracts: The multiobjective equilibrium network design problem revisited: a simulated annealing approach. Siting noxious facilities under uncertainty