Minimum directed 1-subtree relaxation for score orienteering problem

Seiji Kataoka, Takeo Yamada, Susumu Morito

    Research output: Contribution to journalArticle

    7 Citations (Scopus)

    Abstract

    Score orienteering is a variant of the orienteering game where competitors start at a specified control point, visit as many control points as possible and thereby collect prizes, and return to the starting point within a prescribed amount of time. The competitor with the highest amount of prizes wins the game. In this paper, we propose the minimum directed 1-subtree problem as a new relaxation to this problem and develop two methods to improve its lower bound. We describe a cut and dual simplex method and a Lagrangian relaxation method, and construct an algorithm that combines these two methods in an appropriate way. Computational experiments are carried out to analyse the behavior of the proposed relaxation with respect to the characteristics of the test problems. Especially for large-scale instances, we find that the proposed relaxation is superior to the ordinary assignment relaxation.

    Original languageEnglish
    Pages (from-to)139-153
    Number of pages15
    JournalEuropean Journal of Operational Research
    Volume104
    Issue number1
    Publication statusPublished - 1998 Jan 1

    Fingerprint

    Control Points
    Game
    Dual Method
    Lagrangian Method
    Lagrangian Relaxation
    Simplex Method
    Relaxation Method
    Computational Experiments
    Test Problems
    Assignment
    Experiments
    Lower bound
    experiment
    Competitors
    Simplex method
    Lower bounds
    Experiment
    Lagrangian relaxation
    time

    Keywords

    • Minimum directed 1-subtree relaxation
    • Orienteering problem
    • Traveling salesman problem

    ASJC Scopus subject areas

    • Information Systems and Management
    • Management Science and Operations Research
    • Statistics, Probability and Uncertainty
    • Applied Mathematics
    • Modelling and Simulation
    • Transportation

    Cite this

    Minimum directed 1-subtree relaxation for score orienteering problem. / Kataoka, Seiji; Yamada, Takeo; Morito, Susumu.

    In: European Journal of Operational Research, Vol. 104, No. 1, 01.01.1998, p. 139-153.

    Research output: Contribution to journalArticle

    Kataoka, S, Yamada, T & Morito, S 1998, 'Minimum directed 1-subtree relaxation for score orienteering problem', European Journal of Operational Research, vol. 104, no. 1, pp. 139-153.
    Kataoka, Seiji ; Yamada, Takeo ; Morito, Susumu. / Minimum directed 1-subtree relaxation for score orienteering problem. In: European Journal of Operational Research. 1998 ; Vol. 104, No. 1. pp. 139-153.
    @article{29600054006e450a8199547c2ada2933,
    title = "Minimum directed 1-subtree relaxation for score orienteering problem",
    abstract = "Score orienteering is a variant of the orienteering game where competitors start at a specified control point, visit as many control points as possible and thereby collect prizes, and return to the starting point within a prescribed amount of time. The competitor with the highest amount of prizes wins the game. In this paper, we propose the minimum directed 1-subtree problem as a new relaxation to this problem and develop two methods to improve its lower bound. We describe a cut and dual simplex method and a Lagrangian relaxation method, and construct an algorithm that combines these two methods in an appropriate way. Computational experiments are carried out to analyse the behavior of the proposed relaxation with respect to the characteristics of the test problems. Especially for large-scale instances, we find that the proposed relaxation is superior to the ordinary assignment relaxation.",
    keywords = "Minimum directed 1-subtree relaxation, Orienteering problem, Traveling salesman problem",
    author = "Seiji Kataoka and Takeo Yamada and Susumu Morito",
    year = "1998",
    month = "1",
    day = "1",
    language = "English",
    volume = "104",
    pages = "139--153",
    journal = "European Journal of Operational Research",
    issn = "0377-2217",
    publisher = "Elsevier",
    number = "1",

    }

    TY - JOUR

    T1 - Minimum directed 1-subtree relaxation for score orienteering problem

    AU - Kataoka, Seiji

    AU - Yamada, Takeo

    AU - Morito, Susumu

    PY - 1998/1/1

    Y1 - 1998/1/1

    N2 - Score orienteering is a variant of the orienteering game where competitors start at a specified control point, visit as many control points as possible and thereby collect prizes, and return to the starting point within a prescribed amount of time. The competitor with the highest amount of prizes wins the game. In this paper, we propose the minimum directed 1-subtree problem as a new relaxation to this problem and develop two methods to improve its lower bound. We describe a cut and dual simplex method and a Lagrangian relaxation method, and construct an algorithm that combines these two methods in an appropriate way. Computational experiments are carried out to analyse the behavior of the proposed relaxation with respect to the characteristics of the test problems. Especially for large-scale instances, we find that the proposed relaxation is superior to the ordinary assignment relaxation.

    AB - Score orienteering is a variant of the orienteering game where competitors start at a specified control point, visit as many control points as possible and thereby collect prizes, and return to the starting point within a prescribed amount of time. The competitor with the highest amount of prizes wins the game. In this paper, we propose the minimum directed 1-subtree problem as a new relaxation to this problem and develop two methods to improve its lower bound. We describe a cut and dual simplex method and a Lagrangian relaxation method, and construct an algorithm that combines these two methods in an appropriate way. Computational experiments are carried out to analyse the behavior of the proposed relaxation with respect to the characteristics of the test problems. Especially for large-scale instances, we find that the proposed relaxation is superior to the ordinary assignment relaxation.

    KW - Minimum directed 1-subtree relaxation

    KW - Orienteering problem

    KW - Traveling salesman problem

    UR - http://www.scopus.com/inward/record.url?scp=0031675526&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=0031675526&partnerID=8YFLogxK

    M3 - Article

    VL - 104

    SP - 139

    EP - 153

    JO - European Journal of Operational Research

    JF - European Journal of Operational Research

    SN - 0377-2217

    IS - 1

    ER -