Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Series

Computer Sciences

Singapore Management University

PDF

Orienteering problem

2021

Articles 1 - 1 of 1

Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering

Set Team Orienteering Problem With Time Windows, Aldy Gunawan, Vincent F. Yu, Andros Nicas Sutanto, Panca Jodiawan Jun 2021

Set Team Orienteering Problem With Time Windows, Aldy Gunawan, Vincent F. Yu, Andros Nicas Sutanto, Panca Jodiawan

Research Collection School Of Computing and Information Systems

This research introduces an extension of the Orienteering Problem (OP), known as Set Team Orienteering Problem with Time Windows (STOPTW), in which customers are first grouped into clusters. Each cluster is associated with a profit that will be collected if at least one customer within the cluster is visited. The objective is to find the best route that maximizes the total collected profit without violating time windows and time budget constraints. We propose an adaptive large neighborhood search algorithm to solve newly introduced benchmark instances. The preliminary results show the capability of the proposed algorithm to obtain good solutions within …