A Heuristic Approach For Solving The Team Orienteering Problem With Stochastic Time-Dependent Travel Times

Date

2025-06-27

Author

Ghaffarınasab, Nader

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

54
views

0
downloads

Cite This

The team orienteering problem (TOP) aims at optimally planning a set of routes subject to distance or duration constraints in such a way that the total collected rewards from a given set of customers is maximized. The problem has many applications in different practical areas such as humanitarian relief and disaster response, tourism and sightseeing planning, home healthcare nurse routing, delivery and courier services, maintenance and inspection scheduling, etc. Motivated by the practical issues in city logistics, this study addresses a team orienteering problem with stochastic time-dependent travel times. This problem assumes that the travel times between pairs of nodes in the underlying network are subject to uncertainty and also depend on the departure time at the origin node. The problem is formulated as a two-stage stochastic program and a heuristic procedure based on large neighborhood search (LNS) is proposed to solve it. Computational experiments demonstrate the capability of the proposed approach in solving instances of medium and large sizes in reasonably short computational times.

URI

https://hdl.handle.net/11511/118148

Collections

Department of Industrial Engineering, Conference / Seminar