Premium
Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs
Author(s) -
Fröhlich Georg E. A.,
Doerner Karl F.,
Gansterer Margaretha
Publication year - 2020
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.21993
Subject(s) - patrolling , computer science , simple (philosophy) , routing (electronic design automation) , maximization , mathematical optimization , minification , graph , path (computing) , shortest path problem , theoretical computer science , mathematics , computer network , philosophy , political science , law , programming language , epistemology
Many security companies offer patrolling services, such that guards inspect facilities or streets on a regular basis. Patrolling routes should be cost efficient, but the inspection patterns should not be predictable for offenders. We introduce this setting as a multi‐objective periodic mixed capacitated general routing problem with objectives being cost minimization and route inconsistency maximization. The problem is transformed into an asymmetric capacitated vehicle routing problem, on both a simple‐graph and a multi‐graph; and three multi‐objective frameworks using adaptive large neighborhood search are implemented to solve it. As tests with both artificial and real‐world instances show that some frameworks perform better for some indicators, a hybrid search procedure, combining two of them, is developed and benchmarked against the individual solution methods. Generally, results indicate that considering more than one shortest path between nodes, can significantly increase solution quality for smaller instances, but is quickly becoming a detriment for larger instances.