LAUSR

The travelling officer problem (TOP) is a graph-based orienteering problem for modelling the patrolling routines of a parking officer monitoring an area. Recently, a spatiotemporal probabilistic model was built for TOP to estimate the leaving probability of parking cars, and relevant algorithms were applied to search for the optimal path for a parking officer to maximize the collection of parking fines from cars in violation. However, there are often multiple parking officers on duty during business hours in the central business district, which provides us with the opportunities to introduce cooperation among officers for efficient car-parking management. The multiple travelling officers problem (MTOP) is a more complex problem than the TOP because multiple officers are involved simultaneously in paths construction. In this study, the MTOP is formulated and new components are established for solving the problem. One essential component called the leader-based random-keys encoding scheme (LERK) is developed for the representation of possible solutions. Then, cuckoo search (CS), genetic algorithm (GA) and particle swarm optimization (PSO) are implemented using the proposed components and compared with other state-of-the-art GA and PSO using other solution encoding schemes to solve MTOP. In addition, two greedy selection algorithms are adopted as baselines. The performance of the algorithms is evaluated with real parking sensors data and different metrics. The experimental results show that the performance of CS and GA using LERK is considerably improved in comparison with that of other implemented algorithms.