The orienteering problem

Golden, Bruce L.; Levy, Larry; Vohra, Rakesh

doi:10.1002/1520-6750(198706)34:3<307::aid-nav3220340302>3.0.co;2-d

Cited by 653 publications

(328 citation statements)

References 3 publications

Supporting

Mentioning

322

Contrasting

Unclassified

Order By: Relevance

“…The Orienteering Problem also contains rewards at each node; the objective is to maximise the total reward collected subject to a time constraint. See, for example, Golden et al [13] and Ramesh et al [14].…”

Section: Literature Reviewmentioning

confidence: 99%

A Bi-Modal Routing Problem with Cyclical and One-Way Trips: Formulation and Heuristic Solution

Grinde

2017

Information Technology and Management Science

View full text Add to dashboard Cite

-A bi-modal routing problem is solved using a heuristic approach. Motivated by a recreational hiking application, the problem is similar to routing problems in business with two transport modes. The problem decomposes into a set covering problem (SCP) and an asymmetric traveling salesperson problem (ATSP), corresponding to a hiking time objective and a driving distance objective. The solution algorithm considers hiking time first, but finds all alternate optimal solutions, as inputs to the driving distance problem. Results show the trade-offs between the two objectives.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

A Bi-Modal Routing Problem with Cyclical and One-Way Trips: Formulation and Heuristic Solution

Grinde

2017

Information Technology and Management Science

View full text Add to dashboard Cite

show abstract

“…The problem is to compute a route that (1) starts at the given starting location, (2) have a length that does not exceed the given distance limit and (3) goes via objects whose total score is maximal. The orienteering problem has been studied extensively [2,5] and several heuristics [1,4,8,9,16] and approximation algorithms [12] were proposed for it.…”

Section: Related Workmentioning

confidence: 99%

Route Search over Probabilistic Geospatial Data

Kanza

Safra

Sagiv

2009

Advances in Spatial and Temporal Databases

View full text Add to dashboard Cite

Abstract. In a route search over geospatial data, a user provides terms for specifying types of geographical entities that she wishes to visit. The goal is to find a route that (1) starts at a given location, (2) ends at a given location, and (3) travels via geospatial entities that are relevant to the provided search terms. Earlier work studied the problem of finding a route that is effective in the sense that its length does not exceed a given limit, the relevancy of the objects is as high as possible, and the route visits a single object from each specified type. This paper investigates route search over probabilistic geospatial data. It is shown that the notion of an effective route requires a new definition and, specifically, two alternative semantics are proposed. Computing an effective route is more complicated, compared to the non-probabilistic case, and hence necessitates new algorithms. Heuristic methods for computing an effective route, under either one of the two semantics, are developed. (Note that the problem is NP-hard.) These methods are compared analytically and experimentally. In particular, experiments on both synthetic and realworld data illustrate the efficiency and effectiveness of these methods in computing a route under the two semantics.

show abstract

“…In the PTP (Dell'Amico et al, 1995) the objective is to find a TSP tour that maximizes total collected profits minus travel costs. The OP (Golden et al, 1987) is similar to the PTP, with a constraint on total travel or cost. Finally, the PCTSP (Balas, 1989) is similar to the PTP but with a constraint on the amount of profit that must be collected in a tour.…”

Section: Vrp Background Reviewmentioning

confidence: 99%

Pricing in Dynamic Vehicle Routing Problems

Figliozzi

Mahmassani

Jaillet

2007

Transportation Science

View full text Add to dashboard Cite

ABSTRACT:The principal focus of this paper is to study carrier pricing decisions for a new type of vehicle routing problems defined in a competitive and dynamic environment. This paper introduces the Vehicle Routing Problem in a Competitive Environment (VRPCE), as an extension of the Traveling Salesman Problem with Profits (TSPP) to a dynamic competitive auction environment. In the VRPCE, the carrier must estimate the incremental cost of servicing new service requests as they arrive dynamically. The paper presents a rigorous and precise treatment of the sequential pricing and costing problem that a carrier faces in such an environment. The sequential pricing problem presented here is an intrinsic feature of a sequential auction problem. In addition to introducing the formulation of this class of problems and discussing the main sources of difficulty in devising a solution, a simple example is constructed to show that carriers' prices under first price auction payment rules do not necessarily reflect the cost of servicing transportation requests. An approximate solution approach with a finite look-ahead horizon is presented and illustrated through numerical experiments, in competition with a static approach with no look-ahead.

show abstract

The orienteering problem

Cited by 653 publications

References 3 publications

A Bi-Modal Routing Problem with Cyclical and One-Way Trips: Formulation and Heuristic Solution

A Bi-Modal Routing Problem with Cyclical and One-Way Trips: Formulation and Heuristic Solution

Route Search over Probabilistic Geospatial Data

Pricing in Dynamic Vehicle Routing Problems

Contact Info

Product

Resources

About