Titel
Secure and efficient routing on nodes, edges, and arcs of simple‐graphs and of multi‐graphs
Abstract
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.
Stichwort
adaptive large neighborhood searchinconsistencymulti-objective optimizationvehicle routingepsilon box splitting heuristicmulti-graph
Objekt-Typ
Sprache
Englisch [eng]
Persistent identifier
https://phaidra.univie.ac.at/o:1219383
Erschienen in
Titel
Networks
Band
76
Ausgabe
4
ISSN
0028-3045
Erscheinungsdatum
2020
Seitenanfang
431
Seitenende
450
Verlag
Wiley
Erscheinungsdatum
2020
Zugänglichkeit
Rechteangabe
© 2020 The Authors

Herunterladen

Universität Wien | Universitätsring 1 | 1010 Wien | T +43-1-4277-0