# Approximating Optimisation Solutions for Travelling Officer Problem with Customised Deep Learning Network

arXiv: https://arxiv.org/abs/1903.03348 · HTML: https://mlsanity.com/paper/1903.03348/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 8 Mar 2019.

## Built on by (most cited first, 2 of 2)

- [Promoting Two-sided Fairness in Dynamic Vehicle Routing Problem](https://mlsanity.com/paper/2405.19184/) (2024)
- [Spatial-Aware Deep Reinforcement Learning for the Traveling Officer Problem](https://mlsanity.com/paper/2401.05969/) (2024)

## Abstract (arXiv)

Deep learning has 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 function approximation abilities, and their fast feed-forward computation. In this paper, we outline a method for converting an orienteering problem into a classification problem, and design a customised multi-layer deep learning network 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 performance for this problem.