World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

A Survey on Orienteering Problem and its New Variants

    https://doi.org/10.1142/9789813225237_0100Cited by:0 (Source: Crossref)
    Abstract:

    Orienteering Problem (OP) can be modeled in many applications such as logistic scheduling system, tourist guide service, athlete recruiting. OP and its variants have attracted increasing attention of scholars. In this paper, a literature review is conducted on the recent development of OP and its new variant including Time-Dependent Orienteering Problem (TDOP), Stochastic Orienteering Problem (SOP) and Multi-Objective Orienteering Problem (MOOP). The definition and formulation of OP and its variants are formally described. The exact and heuristic algorithms used to solve the OP and its variants are summarized and compared.