Diversity-Oriented Bi-Objective Hyper-heuristics for Patrol Scheduling
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 respec...
Saved in:
Main Authors: | MISIR, Mustafa, LAU, Hoong Chuin |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2014
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/2670 https://ink.library.smu.edu.sg/context/sis_research/article/3670/viewcontent/PATAT2014Lau_DivOrienBiObj.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Reinforcement learning approach to solve dynamic bi-objective police patrol dispatching and rescheduling problem
by: JOE, Waldy, et al.
Published: (2022) -
Hyper-volume Evolutionary Algorithm
by: Le, Khoi Nguyen, et al.
Published: (2017) -
The patrol scheduling problem
by: LAU, Hoong Chuin, et al.
Published: (2012) -
Patrol Scheduling in an Urban Rail Network
by: LAU, Hoong Chuin, et al.
Published: (2016) -
A computational study of representations in genetic programming to evolve dispatching rules for the job shop scheduling problem
by: Nguyen, S., et al.
Published: (2014)