A multifaceted heuristic for the orienteering problem

B. L. Golden, Qiwen Wang and Li Liu

Naval Research Logistics (NRL), 1988, vol. 35, issue 3, 359-366

Abstract: The orienteering problem involves the selection of a path between an origin and a destination which maximizes total score subject to a time restriction. In previous work we presented an effective heuristic for this NP‐hard problem that outperformed other heuristics from the literature. In this article we describe and test a significantly improved procedure. The new procedure is based on four concepts—center of gravity, randomness, subgravity, and learning. These concepts combine to yield a procedure which is much faster and which results in more nearly optimal solutions than previous procedures.

Date: 1988
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (14)

Downloads: (external link)
https://doi.org/10.1002/1520-6750(198806)35:33.0.CO;2-H

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navres:v:35:y:1988:i:3:p:359-366

Access Statistics for this article

More articles in Naval Research Logistics (NRL) from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().