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

Physical Sciences and Mathematics Commons

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

Engineering

Research Collection School Of Computing and Information Systems

2018

Capacitated orienteering problem

Articles 1 - 1 of 1

Full-Text Articles in Physical Sciences and Mathematics

Iterated Local Search Algorithm For The Capacitated Team Orienteering Problem, Aldy Gunawan, Kien Ming Ng, Vincent F. Yu, Gordy Adiprasetyo, Hoong Chuin Lau Aug 2018

Iterated Local Search Algorithm For The Capacitated Team Orienteering Problem, Aldy Gunawan, Kien Ming Ng, Vincent F. Yu, Gordy Adiprasetyo, Hoong Chuin Lau

Research Collection School Of Computing and Information Systems

This paper focuses on a recent variant of the Orienteering Problem (OP), namely the Capacitated Team Orienteering Problem (CTOP). In this problem, each node is associated with a demand that needs to be satisfied and a score that need to be collected. Given a set of homogeneous fleet of vehicles, the main objective is to find a path for each available vehicle in order to maximize the total score, without violating the capacity and time budget of each vehicle. We propose an Iterated Local Search algorithm that has been applied in solving various variants of the OP. We propose two …