Approximating Optimisation Solutions for Travelling Officer Problem with Customised Deep Learning Network.
2019
Deep learninghas been extended to a number of new domains with critical success, though some traditional orienteering problems such as the
Travelling Salesman Problem(TSP) and its variants are not commonly solved using such techniques. Deep neural networks (DNNs) are a potentially promising and under-explored solution to solve these problems due to their
powerful functionapproximation abilities, and their fast
feed-forwardcomputation. In this paper, we outline a method for converting an orienteering problem into a classification problem, and design a customised multi-layer
deep learningnetwork to approximate traditional optimisation solutions to this problem. We test the performance of the network on a real-world parking violation dataset, and conduct a generic study that empirically shows the critical architectural components that affect
network performancefor this problem.
Keywords:
-
Correction
-
Source
-
Cite
-
Save
19
References
0
Citations
NaN
KQI