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

Operations Research, Systems Engineering and Industrial Engineering Commons

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

Singapore Management University

Orienteering problem

2015

Articles 1 - 1 of 1

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

An Iterated Local Search Algorithm For Solving The Orienteering Problem With Time Windows, Aldy Gunawan, Hoong Chuin Lau, Kun Lu Apr 2015

An Iterated Local Search Algorithm For Solving The Orienteering Problem With Time Windows, Aldy Gunawan, Hoong Chuin Lau, Kun Lu

Research Collection School Of Computing and Information Systems

The Orienteering Problem with Time Windows (OPTW) is a variant of the Orienteering Problem (OP). Given a set of nodes including their scores, service times and time windows, the goal is to maximize the total of scores collected by a particular route considering a predefined time window during which the service has to start. We propose an Iterated Local Search (ILS) algorithm to solve the OPTW, which is based on several LocalSearch operations, such as swap, 2-opt, insert and replace. We also implement the combination between AcceptanceCriterion and Perturbation mechanisms to control the balance between diversification and intensification of the …