Set Team Orienteering Problem with Time Windows

• Main Authors: GUNAWAN, Aldy, YU, Vincent F., SUTANTO, Andros Nicas, JODIAWAN, Panca
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2021
• Subjects: orienteering problem; time windows; adaptive large neighborhood search; Artificial Intelligence and Robotics; Operations Research, Systems Engineering and Industrial Engineering; Theory and Algorithms
• Online Access: https://ink.library.smu.edu.sg/sis_research/6036; https://ink.library.smu.edu.sg/context/sis_research/article/7039/viewcontent/STOP.pdf
• Institution: Singapore Management University

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 reasonable computational times compared to commercial solver CPLEX.