Publication Type

Conference Proceeding Article

Version

publishedVersion

Publication Date

8-2014

Abstract

The patrol scheduling problem is concerned with assigning security teams to different stations for distinct time intervals while respecting a limited number of contractual constraints. The objective is to minimise the total distance travelled while maximising the coverage of the stations with respect to their security requirement levels. This paper introduces a hyper-heuristic strategy focusing on generating diverse solutions for a bi-objective patrol scheduling problem. While a variety of hyper-heuristics have been applied to a large suite of problem domains usually in the form of single-objective optimisation, we suggest an alternative approach for solving the patrol scheduling problem with two objectives. An adaptive weighted-sum method with a variety of weight schedules is used instead of a traditional static weighted-sum technique. The idea is to reach more diverse solutions for different objectives. The empirical analysis performed on the Singapore train network dataset demonstrate the effectiveness of our approach.

Keywords

Hyper-heuristics, Bi-objective Optimisation, Patrol Scheduling

Discipline

Artificial Intelligence and Robotics | Numerical Analysis and Scientific Computing | Operations Research, Systems Engineering and Industrial Engineering

Publication

PATAT 2014: Proceedings of the 10th International Conference of the Practice and Theory of Automated Timetabling, 26-29 August 2014, York

First Page

318

Last Page

329

ISBN

9780992998400

Publisher

PATAT

City or Country

York

Copyright Owner and License

LARC

Additional URL

http://www.patatconference.org/patat2014/proceedings/2_18.pdf

Download

Share

COinS