Optimal Route Search with the Coverage of Users' Preferences

The preferences of users are important in route search and planning. For example, when a user plans a trip within a city, their preferences can be expressed as keywords shopping mall, restaurant, and museum, with weights 0.5, 0.4, and 0.1, respectively. The resulting route should best satisfy their weighted preferences. In this paper, we take into account the weighted user preferences in route search, and present a keyword coverage problem, which finds an optimal route from a source location to a target location such that the keyword coverage is optimized and that the budget score satisfies a specified constraint. We prove that this problem is NP-hard. To solve this complex problem, we pro- pose an optimal route search based on an A* variant for which we have defined an admissible heuristic function. The experiments conducted on real-world datasets demonstrate both the efficiency and accu- racy of our proposed algorithms.

Reparation or retribution: an investigation into regulatory compliance in planning

It is an axiom of good planning practice that procedure is informed by up-to-date research. Consequently, it is surprising to discover that there remains a dearth of specialised planning-enforcement literature relating to theory and implementation. In this paper an evaluation is given of the effectiveness of planning enforcement in Britain by reviewing existing legislative mechanisms and strategies employed by officials. Theoretical perspectives are drawn upon to suggest how the system might be improved through attention to the structural factors underpinning it.